./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-70.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-70.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya --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 ebfa0983e777f747b35ddf51685eed4bd631311b5aad9e37cee1c56108195d95 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:02:43,766 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:02:43,830 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 03:02:43,835 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:02:43,835 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:02:43,857 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:02:43,858 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:02:43,858 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:02:43,859 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:02:43,860 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:02:43,860 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:02:43,861 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:02:43,861 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:02:43,862 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:02:43,862 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:02:43,863 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:02:43,863 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 03:02:43,864 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:02:43,864 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:02:43,865 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:02:43,865 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:02:43,866 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 03:02:43,866 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:02:43,867 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 03:02:43,867 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:02:43,868 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 03:02:43,868 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:02:43,868 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:02:43,869 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:02:43,869 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:02:43,869 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:02:43,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:02:43,870 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:02:43,870 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:02:43,871 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 03:02:43,871 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 03:02:43,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 03:02:43,871 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:02:43,871 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:02:43,871 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 03:02:43,872 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:02:43,872 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:02:43,872 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_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/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_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya 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 -> ebfa0983e777f747b35ddf51685eed4bd631311b5aad9e37cee1c56108195d95 [2023-11-29 03:02:44,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:02:44,135 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:02:44,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:02:44,138 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:02:44,138 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:02:44,139 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-70.i [2023-11-29 03:02:46,830 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:02:47,004 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:02:47,005 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-70.i [2023-11-29 03:02:47,014 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/data/2c57f2906/7f6d061289504237844d00e7c891bd3b/FLAG82b77ddb5 [2023-11-29 03:02:47,029 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/data/2c57f2906/7f6d061289504237844d00e7c891bd3b [2023-11-29 03:02:47,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:02:47,033 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:02:47,035 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:02:47,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:02:47,040 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:02:47,041 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:02:47" (1/1) ... [2023-11-29 03:02:47,042 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64c7c8a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:02:47, skipping insertion in model container [2023-11-29 03:02:47,042 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:02:47" (1/1) ... [2023-11-29 03:02:47,069 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:02:47,214 WARN L240 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_a56e3860-bcfc-4a03-a338-8f1be978d088/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-70.i[917,930] [2023-11-29 03:02:47,259 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:02:47,270 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:02:47,280 WARN L240 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_a56e3860-bcfc-4a03-a338-8f1be978d088/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-70.i[917,930] [2023-11-29 03:02:47,306 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:02:47,323 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:02:47,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:02:47 WrapperNode [2023-11-29 03:02:47,323 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:02:47,324 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:02:47,325 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:02:47,325 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:02:47,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:02:47" (1/1) ... [2023-11-29 03:02:47,339 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:02:47" (1/1) ... [2023-11-29 03:02:47,365 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2023-11-29 03:02:47,365 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:02:47,366 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:02:47,366 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:02:47,366 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:02:47,375 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:02:47" (1/1) ... [2023-11-29 03:02:47,375 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:02:47" (1/1) ... [2023-11-29 03:02:47,378 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:02:47" (1/1) ... [2023-11-29 03:02:47,391 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]. [2023-11-29 03:02:47,391 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:02:47" (1/1) ... [2023-11-29 03:02:47,391 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:02:47" (1/1) ... [2023-11-29 03:02:47,399 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:02:47" (1/1) ... [2023-11-29 03:02:47,403 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:02:47" (1/1) ... [2023-11-29 03:02:47,405 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:02:47" (1/1) ... [2023-11-29 03:02:47,407 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:02:47" (1/1) ... [2023-11-29 03:02:47,412 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:02:47,413 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:02:47,413 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:02:47,413 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:02:47,414 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:02:47" (1/1) ... [2023-11-29 03:02:47,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:02:47,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:02:47,447 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:02:47,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:02:47,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:02:47,487 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 03:02:47,487 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 03:02:47,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 03:02:47,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:02:47,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:02:47,571 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:02:47,574 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:02:47,841 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:02:47,909 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:02:47,909 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 03:02:47,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:02:47 BoogieIcfgContainer [2023-11-29 03:02:47,909 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:02:47,912 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:02:47,912 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:02:47,915 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:02:47,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:02:47" (1/3) ... [2023-11-29 03:02:47,916 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16cf0e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:02:47, skipping insertion in model container [2023-11-29 03:02:47,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:02:47" (2/3) ... [2023-11-29 03:02:47,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16cf0e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:02:47, skipping insertion in model container [2023-11-29 03:02:47,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:02:47" (3/3) ... [2023-11-29 03:02:47,918 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-70.i [2023-11-29 03:02:47,942 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:02:47,942 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 03:02:47,986 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:02:47,992 INFO L357 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, mHoare=true, 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;@3237270b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:02:47,992 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 03:02:47,995 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 35 states have (on average 1.457142857142857) internal successors, (51), 36 states have internal predecessors, (51), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 03:02:48,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-29 03:02:48,009 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:02:48,010 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:02:48,010 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:02:48,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:02:48,015 INFO L85 PathProgramCache]: Analyzing trace with hash 406866168, now seen corresponding path program 1 times [2023-11-29 03:02:48,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:02:48,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010691078] [2023-11-29 03:02:48,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:02:48,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:02:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:48,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:02:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:48,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:02:48,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:48,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:02:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:48,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:02:48,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:48,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:02:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:48,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:02:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:48,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 03:02:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:48,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 03:02:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:48,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 03:02:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:48,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:02:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:48,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:02:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:48,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 03:02:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:48,315 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-29 03:02:48,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:02:48,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010691078] [2023-11-29 03:02:48,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010691078] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:02:48,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:02:48,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:02:48,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860410240] [2023-11-29 03:02:48,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:02:48,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 03:02:48,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:02:48,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 03:02:48,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 03:02:48,357 INFO L87 Difference]: Start difference. First operand has 50 states, 35 states have (on average 1.457142857142857) internal successors, (51), 36 states have internal predecessors, (51), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-29 03:02:48,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:02:48,393 INFO L93 Difference]: Finished difference Result 97 states and 160 transitions. [2023-11-29 03:02:48,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 03:02:48,395 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2023-11-29 03:02:48,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:02:48,403 INFO L225 Difference]: With dead ends: 97 [2023-11-29 03:02:48,403 INFO L226 Difference]: Without dead ends: 48 [2023-11-29 03:02:48,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 03:02:48,410 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:02:48,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:02:48,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-11-29 03:02:48,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-11-29 03:02:48,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 03:02:48,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2023-11-29 03:02:48,452 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 83 [2023-11-29 03:02:48,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:02:48,453 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2023-11-29 03:02:48,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-29 03:02:48,453 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2023-11-29 03:02:48,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-29 03:02:48,458 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:02:48,458 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:02:48,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 03:02:48,458 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:02:48,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:02:48,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1600030208, now seen corresponding path program 1 times [2023-11-29 03:02:48,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:02:48,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508028146] [2023-11-29 03:02:48,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:02:48,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:02:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:48,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:02:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:48,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:02:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:48,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:02:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:48,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:02:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:48,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:02:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:48,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:02:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:48,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 03:02:48,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:48,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 03:02:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:48,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 03:02:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:48,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:02:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:48,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:02:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:48,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 03:02:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:48,683 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-29 03:02:48,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:02:48,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508028146] [2023-11-29 03:02:48,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508028146] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:02:48,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:02:48,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:02:48,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683509592] [2023-11-29 03:02:48,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:02:48,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:02:48,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:02:48,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:02:48,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:02:48,688 INFO L87 Difference]: Start difference. First operand 48 states and 70 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 03:02:48,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:02:48,746 INFO L93 Difference]: Finished difference Result 95 states and 139 transitions. [2023-11-29 03:02:48,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:02:48,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2023-11-29 03:02:48,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:02:48,749 INFO L225 Difference]: With dead ends: 95 [2023-11-29 03:02:48,749 INFO L226 Difference]: Without dead ends: 48 [2023-11-29 03:02:48,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:02:48,751 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 4 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:02:48,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 105 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:02:48,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-11-29 03:02:48,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-11-29 03:02:48,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 03:02:48,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2023-11-29 03:02:48,762 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 69 transitions. Word has length 83 [2023-11-29 03:02:48,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:02:48,764 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 69 transitions. [2023-11-29 03:02:48,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 03:02:48,764 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 69 transitions. [2023-11-29 03:02:48,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-29 03:02:48,766 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:02:48,766 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:02:48,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 03:02:48,767 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:02:48,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:02:48,767 INFO L85 PathProgramCache]: Analyzing trace with hash -2145450332, now seen corresponding path program 1 times [2023-11-29 03:02:48,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:02:48,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426265008] [2023-11-29 03:02:48,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:02:48,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:02:48,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:48,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:02:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:48,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:02:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:48,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:02:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:48,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:02:48,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:48,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:02:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:48,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:02:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:48,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 03:02:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:48,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 03:02:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:48,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 03:02:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:48,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:02:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:48,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:02:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:48,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 03:02:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:48,893 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-29 03:02:48,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:02:48,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426265008] [2023-11-29 03:02:48,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426265008] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:02:48,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:02:48,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:02:48,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173752769] [2023-11-29 03:02:48,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:02:48,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:02:48,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:02:48,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:02:48,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:02:48,896 INFO L87 Difference]: Start difference. First operand 48 states and 69 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 03:02:48,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:02:48,982 INFO L93 Difference]: Finished difference Result 138 states and 198 transitions. [2023-11-29 03:02:48,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:02:48,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2023-11-29 03:02:48,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:02:48,985 INFO L225 Difference]: With dead ends: 138 [2023-11-29 03:02:48,985 INFO L226 Difference]: Without dead ends: 91 [2023-11-29 03:02:48,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:02:48,987 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 56 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:02:48,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 134 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:02:48,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-29 03:02:48,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 59. [2023-11-29 03:02:48,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 03:02:49,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 84 transitions. [2023-11-29 03:02:49,000 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 84 transitions. Word has length 85 [2023-11-29 03:02:49,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:02:49,001 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 84 transitions. [2023-11-29 03:02:49,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 03:02:49,001 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 84 transitions. [2023-11-29 03:02:49,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-29 03:02:49,003 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:02:49,003 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:02:49,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 03:02:49,004 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:02:49,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:02:49,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1752423322, now seen corresponding path program 1 times [2023-11-29 03:02:49,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:02:49,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050258315] [2023-11-29 03:02:49,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:02:49,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:02:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:49,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:02:49,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:49,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:02:49,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:49,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:02:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:49,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:02:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:49,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:02:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:49,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:02:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:49,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 03:02:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:49,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 03:02:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:49,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 03:02:49,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:49,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:02:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:49,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:02:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:49,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 03:02:49,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:49,732 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-29 03:02:49,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:02:49,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050258315] [2023-11-29 03:02:49,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050258315] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:02:49,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:02:49,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 03:02:49,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438195621] [2023-11-29 03:02:49,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:02:49,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:02:49,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:02:49,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:02:49,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:02:49,735 INFO L87 Difference]: Start difference. First operand 59 states and 84 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 03:02:50,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:02:50,003 INFO L93 Difference]: Finished difference Result 196 states and 273 transitions. [2023-11-29 03:02:50,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 03:02:50,004 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2023-11-29 03:02:50,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:02:50,006 INFO L225 Difference]: With dead ends: 196 [2023-11-29 03:02:50,006 INFO L226 Difference]: Without dead ends: 138 [2023-11-29 03:02:50,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:02:50,008 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 98 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:02:50,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 212 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:02:50,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-11-29 03:02:50,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 104. [2023-11-29 03:02:50,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 87 states have (on average 1.3563218390804597) internal successors, (118), 88 states have internal predecessors, (118), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-29 03:02:50,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 146 transitions. [2023-11-29 03:02:50,025 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 146 transitions. Word has length 85 [2023-11-29 03:02:50,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:02:50,025 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 146 transitions. [2023-11-29 03:02:50,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 03:02:50,026 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 146 transitions. [2023-11-29 03:02:50,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-29 03:02:50,028 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:02:50,028 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:02:50,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 03:02:50,028 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:02:50,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:02:50,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1733197348, now seen corresponding path program 1 times [2023-11-29 03:02:50,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:02:50,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136382059] [2023-11-29 03:02:50,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:02:50,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:02:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:51,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:02:51,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:51,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:02:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:51,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:02:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:51,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:02:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:51,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:02:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:51,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:02:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:51,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 03:02:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:51,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 03:02:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:51,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 03:02:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:51,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:02:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:51,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:02:51,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:51,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 03:02:51,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:51,723 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-29 03:02:51,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:02:51,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136382059] [2023-11-29 03:02:51,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136382059] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:02:51,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:02:51,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:02:51,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156008108] [2023-11-29 03:02:51,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:02:51,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:02:51,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:02:51,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:02:51,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:02:51,726 INFO L87 Difference]: Start difference. First operand 104 states and 146 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 03:02:52,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:02:52,162 INFO L93 Difference]: Finished difference Result 234 states and 326 transitions. [2023-11-29 03:02:52,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:02:52,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2023-11-29 03:02:52,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:02:52,166 INFO L225 Difference]: With dead ends: 234 [2023-11-29 03:02:52,166 INFO L226 Difference]: Without dead ends: 131 [2023-11-29 03:02:52,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:02:52,169 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 84 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:02:52,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 140 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:02:52,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-29 03:02:52,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 114. [2023-11-29 03:02:52,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 98 states have internal predecessors, (131), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-29 03:02:52,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2023-11-29 03:02:52,186 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 85 [2023-11-29 03:02:52,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:02:52,187 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2023-11-29 03:02:52,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 03:02:52,188 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2023-11-29 03:02:52,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-29 03:02:52,189 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:02:52,190 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:02:52,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 03:02:52,190 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:02:52,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:02:52,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1531426724, now seen corresponding path program 1 times [2023-11-29 03:02:52,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:02:52,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330177479] [2023-11-29 03:02:52,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:02:52,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:02:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:56,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:02:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:56,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:02:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:56,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:02:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:56,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:02:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:56,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:02:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:56,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:02:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:56,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 03:02:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:56,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 03:02:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:56,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 03:02:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:56,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:02:56,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:56,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:02:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:56,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 03:02:56,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:02:56,257 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-29 03:02:56,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:02:56,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330177479] [2023-11-29 03:02:56,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330177479] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:02:56,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:02:56,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 03:02:56,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529960849] [2023-11-29 03:02:56,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:02:56,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 03:02:56,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:02:56,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 03:02:56,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:02:56,260 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 03:02:58,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:02:58,303 INFO L93 Difference]: Finished difference Result 259 states and 355 transitions. [2023-11-29 03:02:58,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 03:02:58,304 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2023-11-29 03:02:58,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:02:58,306 INFO L225 Difference]: With dead ends: 259 [2023-11-29 03:02:58,306 INFO L226 Difference]: Without dead ends: 146 [2023-11-29 03:02:58,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2023-11-29 03:02:58,307 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 116 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:02:58,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 334 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 03:02:58,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-11-29 03:02:58,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 114. [2023-11-29 03:02:58,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 98 states have internal predecessors, (131), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-29 03:02:58,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2023-11-29 03:02:58,321 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 85 [2023-11-29 03:02:58,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:02:58,322 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2023-11-29 03:02:58,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 03:02:58,322 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2023-11-29 03:02:58,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-29 03:02:58,324 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:02:58,324 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:02:58,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 03:02:58,324 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:02:58,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:02:58,325 INFO L85 PathProgramCache]: Analyzing trace with hash 722080098, now seen corresponding path program 1 times [2023-11-29 03:02:58,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:02:58,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889819445] [2023-11-29 03:02:58,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:02:58,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:02:58,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:00,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:03:00,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:00,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:03:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:00,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:03:00,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:00,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:03:00,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:00,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:03:00,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:00,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:03:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:00,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 03:03:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:00,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 03:03:00,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:00,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 03:03:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:00,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:03:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:00,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:03:00,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:00,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 03:03:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:00,760 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-29 03:03:00,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:03:00,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889819445] [2023-11-29 03:03:00,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889819445] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:03:00,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:03:00,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:03:00,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186551070] [2023-11-29 03:03:00,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:03:00,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:03:00,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:03:00,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:03:00,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:03:00,763 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 03:03:00,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:03:00,998 INFO L93 Difference]: Finished difference Result 230 states and 319 transitions. [2023-11-29 03:03:00,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:03:00,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2023-11-29 03:03:00,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:03:01,000 INFO L225 Difference]: With dead ends: 230 [2023-11-29 03:03:01,000 INFO L226 Difference]: Without dead ends: 117 [2023-11-29 03:03:01,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:03:01,002 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 54 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:03:01,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 132 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:03:01,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-11-29 03:03:01,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 104. [2023-11-29 03:03:01,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 87 states have (on average 1.3333333333333333) internal successors, (116), 88 states have internal predecessors, (116), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-29 03:03:01,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 144 transitions. [2023-11-29 03:03:01,015 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 144 transitions. Word has length 85 [2023-11-29 03:03:01,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:03:01,016 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 144 transitions. [2023-11-29 03:03:01,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 03:03:01,016 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 144 transitions. [2023-11-29 03:03:01,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-29 03:03:01,017 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:03:01,017 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:03:01,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 03:03:01,018 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:03:01,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:03:01,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1262680296, now seen corresponding path program 1 times [2023-11-29 03:03:01,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:03:01,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954828140] [2023-11-29 03:03:01,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:03:01,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:03:01,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:03:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:03:01,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:03:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:03:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:03:01,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:03:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 03:03:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 03:03:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 03:03:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:03:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:03:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 03:03:01,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,075 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-29 03:03:01,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:03:01,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954828140] [2023-11-29 03:03:01,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954828140] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:03:01,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:03:01,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:03:01,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850539259] [2023-11-29 03:03:01,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:03:01,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:03:01,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:03:01,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:03:01,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:03:01,079 INFO L87 Difference]: Start difference. First operand 104 states and 144 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 03:03:01,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:03:01,106 INFO L93 Difference]: Finished difference Result 210 states and 289 transitions. [2023-11-29 03:03:01,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:03:01,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2023-11-29 03:03:01,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:03:01,108 INFO L225 Difference]: With dead ends: 210 [2023-11-29 03:03:01,108 INFO L226 Difference]: Without dead ends: 107 [2023-11-29 03:03:01,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:03:01,109 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 29 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:03:01,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 146 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:03:01,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-29 03:03:01,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2023-11-29 03:03:01,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 87 states have (on average 1.3218390804597702) internal successors, (115), 88 states have internal predecessors, (115), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-29 03:03:01,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 143 transitions. [2023-11-29 03:03:01,122 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 143 transitions. Word has length 85 [2023-11-29 03:03:01,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:03:01,122 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 143 transitions. [2023-11-29 03:03:01,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 03:03:01,122 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 143 transitions. [2023-11-29 03:03:01,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-29 03:03:01,123 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:03:01,123 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:03:01,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 03:03:01,124 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:03:01,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:03:01,124 INFO L85 PathProgramCache]: Analyzing trace with hash 251563046, now seen corresponding path program 1 times [2023-11-29 03:03:01,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:03:01,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739624227] [2023-11-29 03:03:01,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:03:01,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:03:01,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:03:01,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:03:01,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:03:01,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:03:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:03:01,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:03:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 03:03:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 03:03:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 03:03:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:03:01,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:03:01,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 03:03:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,241 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-29 03:03:01,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:03:01,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739624227] [2023-11-29 03:03:01,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739624227] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:03:01,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:03:01,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:03:01,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274276934] [2023-11-29 03:03:01,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:03:01,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:03:01,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:03:01,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:03:01,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:03:01,244 INFO L87 Difference]: Start difference. First operand 104 states and 143 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 03:03:01,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:03:01,292 INFO L93 Difference]: Finished difference Result 210 states and 287 transitions. [2023-11-29 03:03:01,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:03:01,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 85 [2023-11-29 03:03:01,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:03:01,294 INFO L225 Difference]: With dead ends: 210 [2023-11-29 03:03:01,294 INFO L226 Difference]: Without dead ends: 107 [2023-11-29 03:03:01,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:03:01,295 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 26 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:03:01,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 219 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:03:01,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-29 03:03:01,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2023-11-29 03:03:01,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 87 states have (on average 1.2988505747126438) internal successors, (113), 88 states have internal predecessors, (113), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-29 03:03:01,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 141 transitions. [2023-11-29 03:03:01,306 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 141 transitions. Word has length 85 [2023-11-29 03:03:01,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:03:01,306 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 141 transitions. [2023-11-29 03:03:01,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 03:03:01,307 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 141 transitions. [2023-11-29 03:03:01,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-29 03:03:01,308 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:03:01,308 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:03:01,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 03:03:01,308 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:03:01,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:03:01,308 INFO L85 PathProgramCache]: Analyzing trace with hash -745219659, now seen corresponding path program 1 times [2023-11-29 03:03:01,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:03:01,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516741307] [2023-11-29 03:03:01,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:03:01,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:03:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:03:01,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:03:01,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:03:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:03:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:03:01,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:03:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 03:03:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 03:03:01,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 03:03:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:03:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:03:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 03:03:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,384 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-29 03:03:01,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:03:01,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516741307] [2023-11-29 03:03:01,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516741307] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:03:01,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:03:01,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:03:01,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772254305] [2023-11-29 03:03:01,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:03:01,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:03:01,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:03:01,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:03:01,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:03:01,386 INFO L87 Difference]: Start difference. First operand 104 states and 141 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 03:03:01,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:03:01,424 INFO L93 Difference]: Finished difference Result 207 states and 281 transitions. [2023-11-29 03:03:01,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:03:01,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 88 [2023-11-29 03:03:01,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:03:01,426 INFO L225 Difference]: With dead ends: 207 [2023-11-29 03:03:01,426 INFO L226 Difference]: Without dead ends: 104 [2023-11-29 03:03:01,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:03:01,428 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 5 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:03:01,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 103 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 03:03:01,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-29 03:03:01,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2023-11-29 03:03:01,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 87 states have (on average 1.2528735632183907) internal successors, (109), 88 states have internal predecessors, (109), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-29 03:03:01,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 137 transitions. [2023-11-29 03:03:01,438 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 137 transitions. Word has length 88 [2023-11-29 03:03:01,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:03:01,438 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 137 transitions. [2023-11-29 03:03:01,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 03:03:01,439 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 137 transitions. [2023-11-29 03:03:01,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-29 03:03:01,440 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:03:01,440 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:03:01,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 03:03:01,440 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:03:01,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:03:01,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1647609509, now seen corresponding path program 1 times [2023-11-29 03:03:01,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:03:01,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077985372] [2023-11-29 03:03:01,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:03:01,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:03:01,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:03:01,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:03:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:03:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:03:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:03:01,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:03:01,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 03:03:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 03:03:01,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 03:03:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:03:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:03:01,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 03:03:01,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,725 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-11-29 03:03:01,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:03:01,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077985372] [2023-11-29 03:03:01,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077985372] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:03:01,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233597337] [2023-11-29 03:03:01,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:03:01,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:03:01,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:03:01,730 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:03:01,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 03:03:01,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:01,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 03:03:01,858 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:03:02,048 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 113 proven. 24 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2023-11-29 03:03:02,048 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:03:02,942 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-11-29 03:03:02,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233597337] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:03:02,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:03:02,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 9] total 14 [2023-11-29 03:03:02,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15662021] [2023-11-29 03:03:02,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:03:02,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 03:03:02,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:03:02,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 03:03:02,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2023-11-29 03:03:02,945 INFO L87 Difference]: Start difference. First operand 104 states and 137 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2023-11-29 03:03:06,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:03:06,038 INFO L93 Difference]: Finished difference Result 262 states and 328 transitions. [2023-11-29 03:03:06,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 03:03:06,039 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 90 [2023-11-29 03:03:06,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:03:06,040 INFO L225 Difference]: With dead ends: 262 [2023-11-29 03:03:06,040 INFO L226 Difference]: Without dead ends: 153 [2023-11-29 03:03:06,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=242, Invalid=688, Unknown=0, NotChecked=0, Total=930 [2023-11-29 03:03:06,042 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 143 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:03:06,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 239 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 03:03:06,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-11-29 03:03:06,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 100. [2023-11-29 03:03:06,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 82 states have (on average 1.1829268292682926) internal successors, (97), 83 states have internal predecessors, (97), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-29 03:03:06,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 125 transitions. [2023-11-29 03:03:06,053 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 125 transitions. Word has length 90 [2023-11-29 03:03:06,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:03:06,053 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 125 transitions. [2023-11-29 03:03:06,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 3 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2023-11-29 03:03:06,054 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 125 transitions. [2023-11-29 03:03:06,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-29 03:03:06,054 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:03:06,055 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:03:06,061 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 03:03:06,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:03:06,255 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:03:06,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:03:06,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1545220059, now seen corresponding path program 1 times [2023-11-29 03:03:06,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:03:06,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605541240] [2023-11-29 03:03:06,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:03:06,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:03:06,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:06,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 03:03:06,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:06,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 03:03:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:06,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 03:03:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:06,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 03:03:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:06,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 03:03:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:06,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 03:03:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:06,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 03:03:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:06,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 03:03:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:06,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 03:03:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:06,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 03:03:06,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:06,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 03:03:06,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:06,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 03:03:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:06,790 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-11-29 03:03:06,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 03:03:06,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605541240] [2023-11-29 03:03:06,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605541240] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:03:06,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595195185] [2023-11-29 03:03:06,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:03:06,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:03:06,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:03:06,792 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 03:03:06,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 03:03:06,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:06,889 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 03:03:06,893 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:03:07,127 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 87 proven. 27 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-11-29 03:03:07,127 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:03:07,365 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-11-29 03:03:07,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595195185] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:03:07,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 03:03:07,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22 [2023-11-29 03:03:07,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38043067] [2023-11-29 03:03:07,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 03:03:07,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-29 03:03:07,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 03:03:07,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-29 03:03:07,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2023-11-29 03:03:07,368 INFO L87 Difference]: Start difference. First operand 100 states and 125 transitions. Second operand has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2023-11-29 03:03:08,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:03:08,246 INFO L93 Difference]: Finished difference Result 211 states and 259 transitions. [2023-11-29 03:03:08,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 03:03:08,247 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 90 [2023-11-29 03:03:08,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:03:08,248 INFO L225 Difference]: With dead ends: 211 [2023-11-29 03:03:08,248 INFO L226 Difference]: Without dead ends: 112 [2023-11-29 03:03:08,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=302, Invalid=1180, Unknown=0, NotChecked=0, Total=1482 [2023-11-29 03:03:08,250 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 302 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:03:08,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 243 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:03:08,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-29 03:03:08,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 104. [2023-11-29 03:03:08,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 85 states have (on average 1.1529411764705881) internal successors, (98), 86 states have internal predecessors, (98), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-29 03:03:08,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 126 transitions. [2023-11-29 03:03:08,264 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 126 transitions. Word has length 90 [2023-11-29 03:03:08,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:03:08,265 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 126 transitions. [2023-11-29 03:03:08,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2023-11-29 03:03:08,266 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 126 transitions. [2023-11-29 03:03:08,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-29 03:03:08,267 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:03:08,267 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:03:08,272 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-29 03:03:08,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 03:03:08,467 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:03:08,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:03:08,468 INFO L85 PathProgramCache]: Analyzing trace with hash 958414045, now seen corresponding path program 1 times [2023-11-29 03:03:08,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 03:03:08,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491759621] [2023-11-29 03:03:08,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:03:08,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 03:03:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:03:08,492 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 03:03:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 03:03:08,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 03:03:08,543 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 03:03:08,544 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 03:03:08,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 03:03:08,549 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:03:08,552 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 03:03:08,596 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 03:03:08,598 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 03:03:08,598 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-29 03:03:08,598 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 03:03:08,598 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite6 could not be translated [2023-11-29 03:03:08,599 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-29 03:03:08,599 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 03:03:08,600 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-29 03:03:08,600 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-29 03:03:08,601 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated [2023-11-29 03:03:08,601 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-29 03:03:08,601 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated [2023-11-29 03:03:08,601 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated [2023-11-29 03:03:08,601 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-29 03:03:08,602 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated [2023-11-29 03:03:08,602 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite17 could not be translated [2023-11-29 03:03:08,602 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-29 03:03:08,602 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated [2023-11-29 03:03:08,603 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated [2023-11-29 03:03:08,603 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-29 03:03:08,603 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite17 could not be translated [2023-11-29 03:03:08,603 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated [2023-11-29 03:03:08,603 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated [2023-11-29 03:03:08,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 03:03:08 BoogieIcfgContainer [2023-11-29 03:03:08,619 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 03:03:08,620 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 03:03:08,620 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 03:03:08,620 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 03:03:08,620 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:02:47" (3/4) ... [2023-11-29 03:03:08,622 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 03:03:08,623 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 03:03:08,624 INFO L158 Benchmark]: Toolchain (without parser) took 21590.56ms. Allocated memory was 157.3MB in the beginning and 260.0MB in the end (delta: 102.8MB). Free memory was 111.0MB in the beginning and 136.8MB in the end (delta: -25.9MB). Peak memory consumption was 80.0MB. Max. memory is 16.1GB. [2023-11-29 03:03:08,624 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 157.3MB. Free memory is still 131.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 03:03:08,624 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.20ms. Allocated memory is still 157.3MB. Free memory was 110.7MB in the beginning and 98.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 03:03:08,625 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.21ms. Allocated memory is still 157.3MB. Free memory was 97.9MB in the beginning and 94.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 03:03:08,625 INFO L158 Benchmark]: Boogie Preprocessor took 45.88ms. Allocated memory is still 157.3MB. Free memory was 94.9MB in the beginning and 91.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 03:03:08,625 INFO L158 Benchmark]: RCFGBuilder took 496.94ms. Allocated memory is still 157.3MB. Free memory was 91.4MB in the beginning and 125.6MB in the end (delta: -34.2MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. [2023-11-29 03:03:08,626 INFO L158 Benchmark]: TraceAbstraction took 20707.11ms. Allocated memory was 157.3MB in the beginning and 260.0MB in the end (delta: 102.8MB). Free memory was 124.9MB in the beginning and 137.9MB in the end (delta: -13.0MB). Peak memory consumption was 88.9MB. Max. memory is 16.1GB. [2023-11-29 03:03:08,626 INFO L158 Benchmark]: Witness Printer took 3.60ms. Allocated memory is still 260.0MB. Free memory is still 136.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 03:03:08,628 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.14ms. Allocated memory is still 157.3MB. Free memory is still 131.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 289.20ms. Allocated memory is still 157.3MB. Free memory was 110.7MB in the beginning and 98.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.21ms. Allocated memory is still 157.3MB. Free memory was 97.9MB in the beginning and 94.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.88ms. Allocated memory is still 157.3MB. Free memory was 94.9MB in the beginning and 91.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 496.94ms. Allocated memory is still 157.3MB. Free memory was 91.4MB in the beginning and 125.6MB in the end (delta: -34.2MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. * TraceAbstraction took 20707.11ms. Allocated memory was 157.3MB in the beginning and 260.0MB in the end (delta: 102.8MB). Free memory was 124.9MB in the beginning and 137.9MB in the end (delta: -13.0MB). Peak memory consumption was 88.9MB. Max. memory is 16.1GB. * Witness Printer took 3.60ms. Allocated memory is still 260.0MB. Free memory is still 136.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 85, overapproximation of someBinaryArithmeticDOUBLEoperation at line 57. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_4 = 19138; [L25] signed char var_1_6 = 25; [L26] signed long int var_1_7 = -50; [L27] double var_1_8 = 8.3; [L28] double var_1_9 = 255.6; [L29] double var_1_10 = 10000000.375; [L30] double var_1_11 = 0.0; [L31] double var_1_12 = 255.375; [L32] unsigned char var_1_13 = 50; [L33] unsigned char var_1_14 = 2; [L34] signed char var_1_15 = 1; [L35] signed char var_1_16 = 5; [L89] isInitial = 1 [L90] FCALL initially() [L91] COND TRUE 1 [L92] FCALL updateLastVariables() [L93] CALL updateVariables() [L61] var_1_2 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L62] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L63] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L63] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L64] var_1_4 = __VERIFIER_nondet_ushort() [L65] CALL assume_abort_if_not(var_1_4 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L65] RET assume_abort_if_not(var_1_4 >= 16383) VAL [isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L66] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L66] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=1278/5] [L67] var_1_9 = __VERIFIER_nondet_double() [L68] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L68] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=80000003/8, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L69] var_1_10 = __VERIFIER_nondet_double() [L70] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L70] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=0, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L71] var_1_11 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_11 >= 4611686.018427382800e+12F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L72] RET assume_abort_if_not((var_1_11 >= 4611686.018427382800e+12F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=2043/8, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L73] var_1_12 = __VERIFIER_nondet_double() [L74] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L74] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=50, var_1_14=2, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L75] var_1_14 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_13=50, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L76] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_13=50, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L77] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L77] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=5, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L78] var_1_16 = __VERIFIER_nondet_char() [L79] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=-127, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=-127, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L79] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=-127, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L80] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=-127, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=-127, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L80] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_13=50, var_1_14=0, var_1_15=1, var_1_16=-127, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L93] RET updateVariables() [L94] CALL step() [L39] var_1_13 = var_1_14 [L40] var_1_15 = var_1_16 VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=0, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L41] COND TRUE \read(var_1_2) [L42] var_1_1 = ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)) VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L44] COND FALSE !(var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L47] unsigned short int stepLocal_0 = var_1_4; VAL [isInitial=1, stepLocal_0=16383, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L48] EXPR var_1_13 << var_1_13 VAL [isInitial=1, stepLocal_0=16383, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L48] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [isInitial=1, stepLocal_0=16383, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L48] EXPR var_1_13 << var_1_13 VAL [isInitial=1, stepLocal_0=16383, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L48] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [isInitial=1, stepLocal_0=16383, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10] [L48] COND FALSE !(stepLocal_0 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) [L51] var_1_7 = (var_1_13 + (var_1_1 + var_1_4)) VAL [isInitial=1, stepLocal_0=16383, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988, var_1_8=83/10] [L53] unsigned char stepLocal_1 = var_1_13; VAL [isInitial=1, stepLocal_0=16383, stepLocal_1=0, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988, var_1_8=83/10] [L54] COND FALSE !(var_1_13 < stepLocal_1) [L57] var_1_8 = ((var_1_11 - var_1_12) - var_1_9) VAL [isInitial=1, stepLocal_0=16383, stepLocal_1=0, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] [L94] RET step() [L95] CALL, EXPR property() [L85] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) ? (var_1_7 == ((signed long int) (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_13 + (var_1_1 + var_1_4))))) VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] [L85] EXPR var_1_13 << var_1_13 VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] [L85] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] [L85] EXPR var_1_13 << var_1_13 VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] [L85] EXPR ((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13)) VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] [L85] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) ? (var_1_7 == ((signed long int) (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_13 + (var_1_1 + var_1_4))))) VAL [isInitial=1, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] [L85-L86] return (((((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_13) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_13)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_13 + var_1_1))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_13) > ((var_1_13 << var_1_13))) ? (var_1_13) : ((var_1_13 << var_1_13))))) ? (var_1_7 == ((signed long int) (((((var_1_13 - var_1_13)) < (var_1_4)) ? ((var_1_13 - var_1_13)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_13 + (var_1_1 + var_1_4)))))) && ((var_1_13 < var_1_13) ? (var_1_8 == ((double) (var_1_9 - var_1_10))) : (var_1_8 == ((double) ((var_1_11 - var_1_12) - var_1_9))))) && (var_1_13 == ((unsigned char) var_1_14))) && (var_1_15 == ((signed char) var_1_16)) ; [L95] RET, EXPR property() [L95] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_13=0, var_1_14=0, var_1_15=-127, var_1_16=-127, var_1_1=33605, var_1_2=1, var_1_4=16383, var_1_6=25, var_1_7=49988] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.6s, OverallIterations: 13, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 921 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 917 mSDsluCounter, 2074 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1343 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1955 IncrementalHoareTripleChecker+Invalid, 2021 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 731 mSDtfsCounter, 1955 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 772 GetRequests, 665 SyntacticMatches, 2 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=5, InterpolantAutomatonStates: 97, 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, 12 MinimizatonAttempts, 195 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 11.8s InterpolantComputationTime, 1299 NumberOfCodeBlocks, 1299 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1373 ConstructedInterpolants, 0 QuantifiedInterpolants, 8428 SizeOfPredicates, 9 NumberOfNonLiveVariables, 447 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 4071/4224 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 [2023-11-29 03:03:08,655 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-70.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya --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 ebfa0983e777f747b35ddf51685eed4bd631311b5aad9e37cee1c56108195d95 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:03:10,573 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:03:10,639 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 03:03:10,657 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:03:10,658 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:03:10,686 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:03:10,687 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:03:10,687 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:03:10,688 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:03:10,689 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:03:10,689 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:03:10,690 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:03:10,691 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:03:10,692 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:03:10,692 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:03:10,693 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:03:10,693 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 03:03:10,694 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:03:10,695 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:03:10,695 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:03:10,696 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 03:03:10,696 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:03:10,697 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 03:03:10,697 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 03:03:10,698 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 03:03:10,698 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 03:03:10,699 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:03:10,699 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 03:03:10,699 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:03:10,700 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:03:10,700 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:03:10,701 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:03:10,701 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:03:10,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:03:10,702 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:03:10,702 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:03:10,702 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 03:03:10,702 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 03:03:10,703 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 03:03:10,703 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:03:10,703 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:03:10,703 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 03:03:10,704 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:03:10,704 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:03:10,704 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 03:03:10,704 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_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/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_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya 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 -> ebfa0983e777f747b35ddf51685eed4bd631311b5aad9e37cee1c56108195d95 [2023-11-29 03:03:11,011 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:03:11,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:03:11,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:03:11,035 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:03:11,035 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:03:11,037 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-70.i [2023-11-29 03:03:13,790 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:03:13,980 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:03:13,981 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-70.i [2023-11-29 03:03:13,990 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/data/82b3ef52d/c8fc11873b6342e693a231771a06d9c3/FLAGd92ddf272 [2023-11-29 03:03:14,008 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/data/82b3ef52d/c8fc11873b6342e693a231771a06d9c3 [2023-11-29 03:03:14,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:03:14,013 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:03:14,014 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:03:14,015 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:03:14,020 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:03:14,021 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:03:14" (1/1) ... [2023-11-29 03:03:14,022 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b98397d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:03:14, skipping insertion in model container [2023-11-29 03:03:14,022 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:03:14" (1/1) ... [2023-11-29 03:03:14,050 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:03:14,191 WARN L240 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_a56e3860-bcfc-4a03-a338-8f1be978d088/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-70.i[917,930] [2023-11-29 03:03:14,231 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:03:14,247 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:03:14,258 WARN L240 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_a56e3860-bcfc-4a03-a338-8f1be978d088/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-70.i[917,930] [2023-11-29 03:03:14,278 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:03:14,309 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:03:14,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:03:14 WrapperNode [2023-11-29 03:03:14,310 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:03:14,310 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:03:14,311 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:03:14,311 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:03:14,317 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:03:14" (1/1) ... [2023-11-29 03:03:14,328 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:03:14" (1/1) ... [2023-11-29 03:03:14,355 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 98 [2023-11-29 03:03:14,355 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:03:14,356 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:03:14,357 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:03:14,357 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:03:14,366 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:03:14" (1/1) ... [2023-11-29 03:03:14,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:03:14" (1/1) ... [2023-11-29 03:03:14,370 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:03:14" (1/1) ... [2023-11-29 03:03:14,383 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]. [2023-11-29 03:03:14,383 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:03:14" (1/1) ... [2023-11-29 03:03:14,384 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:03:14" (1/1) ... [2023-11-29 03:03:14,394 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:03:14" (1/1) ... [2023-11-29 03:03:14,398 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:03:14" (1/1) ... [2023-11-29 03:03:14,401 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:03:14" (1/1) ... [2023-11-29 03:03:14,403 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:03:14" (1/1) ... [2023-11-29 03:03:14,407 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:03:14,408 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:03:14,409 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:03:14,409 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:03:14,410 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:03:14" (1/1) ... [2023-11-29 03:03:14,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:03:14,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:03:14,437 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:03:14,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:03:14,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:03:14,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 03:03:14,466 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 03:03:14,466 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 03:03:14,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:03:14,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:03:14,545 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:03:14,548 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:03:16,144 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:03:16,185 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:03:16,186 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 03:03:16,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:03:16 BoogieIcfgContainer [2023-11-29 03:03:16,186 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:03:16,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:03:16,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:03:16,193 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:03:16,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:03:14" (1/3) ... [2023-11-29 03:03:16,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@302ebfac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:03:16, skipping insertion in model container [2023-11-29 03:03:16,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:03:14" (2/3) ... [2023-11-29 03:03:16,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@302ebfac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:03:16, skipping insertion in model container [2023-11-29 03:03:16,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:03:16" (3/3) ... [2023-11-29 03:03:16,197 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-70.i [2023-11-29 03:03:16,217 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:03:16,217 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 03:03:16,267 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:03:16,274 INFO L357 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, mHoare=true, 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;@77bf4a0c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:03:16,274 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 03:03:16,278 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 03:03:16,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-29 03:03:16,290 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:03:16,291 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:03:16,292 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:03:16,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:03:16,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1254920039, now seen corresponding path program 1 times [2023-11-29 03:03:16,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:03:16,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1698173636] [2023-11-29 03:03:16,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:03:16,312 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 [2023-11-29 03:03:16,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:03:16,313 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 03:03:16,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 03:03:16,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:16,656 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 03:03:16,663 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:03:16,697 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2023-11-29 03:03:16,698 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:03:16,699 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:03:16,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1698173636] [2023-11-29 03:03:16,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1698173636] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:03:16,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:03:16,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:03:16,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109000516] [2023-11-29 03:03:16,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:03:16,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 03:03:16,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:03:16,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 03:03:16,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 03:03:16,732 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-29 03:03:17,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 03:03:17,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:03:17,848 INFO L93 Difference]: Finished difference Result 75 states and 124 transitions. [2023-11-29 03:03:17,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 03:03:17,865 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 79 [2023-11-29 03:03:17,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:03:17,871 INFO L225 Difference]: With dead ends: 75 [2023-11-29 03:03:17,871 INFO L226 Difference]: Without dead ends: 37 [2023-11-29 03:03:17,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 03:03:17,877 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:03:17,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 03:03:17,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-29 03:03:17,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-11-29 03:03:17,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 03:03:17,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 52 transitions. [2023-11-29 03:03:17,918 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 52 transitions. Word has length 79 [2023-11-29 03:03:17,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:03:17,919 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 52 transitions. [2023-11-29 03:03:17,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-29 03:03:17,919 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 52 transitions. [2023-11-29 03:03:17,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-29 03:03:17,923 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:03:17,923 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:03:17,932 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 03:03:18,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:03:18,125 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:03:18,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:03:18,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1235641761, now seen corresponding path program 1 times [2023-11-29 03:03:18,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:03:18,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1974776037] [2023-11-29 03:03:18,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:03:18,126 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 [2023-11-29 03:03:18,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:03:18,127 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 03:03:18,128 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 03:03:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:18,423 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 03:03:18,428 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:03:18,493 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-29 03:03:18,493 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:03:18,493 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:03:18,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1974776037] [2023-11-29 03:03:18,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1974776037] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:03:18,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:03:18,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:03:18,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341018361] [2023-11-29 03:03:18,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:03:18,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:03:18,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:03:18,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:03:18,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:03:18,499 INFO L87 Difference]: Start difference. First operand 37 states and 52 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 03:03:19,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:03:19,950 INFO L93 Difference]: Finished difference Result 73 states and 103 transitions. [2023-11-29 03:03:19,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:03:19,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 79 [2023-11-29 03:03:19,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:03:19,966 INFO L225 Difference]: With dead ends: 73 [2023-11-29 03:03:19,967 INFO L226 Difference]: Without dead ends: 37 [2023-11-29 03:03:19,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:03:19,969 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:03:19,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 87 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 03:03:19,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-29 03:03:19,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-11-29 03:03:19,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-29 03:03:19,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2023-11-29 03:03:19,979 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 79 [2023-11-29 03:03:19,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:03:19,981 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2023-11-29 03:03:19,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 03:03:19,982 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2023-11-29 03:03:19,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-29 03:03:19,983 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:03:19,984 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:03:19,991 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 03:03:20,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:03:20,184 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:03:20,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:03:20,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1235701343, now seen corresponding path program 1 times [2023-11-29 03:03:20,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:03:20,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1550051555] [2023-11-29 03:03:20,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:03:20,186 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 [2023-11-29 03:03:20,186 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:03:20,187 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 03:03:20,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 03:03:20,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:20,437 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 03:03:20,442 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:03:21,053 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 98 proven. 48 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2023-11-29 03:03:21,053 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:03:21,212 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:03:21,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1550051555] [2023-11-29 03:03:21,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1550051555] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:03:21,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1090905722] [2023-11-29 03:03:21,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:03:21,213 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 03:03:21,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 03:03:21,218 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 03:03:21,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2023-11-29 03:03:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:22,167 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 03:03:22,171 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:03:22,589 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 98 proven. 48 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2023-11-29 03:03:22,590 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:03:23,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1090905722] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 03:03:23,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:03:23,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2023-11-29 03:03:23,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093115341] [2023-11-29 03:03:23,030 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:03:23,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 03:03:23,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:03:23,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 03:03:23,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2023-11-29 03:03:23,033 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-29 03:03:24,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 03:03:25,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:03:25,671 INFO L93 Difference]: Finished difference Result 103 states and 132 transitions. [2023-11-29 03:03:25,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 03:03:25,672 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 79 [2023-11-29 03:03:25,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:03:25,674 INFO L225 Difference]: With dead ends: 103 [2023-11-29 03:03:25,674 INFO L226 Difference]: Without dead ends: 67 [2023-11-29 03:03:25,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2023-11-29 03:03:25,677 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 72 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:03:25,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 74 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-11-29 03:03:25,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-29 03:03:25,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2023-11-29 03:03:25,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 41 states have (on average 1.146341463414634) internal successors, (47), 42 states have internal predecessors, (47), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-29 03:03:25,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2023-11-29 03:03:25,692 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 79 [2023-11-29 03:03:25,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:03:25,693 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2023-11-29 03:03:25,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 3 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-29 03:03:25,694 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2023-11-29 03:03:25,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-29 03:03:25,695 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:03:25,696 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:03:25,703 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2023-11-29 03:03:25,909 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 03:03:26,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 03:03:26,104 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 03:03:26,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:03:26,105 INFO L85 PathProgramCache]: Analyzing trace with hash 426354717, now seen corresponding path program 1 times [2023-11-29 03:03:26,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:03:26,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [135638188] [2023-11-29 03:03:26,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:03:26,106 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 [2023-11-29 03:03:26,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:03:26,107 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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) [2023-11-29 03:03:26,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a56e3860-bcfc-4a03-a338-8f1be978d088/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 03:03:26,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:03:26,427 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-29 03:03:26,432 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:04:22,808 WARN L293 SmtUtils]: Spent 21.45s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 03:14:11,017 WARN L293 SmtUtils]: Spent 5.46s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:14:55,434 WARN L293 SmtUtils]: Spent 6.29s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:15:23,020 WARN L293 SmtUtils]: Spent 7.57s on a formula simplification. DAG size of input: 4 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:15:31,050 WARN L293 SmtUtils]: Spent 7.97s on a formula simplification. DAG size of input: 3 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:15:39,464 WARN L293 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:15:51,369 WARN L293 SmtUtils]: Spent 7.66s on a formula simplification. DAG size of input: 5 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:16:04,925 WARN L293 SmtUtils]: Spent 5.61s on a formula simplification. DAG size of input: 4 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:16:17,268 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:16:22,431 WARN L293 SmtUtils]: Spent 5.16s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:17:01,239 WARN L293 SmtUtils]: Spent 5.30s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:17:07,152 WARN L293 SmtUtils]: Spent 5.26s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:17:17,067 WARN L293 SmtUtils]: Spent 5.85s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 03:17:23,519 WARN L293 SmtUtils]: Spent 6.45s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)