./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-14.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-14.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX --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 a71af419f1cf7bbebb13c8d54f46d0884d8f6a6c7b285256c6b3de9eb723dc12 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:19:42,817 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:19:42,885 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 16:19:42,889 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:19:42,890 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:19:42,913 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:19:42,913 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:19:42,914 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:19:42,915 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:19:42,915 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:19:42,916 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:19:42,917 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:19:42,917 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:19:42,918 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:19:42,918 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:19:42,919 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:19:42,919 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:19:42,919 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:19:42,923 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:19:42,924 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:19:42,924 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:19:42,925 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:19:42,925 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:19:42,925 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:19:42,926 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:19:42,926 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:19:42,926 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:19:42,927 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:19:42,927 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:19:42,927 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:19:42,928 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:19:42,928 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:19:42,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:19:42,929 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:19:42,929 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:19:42,930 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:19:42,930 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:19:42,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 16:19:42,930 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:19:42,931 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:19:42,931 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:19:42,934 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:19:42,934 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX 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 -> a71af419f1cf7bbebb13c8d54f46d0884d8f6a6c7b285256c6b3de9eb723dc12 [2024-11-08 16:19:43,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:19:43,267 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:19:43,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:19:43,271 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:19:43,272 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:19:43,273 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-14.i Unable to find full path for "g++" [2024-11-08 16:19:45,483 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:19:45,749 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:19:45,754 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-14.i [2024-11-08 16:19:45,766 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/data/0ea75b50d/5259bd13bea144ad8b5b1a68509a0fef/FLAG818d5f975 [2024-11-08 16:19:45,782 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/data/0ea75b50d/5259bd13bea144ad8b5b1a68509a0fef [2024-11-08 16:19:45,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:19:45,787 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:19:45,789 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:19:45,789 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:19:45,797 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:19:45,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:19:45" (1/1) ... [2024-11-08 16:19:45,802 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@433e8ff2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:19:45, skipping insertion in model container [2024-11-08 16:19:45,802 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:19:45" (1/1) ... [2024-11-08 16:19:45,829 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:19:46,017 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_ce5f236d-f06e-4ace-b85c-be27eef0a566/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-14.i[916,929] [2024-11-08 16:19:46,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:19:46,086 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:19:46,099 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_ce5f236d-f06e-4ace-b85c-be27eef0a566/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-14.i[916,929] [2024-11-08 16:19:46,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:19:46,158 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:19:46,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:19:46 WrapperNode [2024-11-08 16:19:46,159 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:19:46,161 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:19:46,161 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:19:46,161 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:19:46,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:19:46" (1/1) ... [2024-11-08 16:19:46,178 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:19:46" (1/1) ... [2024-11-08 16:19:46,221 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 133 [2024-11-08 16:19:46,222 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:19:46,223 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:19:46,223 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:19:46,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:19:46,237 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:19:46" (1/1) ... [2024-11-08 16:19:46,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:19:46" (1/1) ... [2024-11-08 16:19:46,241 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:19:46" (1/1) ... [2024-11-08 16:19:46,262 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 16:19:46,262 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:19:46" (1/1) ... [2024-11-08 16:19:46,262 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:19:46" (1/1) ... [2024-11-08 16:19:46,276 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:19:46" (1/1) ... [2024-11-08 16:19:46,282 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:19:46" (1/1) ... [2024-11-08 16:19:46,285 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:19:46" (1/1) ... [2024-11-08 16:19:46,289 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:19:46" (1/1) ... [2024-11-08 16:19:46,292 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:19:46,297 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:19:46,297 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:19:46,297 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:19:46,298 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:19:46" (1/1) ... [2024-11-08 16:19:46,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:19:46,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:19:46,342 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:19:46,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:19:46,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:19:46,390 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 16:19:46,390 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 16:19:46,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 16:19:46,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:19:46,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:19:46,519 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:19:46,522 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:19:46,934 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-08 16:19:46,934 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:19:46,947 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:19:46,948 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:19:46,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:19:46 BoogieIcfgContainer [2024-11-08 16:19:46,948 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:19:46,951 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:19:46,952 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:19:46,955 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:19:46,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:19:45" (1/3) ... [2024-11-08 16:19:46,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ffaf049 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:19:46, skipping insertion in model container [2024-11-08 16:19:46,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:19:46" (2/3) ... [2024-11-08 16:19:46,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ffaf049 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:19:46, skipping insertion in model container [2024-11-08 16:19:46,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:19:46" (3/3) ... [2024-11-08 16:19:46,959 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-14.i [2024-11-08 16:19:47,001 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:19:47,001 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:19:47,067 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:19:47,073 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;@24bd76a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:19:47,073 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:19:47,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-08 16:19:47,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 16:19:47,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:19:47,093 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:19:47,094 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:19:47,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:19:47,099 INFO L85 PathProgramCache]: Analyzing trace with hash 316885076, now seen corresponding path program 1 times [2024-11-08 16:19:47,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:19:47,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668040608] [2024-11-08 16:19:47,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:19:47,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:19:47,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:47,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:19:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:47,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:19:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:47,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 16:19:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:47,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:19:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:47,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 16:19:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:47,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:19:47,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:47,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:19:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:47,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 16:19:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:47,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 16:19:47,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:47,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 16:19:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:47,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 16:19:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:47,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:19:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:47,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:19:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:47,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 16:19:47,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:47,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 16:19:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:47,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 16:19:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:47,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 16:19:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:47,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 16:19:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:47,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 16:19:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:47,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 16:19:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:47,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 16:19:47,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:47,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 16:19:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:47,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 16:19:47,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:47,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:19:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:47,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-08 16:19:47,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:47,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 16:19:47,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:19:47,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668040608] [2024-11-08 16:19:47,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668040608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:19:47,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:19:47,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:19:47,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263935272] [2024-11-08 16:19:47,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:19:47,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:19:47,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:19:47,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:19:47,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:19:47,694 INFO L87 Difference]: Start difference. First operand has 62 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-08 16:19:47,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:19:47,725 INFO L93 Difference]: Finished difference Result 117 states and 207 transitions. [2024-11-08 16:19:47,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:19:47,727 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 151 [2024-11-08 16:19:47,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:19:47,735 INFO L225 Difference]: With dead ends: 117 [2024-11-08 16:19:47,736 INFO L226 Difference]: Without dead ends: 58 [2024-11-08 16:19:47,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 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-08 16:19:47,743 INFO L432 NwaCegarLoop]: 87 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, 87 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-08 16:19:47,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:19:47,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-08 16:19:47,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-08 16:19:47,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-08 16:19:47,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 87 transitions. [2024-11-08 16:19:47,793 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 87 transitions. Word has length 151 [2024-11-08 16:19:47,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:19:47,794 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 87 transitions. [2024-11-08 16:19:47,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-08 16:19:47,794 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 87 transitions. [2024-11-08 16:19:47,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 16:19:47,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:19:47,803 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:19:47,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 16:19:47,803 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:19:47,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:19:47,804 INFO L85 PathProgramCache]: Analyzing trace with hash 873758226, now seen corresponding path program 1 times [2024-11-08 16:19:47,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:19:47,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146985598] [2024-11-08 16:19:47,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:19:47,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:19:47,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:48,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:19:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:48,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:19:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:48,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 16:19:48,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:48,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:19:48,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:48,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 16:19:48,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:48,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:19:48,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:48,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:19:48,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:48,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 16:19:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:48,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 16:19:48,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:48,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 16:19:48,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:48,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 16:19:48,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:48,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:19:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:48,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:19:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:48,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 16:19:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:48,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 16:19:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:48,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 16:19:48,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:48,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 16:19:48,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:48,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 16:19:48,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:48,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 16:19:48,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:48,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 16:19:48,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:48,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 16:19:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:48,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 16:19:48,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:48,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 16:19:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:48,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:19:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:48,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-08 16:19:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:48,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 16:19:48,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:19:48,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146985598] [2024-11-08 16:19:48,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146985598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:19:48,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:19:48,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:19:48,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739242203] [2024-11-08 16:19:48,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:19:48,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:19:48,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:19:48,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:19:48,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:19:48,582 INFO L87 Difference]: Start difference. First operand 58 states and 87 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 16:19:48,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:19:48,896 INFO L93 Difference]: Finished difference Result 169 states and 256 transitions. [2024-11-08 16:19:48,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:19:48,897 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 151 [2024-11-08 16:19:48,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:19:48,904 INFO L225 Difference]: With dead ends: 169 [2024-11-08 16:19:48,905 INFO L226 Difference]: Without dead ends: 114 [2024-11-08 16:19:48,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:19:48,910 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 43 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:19:48,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 241 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 16:19:48,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-08 16:19:48,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2024-11-08 16:19:48,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 49 states have internal predecessors, (55), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-08 16:19:48,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 155 transitions. [2024-11-08 16:19:48,969 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 155 transitions. Word has length 151 [2024-11-08 16:19:48,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:19:48,970 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 155 transitions. [2024-11-08 16:19:48,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 16:19:48,970 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 155 transitions. [2024-11-08 16:19:48,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 16:19:48,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:19:48,978 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:19:48,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 16:19:48,979 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:19:48,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:19:48,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1553816596, now seen corresponding path program 1 times [2024-11-08 16:19:48,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:19:48,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442816908] [2024-11-08 16:19:48,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:19:48,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:19:49,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:55,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:19:55,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:55,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:19:55,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:55,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 16:19:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:55,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:19:55,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:55,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 16:19:55,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:55,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:19:55,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:55,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:19:55,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:55,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 16:19:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:55,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 16:19:55,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:55,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 16:19:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:55,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 16:19:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:55,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:19:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:55,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:19:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:55,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 16:19:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:55,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 16:19:55,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:55,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 16:19:55,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:55,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 16:19:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:55,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 16:19:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:55,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 16:19:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:55,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 16:19:55,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:55,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 16:19:55,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:55,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 16:19:55,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:55,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 16:19:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:55,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:19:55,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:55,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-08 16:19:55,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:55,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 16:19:55,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:19:55,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442816908] [2024-11-08 16:19:55,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442816908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:19:55,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:19:55,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 16:19:55,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651920349] [2024-11-08 16:19:55,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:19:55,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:19:55,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:19:55,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:19:55,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:19:55,199 INFO L87 Difference]: Start difference. First operand 102 states and 155 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 16:19:55,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:19:55,932 INFO L93 Difference]: Finished difference Result 140 states and 200 transitions. [2024-11-08 16:19:55,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 16:19:55,933 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 151 [2024-11-08 16:19:55,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:19:55,936 INFO L225 Difference]: With dead ends: 140 [2024-11-08 16:19:55,936 INFO L226 Difference]: Without dead ends: 138 [2024-11-08 16:19:55,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:19:55,938 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 41 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:19:55,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 393 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 16:19:55,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-08 16:19:55,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 109. [2024-11-08 16:19:55,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 56 states have internal predecessors, (65), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-08 16:19:55,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 165 transitions. [2024-11-08 16:19:55,960 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 165 transitions. Word has length 151 [2024-11-08 16:19:55,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:19:55,961 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 165 transitions. [2024-11-08 16:19:55,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 16:19:55,961 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 165 transitions. [2024-11-08 16:19:55,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 16:19:55,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:19:55,963 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:19:55,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 16:19:55,964 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:19:55,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:19:55,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1555663638, now seen corresponding path program 1 times [2024-11-08 16:19:55,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:19:55,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576426979] [2024-11-08 16:19:55,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:19:55,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:19:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:59,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:19:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:59,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:19:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:59,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 16:19:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:59,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:19:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:59,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 16:19:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:59,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:19:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:59,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:19:59,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:59,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 16:19:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:59,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 16:19:59,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:59,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 16:19:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:59,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 16:19:59,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:59,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:19:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:59,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:19:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:59,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 16:19:59,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:59,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 16:19:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:59,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 16:19:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:59,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 16:19:59,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:59,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 16:19:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:59,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 16:19:59,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:59,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 16:19:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:59,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 16:19:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:59,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 16:19:59,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:59,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 16:19:59,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:59,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:19:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:59,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-08 16:19:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:19:59,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 16:19:59,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:19:59,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576426979] [2024-11-08 16:19:59,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576426979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:19:59,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:19:59,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 16:19:59,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543707256] [2024-11-08 16:19:59,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:19:59,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:19:59,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:19:59,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:19:59,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:19:59,971 INFO L87 Difference]: Start difference. First operand 109 states and 165 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 16:20:00,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:20:00,512 INFO L93 Difference]: Finished difference Result 135 states and 194 transitions. [2024-11-08 16:20:00,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 16:20:00,513 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 151 [2024-11-08 16:20:00,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:20:00,515 INFO L225 Difference]: With dead ends: 135 [2024-11-08 16:20:00,515 INFO L226 Difference]: Without dead ends: 133 [2024-11-08 16:20:00,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:20:00,519 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 55 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:20:00,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 322 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 16:20:00,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-08 16:20:00,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 112. [2024-11-08 16:20:00,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 59 states have (on average 1.1864406779661016) internal successors, (70), 59 states have internal predecessors, (70), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-08 16:20:00,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 170 transitions. [2024-11-08 16:20:00,548 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 170 transitions. Word has length 151 [2024-11-08 16:20:00,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:20:00,549 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 170 transitions. [2024-11-08 16:20:00,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 16:20:00,549 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 170 transitions. [2024-11-08 16:20:00,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 16:20:00,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:20:00,552 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:20:00,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 16:20:00,552 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:20:00,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:20:00,552 INFO L85 PathProgramCache]: Analyzing trace with hash -966143338, now seen corresponding path program 1 times [2024-11-08 16:20:00,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:20:00,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284830544] [2024-11-08 16:20:00,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:20:00,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:20:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:03,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:20:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:03,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:20:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:03,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 16:20:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:03,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:20:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:03,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 16:20:03,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:03,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:20:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:03,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:20:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:03,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 16:20:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:03,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 16:20:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:03,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 16:20:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:03,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 16:20:03,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:03,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:20:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:03,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:20:03,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:03,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 16:20:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:03,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 16:20:03,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:03,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 16:20:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:03,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 16:20:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:03,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 16:20:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:03,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 16:20:03,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:03,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 16:20:03,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:03,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 16:20:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:03,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 16:20:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:03,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 16:20:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:03,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:20:03,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:03,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-08 16:20:03,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:03,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 16:20:03,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:20:03,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284830544] [2024-11-08 16:20:03,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284830544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:20:03,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:20:03,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 16:20:03,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55412822] [2024-11-08 16:20:03,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:20:03,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 16:20:03,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:20:03,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 16:20:03,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:20:03,587 INFO L87 Difference]: Start difference. First operand 112 states and 170 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 16:20:04,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:20:04,190 INFO L93 Difference]: Finished difference Result 135 states and 194 transitions. [2024-11-08 16:20:04,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 16:20:04,191 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 151 [2024-11-08 16:20:04,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:20:04,193 INFO L225 Difference]: With dead ends: 135 [2024-11-08 16:20:04,193 INFO L226 Difference]: Without dead ends: 133 [2024-11-08 16:20:04,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-08 16:20:04,195 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 51 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:20:04,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 316 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 16:20:04,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-08 16:20:04,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 114. [2024-11-08 16:20:04,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 61 states have internal predecessors, (73), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-08 16:20:04,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 173 transitions. [2024-11-08 16:20:04,214 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 173 transitions. Word has length 151 [2024-11-08 16:20:04,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:20:04,215 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 173 transitions. [2024-11-08 16:20:04,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 16:20:04,215 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 173 transitions. [2024-11-08 16:20:04,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 16:20:04,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:20:04,221 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:20:04,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 16:20:04,222 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:20:04,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:20:04,222 INFO L85 PathProgramCache]: Analyzing trace with hash -964296296, now seen corresponding path program 1 times [2024-11-08 16:20:04,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:20:04,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141465907] [2024-11-08 16:20:04,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:20:04,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:20:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:07,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:20:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:07,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:20:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:07,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 16:20:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:07,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:20:07,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:07,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 16:20:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:07,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:20:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:07,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:20:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:07,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 16:20:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:07,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 16:20:07,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:07,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 16:20:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:07,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 16:20:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:07,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:20:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:07,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:20:07,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:07,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 16:20:07,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:07,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 16:20:07,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:07,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 16:20:07,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:07,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 16:20:07,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:07,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 16:20:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:07,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 16:20:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:07,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 16:20:07,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:07,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 16:20:07,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:07,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 16:20:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:07,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 16:20:07,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:07,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:20:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:07,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-08 16:20:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:07,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 16:20:07,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:20:07,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141465907] [2024-11-08 16:20:07,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141465907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:20:07,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:20:07,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 16:20:07,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429473956] [2024-11-08 16:20:07,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:20:07,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 16:20:07,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:20:07,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 16:20:07,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 16:20:07,917 INFO L87 Difference]: Start difference. First operand 114 states and 173 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 16:20:08,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:20:08,650 INFO L93 Difference]: Finished difference Result 133 states and 192 transitions. [2024-11-08 16:20:08,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 16:20:08,650 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 151 [2024-11-08 16:20:08,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:20:08,652 INFO L225 Difference]: With dead ends: 133 [2024-11-08 16:20:08,652 INFO L226 Difference]: Without dead ends: 131 [2024-11-08 16:20:08,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:20:08,654 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 41 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:20:08,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 370 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 16:20:08,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-08 16:20:08,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 112. [2024-11-08 16:20:08,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 59 states have (on average 1.1864406779661016) internal successors, (70), 59 states have internal predecessors, (70), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-08 16:20:08,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 170 transitions. [2024-11-08 16:20:08,673 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 170 transitions. Word has length 151 [2024-11-08 16:20:08,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:20:08,674 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 170 transitions. [2024-11-08 16:20:08,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 16:20:08,675 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 170 transitions. [2024-11-08 16:20:08,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 16:20:08,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:20:08,677 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:20:08,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 16:20:08,678 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:20:08,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:20:08,678 INFO L85 PathProgramCache]: Analyzing trace with hash 353325508, now seen corresponding path program 1 times [2024-11-08 16:20:08,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:20:08,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470030556] [2024-11-08 16:20:08,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:20:08,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:20:08,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:09,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 16:20:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:09,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 16:20:09,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:09,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 16:20:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:09,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 16:20:09,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:09,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 16:20:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:09,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 16:20:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:09,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 16:20:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:09,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 16:20:09,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:09,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 16:20:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:09,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 16:20:09,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:09,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 16:20:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:09,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 16:20:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:09,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 16:20:09,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:09,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 16:20:09,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:09,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 16:20:09,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:09,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 16:20:09,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:09,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 16:20:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:09,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 16:20:09,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:09,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 16:20:09,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:09,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 16:20:09,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:09,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 16:20:09,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:09,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 16:20:09,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:09,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 16:20:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:09,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 16:20:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:09,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-08 16:20:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:09,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 30 proven. 42 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-08 16:20:09,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:20:09,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470030556] [2024-11-08 16:20:09,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470030556] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:20:09,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294710061] [2024-11-08 16:20:09,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:20:09,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:20:09,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:20:09,113 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:20:09,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 16:20:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:09,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 16:20:09,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:20:09,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 604 proven. 42 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2024-11-08 16:20:09,590 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:20:10,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 30 proven. 42 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-08 16:20:10,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294710061] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:20:10,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:20:10,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2024-11-08 16:20:10,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896647042] [2024-11-08 16:20:10,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:20:10,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 16:20:10,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:20:10,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 16:20:10,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:20:10,012 INFO L87 Difference]: Start difference. First operand 112 states and 170 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-08 16:20:10,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:20:10,335 INFO L93 Difference]: Finished difference Result 189 states and 279 transitions. [2024-11-08 16:20:10,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 16:20:10,336 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 152 [2024-11-08 16:20:10,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:20:10,338 INFO L225 Difference]: With dead ends: 189 [2024-11-08 16:20:10,338 INFO L226 Difference]: Without dead ends: 124 [2024-11-08 16:20:10,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 349 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-11-08 16:20:10,340 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 101 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:20:10,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 133 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 16:20:10,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-08 16:20:10,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 116. [2024-11-08 16:20:10,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 61 states have (on average 1.098360655737705) internal successors, (67), 61 states have internal predecessors, (67), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-08 16:20:10,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 167 transitions. [2024-11-08 16:20:10,362 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 167 transitions. Word has length 152 [2024-11-08 16:20:10,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:20:10,363 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 167 transitions. [2024-11-08 16:20:10,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-08 16:20:10,363 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 167 transitions. [2024-11-08 16:20:10,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 16:20:10,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:20:10,365 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:20:10,387 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 16:20:10,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-08 16:20:10,566 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:20:10,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:20:10,567 INFO L85 PathProgramCache]: Analyzing trace with hash 355172550, now seen corresponding path program 1 times [2024-11-08 16:20:10,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:20:10,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41052992] [2024-11-08 16:20:10,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:20:10,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:20:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 16:20:10,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [869752850] [2024-11-08 16:20:10,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:20:10,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:20:10,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:20:10,656 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:20:10,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 16:20:11,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:20:11,233 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 16:20:11,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 16:20:11,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 16:20:11,372 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 16:20:11,373 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 16:20:11,396 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 16:20:11,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:20:11,578 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:20:11,688 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 16:20:11,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 04:20:11 BoogieIcfgContainer [2024-11-08 16:20:11,693 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 16:20:11,693 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 16:20:11,693 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 16:20:11,693 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 16:20:11,694 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:19:46" (3/4) ... [2024-11-08 16:20:11,697 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 16:20:11,699 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 16:20:11,700 INFO L158 Benchmark]: Toolchain (without parser) took 25912.94ms. Allocated memory was 159.4MB in the beginning and 406.8MB in the end (delta: 247.5MB). Free memory was 117.9MB in the beginning and 278.4MB in the end (delta: -160.5MB). Peak memory consumption was 88.6MB. Max. memory is 16.1GB. [2024-11-08 16:20:11,700 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 107.0MB. Free memory is still 57.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:20:11,700 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.22ms. Allocated memory is still 159.4MB. Free memory was 117.9MB in the beginning and 103.1MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 16:20:11,701 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.57ms. Allocated memory is still 159.4MB. Free memory was 103.1MB in the beginning and 100.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 16:20:11,701 INFO L158 Benchmark]: Boogie Preprocessor took 69.79ms. Allocated memory is still 159.4MB. Free memory was 100.0MB in the beginning and 96.2MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 16:20:11,702 INFO L158 Benchmark]: RCFGBuilder took 651.76ms. Allocated memory is still 159.4MB. Free memory was 96.2MB in the beginning and 77.5MB in the end (delta: 18.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 16:20:11,702 INFO L158 Benchmark]: TraceAbstraction took 24741.29ms. Allocated memory was 159.4MB in the beginning and 406.8MB in the end (delta: 247.5MB). Free memory was 76.5MB in the beginning and 278.4MB in the end (delta: -201.9MB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB. [2024-11-08 16:20:11,702 INFO L158 Benchmark]: Witness Printer took 5.99ms. Allocated memory is still 406.8MB. Free memory is still 278.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 16:20:11,704 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 107.0MB. Free memory is still 57.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.22ms. Allocated memory is still 159.4MB. Free memory was 117.9MB in the beginning and 103.1MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.57ms. Allocated memory is still 159.4MB. Free memory was 103.1MB in the beginning and 100.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.79ms. Allocated memory is still 159.4MB. Free memory was 100.0MB in the beginning and 96.2MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 651.76ms. Allocated memory is still 159.4MB. Free memory was 96.2MB in the beginning and 77.5MB in the end (delta: 18.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 24741.29ms. Allocated memory was 159.4MB in the beginning and 406.8MB in the end (delta: 247.5MB). Free memory was 76.5MB in the beginning and 278.4MB in the end (delta: -201.9MB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB. * Witness Printer took 5.99ms. Allocated memory is still 406.8MB. Free memory is still 278.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 109. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 1000000; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 1; [L25] signed short int var_1_5 = -64; [L26] signed short int var_1_6 = -64; [L27] signed short int var_1_7 = 10; [L28] signed short int var_1_8 = 8; [L29] unsigned char var_1_9 = 0; [L30] unsigned char var_1_10 = 1; [L31] unsigned char var_1_11 = 0; [L32] unsigned short int var_1_12 = 2; [L33] signed long int var_1_13 = 32; [L34] signed long int var_1_14 = 15; [L35] signed long int var_1_15 = 256; [L36] signed long int var_1_16 = 8; [L37] unsigned short int var_1_17 = 57581; [L38] unsigned char last_1_var_1_9 = 0; VAL [isInitial=0, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=0, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L113] isInitial = 1 [L114] FCALL initially() [L115] COND TRUE 1 [L116] CALL updateLastVariables() [L106] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=0, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L116] RET updateLastVariables() [L117] CALL updateVariables() [L67] var_1_2 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L68] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L69] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L69] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L70] var_1_3 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L71] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L72] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L72] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=-64, var_1_7=10, var_1_8=8, var_1_9=0] [L73] var_1_6 = __VERIFIER_nondet_short() [L74] CALL assume_abort_if_not(var_1_6 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=10, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=10, var_1_8=8, var_1_9=0] [L74] RET assume_abort_if_not(var_1_6 >= -32767) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=10, var_1_8=8, var_1_9=0] [L75] CALL assume_abort_if_not(var_1_6 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=10, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=10, var_1_8=8, var_1_9=0] [L75] RET assume_abort_if_not(var_1_6 <= 32766) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=10, var_1_8=8, var_1_9=0] [L76] var_1_7 = __VERIFIER_nondet_short() [L77] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=8, var_1_9=0] [L77] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=8, var_1_9=0] [L78] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=8, var_1_9=0] [L78] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=8, var_1_9=0] [L79] var_1_8 = __VERIFIER_nondet_short() [L80] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L80] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L81] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L81] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L82] var_1_10 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L83] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L84] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L84] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=0, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L85] var_1_11 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L86] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L87] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L87] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=32, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L88] var_1_13 = __VERIFIER_nondet_long() [L89] CALL assume_abort_if_not(var_1_13 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=0, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=0, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L89] RET assume_abort_if_not(var_1_13 >= -2147483648) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=0, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L90] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=0, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=0, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L90] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=0, var_1_14=15, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L91] var_1_14 = __VERIFIER_nondet_long() [L92] CALL assume_abort_if_not(var_1_14 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L92] RET assume_abort_if_not(var_1_14 >= -2147483648) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L93] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L93] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L94] CALL assume_abort_if_not(var_1_14 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L94] RET assume_abort_if_not(var_1_14 != 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=256, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L95] var_1_15 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_15 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L96] RET assume_abort_if_not(var_1_15 >= -2147483648) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L97] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L97] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=8, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L98] var_1_16 = __VERIFIER_nondet_long() [L99] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L99] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L100] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L100] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=57581, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L101] var_1_17 = __VERIFIER_nondet_ushort() [L102] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=32767, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=32767, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L102] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=32767, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L103] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=32767, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=32767, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L103] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=32767, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=-64, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L117] RET updateVariables() [L118] CALL step() [L42] COND FALSE !(\read(last_1_var_1_9)) [L45] var_1_5 = ((var_1_7 + 16) - var_1_8) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=32767, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=16399, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L47] COND TRUE (var_1_13 / var_1_14) <= var_1_15 VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=32767, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=16399, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L48] COND TRUE (var_1_16 - 2.3) > var_1_14 [L49] var_1_12 = (var_1_17 - var_1_7) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=16384, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=32767, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=16399, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L56] COND TRUE ((var_1_5 >= var_1_12) && var_1_2) && var_1_3 [L57] var_1_9 = (! var_1_10) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=16384, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=32767, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=16399, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L61] unsigned char stepLocal_0 = var_1_9; VAL [isInitial=1, last_1_var_1_9=0, stepLocal_0=0, var_1_10=1, var_1_11=1, var_1_12=16384, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=32767, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=16399, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L62] COND FALSE !(stepLocal_0 && var_1_9) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=16384, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=32767, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=16399, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L118] RET step() [L119] CALL, EXPR property() [L109-L110] return ((((var_1_9 && var_1_9) ? (var_1_1 == ((signed long int) var_1_5)) : 1) && (last_1_var_1_9 ? (var_1_5 == ((signed short int) var_1_6)) : (var_1_5 == ((signed short int) ((var_1_7 + 16) - var_1_8))))) && ((((var_1_5 >= var_1_12) && var_1_2) && var_1_3) ? (var_1_9 == ((unsigned char) (! var_1_10))) : (var_1_9 == ((unsigned char) (! (var_1_11 || var_1_10)))))) && (((var_1_13 / var_1_14) <= var_1_15) ? (((var_1_16 - 2.3) > var_1_14) ? (var_1_12 == ((unsigned short int) (var_1_17 - var_1_7))) : (var_1_12 == ((unsigned short int) ((((var_1_7) > (((((var_1_17 - var_1_8) < 0 ) ? -(var_1_17 - var_1_8) : (var_1_17 - var_1_8))))) ? (var_1_7) : (((((var_1_17 - var_1_8) < 0 ) ? -(var_1_17 - var_1_8) : (var_1_17 - var_1_8))))))))) : (var_1_12 == ((unsigned short int) var_1_8))) ; VAL [\result=0, isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=16384, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=32767, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=16399, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L119] RET, EXPR property() [L119] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=16384, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=32767, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=16399, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=16384, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=32767, var_1_1=1000000, var_1_2=1, var_1_3=1, var_1_5=16399, var_1_6=16398, var_1_7=16383, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.5s, OverallIterations: 8, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 356 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 332 mSDsluCounter, 1862 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1313 mSDsCounter, 128 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 685 IncrementalHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 128 mSolverCounterUnsat, 549 mSDtfsCounter, 685 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 740 GetRequests, 687 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=7, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 108 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 18.8s InterpolantComputationTime, 1514 NumberOfCodeBlocks, 1514 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1353 ConstructedInterpolants, 0 QuantifiedInterpolants, 5110 SizeOfPredicates, 2 NumberOfNonLiveVariables, 339 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 10674/10800 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-08 16:20:11,772 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-14.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX --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 a71af419f1cf7bbebb13c8d54f46d0884d8f6a6c7b285256c6b3de9eb723dc12 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:20:14,332 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:20:14,453 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 16:20:14,461 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:20:14,462 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:20:14,501 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:20:14,504 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:20:14,504 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:20:14,505 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:20:14,509 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:20:14,510 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:20:14,510 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:20:14,511 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:20:14,511 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:20:14,511 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:20:14,511 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:20:14,512 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 16:20:14,512 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:20:14,512 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:20:14,512 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:20:14,513 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 16:20:14,514 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:20:14,514 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 16:20:14,515 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 16:20:14,515 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 16:20:14,515 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:20:14,515 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 16:20:14,516 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:20:14,516 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 16:20:14,516 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:20:14,516 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:20:14,517 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:20:14,517 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:20:14,517 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:20:14,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:20:14,518 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:20:14,518 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:20:14,518 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 16:20:14,519 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 16:20:14,519 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 16:20:14,519 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:20:14,519 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:20:14,520 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:20:14,520 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:20:14,520 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX 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 -> a71af419f1cf7bbebb13c8d54f46d0884d8f6a6c7b285256c6b3de9eb723dc12 [2024-11-08 16:20:14,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:20:15,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:20:15,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:20:15,018 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:20:15,018 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:20:15,020 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-14.i Unable to find full path for "g++" [2024-11-08 16:20:17,046 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:20:17,276 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:20:17,277 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-14.i [2024-11-08 16:20:17,287 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/data/0902f9a51/e546251997f84218bc1ba89db1051163/FLAG9fcac21fa [2024-11-08 16:20:17,303 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/data/0902f9a51/e546251997f84218bc1ba89db1051163 [2024-11-08 16:20:17,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:20:17,307 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:20:17,308 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:20:17,308 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:20:17,316 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:20:17,319 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:20:17" (1/1) ... [2024-11-08 16:20:17,320 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24dd7064 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:20:17, skipping insertion in model container [2024-11-08 16:20:17,320 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:20:17" (1/1) ... [2024-11-08 16:20:17,348 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:20:17,592 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_ce5f236d-f06e-4ace-b85c-be27eef0a566/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-14.i[916,929] [2024-11-08 16:20:17,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:20:17,704 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:20:17,721 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_ce5f236d-f06e-4ace-b85c-be27eef0a566/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-14.i[916,929] [2024-11-08 16:20:17,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:20:17,794 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:20:17,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:20:17 WrapperNode [2024-11-08 16:20:17,795 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:20:17,796 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:20:17,796 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:20:17,797 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:20:17,825 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:20:17" (1/1) ... [2024-11-08 16:20:17,845 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:20:17" (1/1) ... [2024-11-08 16:20:17,889 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2024-11-08 16:20:17,889 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:20:17,890 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:20:17,890 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:20:17,890 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:20:17,908 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:20:17" (1/1) ... [2024-11-08 16:20:17,909 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:20:17" (1/1) ... [2024-11-08 16:20:17,912 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:20:17" (1/1) ... [2024-11-08 16:20:17,936 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 16:20:17,936 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:20:17" (1/1) ... [2024-11-08 16:20:17,936 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:20:17" (1/1) ... [2024-11-08 16:20:17,948 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:20:17" (1/1) ... [2024-11-08 16:20:17,955 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:20:17" (1/1) ... [2024-11-08 16:20:17,960 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:20:17" (1/1) ... [2024-11-08 16:20:17,964 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:20:17" (1/1) ... [2024-11-08 16:20:17,970 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:20:17,971 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:20:17,971 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:20:17,971 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:20:17,973 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:20:17" (1/1) ... [2024-11-08 16:20:17,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:20:17,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:20:18,008 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:20:18,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:20:18,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 16:20:18,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 16:20:18,043 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 16:20:18,043 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 16:20:18,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:20:18,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:20:18,133 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:20:18,136 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:20:24,385 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-08 16:20:24,387 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:20:24,403 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:20:24,404 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 16:20:24,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:20:24 BoogieIcfgContainer [2024-11-08 16:20:24,404 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:20:24,407 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:20:24,407 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:20:24,411 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:20:24,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:20:17" (1/3) ... [2024-11-08 16:20:24,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a0ed97d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:20:24, skipping insertion in model container [2024-11-08 16:20:24,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:20:17" (2/3) ... [2024-11-08 16:20:24,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a0ed97d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:20:24, skipping insertion in model container [2024-11-08 16:20:24,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:20:24" (3/3) ... [2024-11-08 16:20:24,417 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-14.i [2024-11-08 16:20:24,434 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:20:24,434 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 16:20:24,500 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:20:24,506 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;@279c3333, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:20:24,507 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 16:20:24,511 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-08 16:20:24,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 16:20:24,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:20:24,527 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:20:24,528 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:20:24,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:20:24,534 INFO L85 PathProgramCache]: Analyzing trace with hash 316885076, now seen corresponding path program 1 times [2024-11-08 16:20:24,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:20:24,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1677752052] [2024-11-08 16:20:24,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:20:24,549 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-08 16:20:24,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:20:24,553 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 16:20:24,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 16:20:24,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:24,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 16:20:24,946 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:20:25,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2024-11-08 16:20:25,026 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:20:25,027 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:20:25,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1677752052] [2024-11-08 16:20:25,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1677752052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:20:25,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:20:25,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:20:25,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921858739] [2024-11-08 16:20:25,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:20:25,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 16:20:25,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:20:25,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 16:20:25,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 16:20:25,081 INFO L87 Difference]: Start difference. First operand has 62 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-08 16:20:25,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:20:25,139 INFO L93 Difference]: Finished difference Result 117 states and 207 transitions. [2024-11-08 16:20:25,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 16:20:25,144 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 151 [2024-11-08 16:20:25,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:20:25,153 INFO L225 Difference]: With dead ends: 117 [2024-11-08 16:20:25,154 INFO L226 Difference]: Without dead ends: 58 [2024-11-08 16:20:25,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 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-08 16:20:25,162 INFO L432 NwaCegarLoop]: 87 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, 87 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-08 16:20:25,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:20:25,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-08 16:20:25,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-08 16:20:25,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-08 16:20:25,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 87 transitions. [2024-11-08 16:20:25,221 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 87 transitions. Word has length 151 [2024-11-08 16:20:25,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:20:25,222 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 87 transitions. [2024-11-08 16:20:25,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-08 16:20:25,223 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 87 transitions. [2024-11-08 16:20:25,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 16:20:25,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:20:25,227 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:20:25,233 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 16:20:25,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 16:20:25,428 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:20:25,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:20:25,429 INFO L85 PathProgramCache]: Analyzing trace with hash 873758226, now seen corresponding path program 1 times [2024-11-08 16:20:25,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:20:25,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [884059407] [2024-11-08 16:20:25,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:20:25,431 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-08 16:20:25,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:20:25,435 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 16:20:25,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 16:20:25,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:25,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 16:20:25,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:20:26,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-08 16:20:26,712 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:20:26,712 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:20:26,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [884059407] [2024-11-08 16:20:26,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [884059407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:20:26,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:20:26,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:20:26,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564160811] [2024-11-08 16:20:26,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:20:26,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 16:20:26,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:20:26,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 16:20:26,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 16:20:26,717 INFO L87 Difference]: Start difference. First operand 58 states and 87 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 16:20:29,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.74s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 16:20:30,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 16:20:30,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:20:30,790 INFO L93 Difference]: Finished difference Result 172 states and 262 transitions. [2024-11-08 16:20:30,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:20:30,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 151 [2024-11-08 16:20:30,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:20:30,812 INFO L225 Difference]: With dead ends: 172 [2024-11-08 16:20:30,813 INFO L226 Difference]: Without dead ends: 117 [2024-11-08 16:20:30,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:20:30,815 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 46 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:20:30,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 245 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-08 16:20:30,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-08 16:20:30,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 102. [2024-11-08 16:20:30,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 49 states have internal predecessors, (55), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-08 16:20:30,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 155 transitions. [2024-11-08 16:20:30,852 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 155 transitions. Word has length 151 [2024-11-08 16:20:30,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:20:30,853 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 155 transitions. [2024-11-08 16:20:30,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-08 16:20:30,853 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 155 transitions. [2024-11-08 16:20:30,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 16:20:30,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:20:30,856 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:20:30,865 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 16:20:31,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 16:20:31,057 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:20:31,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:20:31,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1553816596, now seen corresponding path program 1 times [2024-11-08 16:20:31,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:20:31,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1848064597] [2024-11-08 16:20:31,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:20:31,059 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-08 16:20:31,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:20:31,063 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 16:20:31,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 16:20:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:31,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 16:20:31,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:20:32,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 604 proven. 42 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2024-11-08 16:20:32,035 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:20:32,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 30 proven. 42 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-08 16:20:32,928 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 16:20:32,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1848064597] [2024-11-08 16:20:32,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1848064597] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:20:32,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 16:20:32,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-08 16:20:32,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670624892] [2024-11-08 16:20:32,933 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 16:20:32,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 16:20:32,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 16:20:32,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 16:20:32,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 16:20:32,940 INFO L87 Difference]: Start difference. First operand 102 states and 155 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-08 16:20:35,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 16:20:35,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:20:35,162 INFO L93 Difference]: Finished difference Result 169 states and 249 transitions. [2024-11-08 16:20:35,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 16:20:35,183 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 151 [2024-11-08 16:20:35,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:20:35,186 INFO L225 Difference]: With dead ends: 169 [2024-11-08 16:20:35,186 INFO L226 Difference]: Without dead ends: 114 [2024-11-08 16:20:35,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 294 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2024-11-08 16:20:35,188 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 61 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:20:35,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 108 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-08 16:20:35,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-08 16:20:35,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2024-11-08 16:20:35,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 states have internal predecessors, (60), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-08 16:20:35,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 160 transitions. [2024-11-08 16:20:35,221 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 160 transitions. Word has length 151 [2024-11-08 16:20:35,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:20:35,222 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 160 transitions. [2024-11-08 16:20:35,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-08 16:20:35,222 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 160 transitions. [2024-11-08 16:20:35,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 16:20:35,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:20:35,225 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 16:20:35,237 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-08 16:20:35,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 16:20:35,426 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 16:20:35,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:20:35,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1555663638, now seen corresponding path program 1 times [2024-11-08 16:20:35,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 16:20:35,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2121778787] [2024-11-08 16:20:35,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:20:35,428 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-08 16:20:35,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 16:20:35,431 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 16:20:35,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ce5f236d-f06e-4ace-b85c-be27eef0a566/bin/uautomizer-verify-jihMAELWvX/mathsat -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-08 16:20:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:20:35,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-08 16:20:35,652 INFO L278 TraceCheckSpWp]: Computing forward predicates...