./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/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_6ca12dd2-2040-427d-905c-a2bef7ef4adf/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/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_6ca12dd2-2040-427d-905c-a2bef7ef4adf/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 9fafab56630000a79d8eb06cf156a630d9ee1a5dd58dfc1d8991b95956e4dffd --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:32:29,284 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:32:29,351 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 04:32:29,356 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:32:29,357 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:32:29,384 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:32:29,385 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:32:29,385 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:32:29,386 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:32:29,387 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:32:29,387 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:32:29,388 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:32:29,389 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:32:29,389 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:32:29,390 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:32:29,390 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:32:29,391 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:32:29,391 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:32:29,392 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:32:29,392 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:32:29,393 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:32:29,397 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:32:29,398 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:32:29,398 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:32:29,398 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:32:29,399 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:32:29,399 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:32:29,400 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:32:29,400 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:32:29,400 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:32:29,401 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:32:29,401 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:32:29,401 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:32:29,402 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:32:29,402 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:32:29,403 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:32:29,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:32:29,403 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:32:29,404 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:32:29,404 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:32:29,404 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:32:29,406 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:32:29,406 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_6ca12dd2-2040-427d-905c-a2bef7ef4adf/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_6ca12dd2-2040-427d-905c-a2bef7ef4adf/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 -> 9fafab56630000a79d8eb06cf156a630d9ee1a5dd58dfc1d8991b95956e4dffd [2023-11-29 04:32:29,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:32:29,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:32:29,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:32:29,668 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:32:29,669 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:32:29,670 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.i [2023-11-29 04:32:32,503 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:32:32,703 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:32:32,703 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.i [2023-11-29 04:32:32,713 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/bin/uautomizer-verify-BQ2R08f2Ya/data/4df15b67f/8d68829906634ff3a64ef0cfede36e4a/FLAGb73944680 [2023-11-29 04:32:32,727 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/bin/uautomizer-verify-BQ2R08f2Ya/data/4df15b67f/8d68829906634ff3a64ef0cfede36e4a [2023-11-29 04:32:32,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:32:32,731 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:32:32,732 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:32:32,732 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:32:32,738 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:32:32,739 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:32:32" (1/1) ... [2023-11-29 04:32:32,740 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4798f30a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:32:32, skipping insertion in model container [2023-11-29 04:32:32,740 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:32:32" (1/1) ... [2023-11-29 04:32:32,768 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:32:32,922 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_6ca12dd2-2040-427d-905c-a2bef7ef4adf/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.i[913,926] [2023-11-29 04:32:32,970 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:32:32,983 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:32:32,996 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_6ca12dd2-2040-427d-905c-a2bef7ef4adf/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.i[913,926] [2023-11-29 04:32:33,020 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:32:33,037 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:32:33,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:32:33 WrapperNode [2023-11-29 04:32:33,038 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:32:33,039 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:32:33,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:32:33,040 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:32:33,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:32:33" (1/1) ... [2023-11-29 04:32:33,058 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:32:33" (1/1) ... [2023-11-29 04:32:33,088 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2023-11-29 04:32:33,088 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:32:33,089 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:32:33,089 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:32:33,090 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:32:33,101 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:32:33" (1/1) ... [2023-11-29 04:32:33,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:32:33" (1/1) ... [2023-11-29 04:32:33,104 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:32:33" (1/1) ... [2023-11-29 04:32:33,119 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 04:32:33,119 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:32:33" (1/1) ... [2023-11-29 04:32:33,119 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:32:33" (1/1) ... [2023-11-29 04:32:33,127 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:32:33" (1/1) ... [2023-11-29 04:32:33,130 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:32:33" (1/1) ... [2023-11-29 04:32:33,132 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:32:33" (1/1) ... [2023-11-29 04:32:33,134 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:32:33" (1/1) ... [2023-11-29 04:32:33,138 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:32:33,138 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:32:33,139 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:32:33,139 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:32:33,140 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:32:33" (1/1) ... [2023-11-29 04:32:33,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:32:33,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:32:33,168 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:32:33,171 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:32:33,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:32:33,200 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 04:32:33,200 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 04:32:33,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 04:32:33,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:32:33,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:32:33,282 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:32:33,284 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:32:33,559 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:32:33,589 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:32:33,590 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 04:32:33,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:32:33 BoogieIcfgContainer [2023-11-29 04:32:33,590 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:32:33,593 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:32:33,594 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:32:33,597 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:32:33,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:32:32" (1/3) ... [2023-11-29 04:32:33,599 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3888c4f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:32:33, skipping insertion in model container [2023-11-29 04:32:33,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:32:33" (2/3) ... [2023-11-29 04:32:33,599 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3888c4f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:32:33, skipping insertion in model container [2023-11-29 04:32:33,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:32:33" (3/3) ... [2023-11-29 04:32:33,601 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-70.i [2023-11-29 04:32:33,623 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:32:33,623 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 04:32:33,701 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:32:33,707 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;@98272aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:32:33,708 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 04:32:33,712 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 04:32:33,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-29 04:32:33,723 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:32:33,724 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 04:32:33,724 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:32:33,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:32:33,730 INFO L85 PathProgramCache]: Analyzing trace with hash 406866168, now seen corresponding path program 1 times [2023-11-29 04:32:33,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:32:33,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533208630] [2023-11-29 04:32:33,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:32:33,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:32:33,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:33,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:32:33,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:33,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:32:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:33,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:32:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:33,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:32:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:33,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:32:33,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:33,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:32:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:33,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 04:32:33,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:33,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:32:33,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:34,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 04:32:34,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:34,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:32:34,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:34,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:32:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:34,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 04:32:34,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:34,032 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 04:32:34,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:32:34,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533208630] [2023-11-29 04:32:34,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533208630] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:32:34,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:32:34,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:32:34,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808670239] [2023-11-29 04:32:34,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:32:34,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 04:32:34,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:32:34,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 04:32:34,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:32:34,078 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 04:32:34,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:32:34,120 INFO L93 Difference]: Finished difference Result 97 states and 160 transitions. [2023-11-29 04:32:34,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 04:32:34,122 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 04:32:34,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:32:34,130 INFO L225 Difference]: With dead ends: 97 [2023-11-29 04:32:34,130 INFO L226 Difference]: Without dead ends: 48 [2023-11-29 04:32:34,133 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 04:32:34,137 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 04:32:34,138 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 04:32:34,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-11-29 04:32:34,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-11-29 04:32:34,179 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 04:32:34,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2023-11-29 04:32:34,183 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 83 [2023-11-29 04:32:34,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:32:34,183 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2023-11-29 04:32:34,184 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 04:32:34,184 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2023-11-29 04:32:34,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-29 04:32:34,189 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:32:34,189 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 04:32:34,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:32:34,190 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:32:34,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:32:34,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1600030208, now seen corresponding path program 1 times [2023-11-29 04:32:34,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:32:34,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867236743] [2023-11-29 04:32:34,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:32:34,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:32:34,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:34,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:32:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:34,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:32:34,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:34,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:32:34,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:34,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:32:34,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:34,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:32:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:34,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:32:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:34,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 04:32:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:34,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:32:34,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:34,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 04:32:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:34,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:32:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:34,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:32:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:34,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 04:32:34,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:34,430 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 04:32:34,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:32:34,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867236743] [2023-11-29 04:32:34,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867236743] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:32:34,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:32:34,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:32:34,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135021626] [2023-11-29 04:32:34,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:32:34,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:32:34,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:32:34,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:32:34,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:32:34,435 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 04:32:34,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:32:34,495 INFO L93 Difference]: Finished difference Result 95 states and 139 transitions. [2023-11-29 04:32:34,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:32:34,496 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 04:32:34,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:32:34,498 INFO L225 Difference]: With dead ends: 95 [2023-11-29 04:32:34,498 INFO L226 Difference]: Without dead ends: 48 [2023-11-29 04:32:34,499 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 04:32:34,501 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 04:32:34,502 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 04:32:34,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-11-29 04:32:34,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-11-29 04:32:34,510 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 04:32:34,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2023-11-29 04:32:34,512 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 69 transitions. Word has length 83 [2023-11-29 04:32:34,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:32:34,515 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 69 transitions. [2023-11-29 04:32:34,515 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 04:32:34,515 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 69 transitions. [2023-11-29 04:32:34,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-29 04:32:34,517 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:32:34,517 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 04:32:34,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:32:34,518 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:32:34,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:32:34,518 INFO L85 PathProgramCache]: Analyzing trace with hash -2145450332, now seen corresponding path program 1 times [2023-11-29 04:32:34,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:32:34,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679521320] [2023-11-29 04:32:34,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:32:34,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:32:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:34,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:32:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:34,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:32:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:34,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:32:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:34,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:32:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:34,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:32:34,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:34,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:32:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:34,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 04:32:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:34,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:32:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:34,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 04:32:34,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:34,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:32:34,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:34,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:32:34,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:34,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 04:32:34,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:34,666 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 04:32:34,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:32:34,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679521320] [2023-11-29 04:32:34,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679521320] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:32:34,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:32:34,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:32:34,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518599397] [2023-11-29 04:32:34,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:32:34,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:32:34,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:32:34,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:32:34,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:32:34,671 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 04:32:34,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:32:34,778 INFO L93 Difference]: Finished difference Result 138 states and 198 transitions. [2023-11-29 04:32:34,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:32:34,779 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 04:32:34,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:32:34,782 INFO L225 Difference]: With dead ends: 138 [2023-11-29 04:32:34,782 INFO L226 Difference]: Without dead ends: 91 [2023-11-29 04:32:34,783 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 04:32:34,785 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 56 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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 04:32:34,786 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 04:32:34,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-29 04:32:34,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 59. [2023-11-29 04:32:34,800 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 04:32:34,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 84 transitions. [2023-11-29 04:32:34,801 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 84 transitions. Word has length 85 [2023-11-29 04:32:34,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:32:34,802 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 84 transitions. [2023-11-29 04:32:34,802 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 04:32:34,803 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 84 transitions. [2023-11-29 04:32:34,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-29 04:32:34,805 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:32:34,805 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 04:32:34,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 04:32:34,805 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:32:34,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:32:34,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1752423322, now seen corresponding path program 1 times [2023-11-29 04:32:34,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:32:34,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187297122] [2023-11-29 04:32:34,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:32:34,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:32:34,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:35,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:32:35,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:35,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:32:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:35,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:32:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:35,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:32:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:35,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:32:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:35,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:32:35,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:35,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 04:32:35,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:35,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:32:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:35,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 04:32:35,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:35,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:32:35,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:35,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:32:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:35,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 04:32:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:35,588 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 04:32:35,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:32:35,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187297122] [2023-11-29 04:32:35,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187297122] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:32:35,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:32:35,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:32:35,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383154190] [2023-11-29 04:32:35,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:32:35,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:32:35,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:32:35,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:32:35,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:32:35,591 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 04:32:35,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:32:35,878 INFO L93 Difference]: Finished difference Result 196 states and 273 transitions. [2023-11-29 04:32:35,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:32:35,878 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 04:32:35,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:32:35,880 INFO L225 Difference]: With dead ends: 196 [2023-11-29 04:32:35,881 INFO L226 Difference]: Without dead ends: 138 [2023-11-29 04:32:35,881 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 04:32:35,883 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 04:32:35,883 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 04:32:35,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-11-29 04:32:35,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 104. [2023-11-29 04:32:35,897 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 04:32:35,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 146 transitions. [2023-11-29 04:32:35,899 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 146 transitions. Word has length 85 [2023-11-29 04:32:35,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:32:35,899 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 146 transitions. [2023-11-29 04:32:35,899 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 04:32:35,900 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 146 transitions. [2023-11-29 04:32:35,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-29 04:32:35,902 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:32:35,902 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 04:32:35,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 04:32:35,902 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:32:35,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:32:35,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1733197348, now seen corresponding path program 1 times [2023-11-29 04:32:35,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:32:35,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146358914] [2023-11-29 04:32:35,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:32:35,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:32:35,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:37,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:32:37,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:37,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:32:37,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:37,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:32:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:37,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:32:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:37,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:32:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:37,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:32:37,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:37,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 04:32:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:37,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:32:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:37,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 04:32:37,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:37,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:32:37,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:37,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:32:37,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:37,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 04:32:37,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:37,836 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 04:32:37,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:32:37,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146358914] [2023-11-29 04:32:37,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146358914] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:32:37,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:32:37,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:32:37,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700312430] [2023-11-29 04:32:37,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:32:37,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:32:37,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:32:37,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:32:37,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:32:37,840 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 04:32:38,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:32:38,275 INFO L93 Difference]: Finished difference Result 234 states and 326 transitions. [2023-11-29 04:32:38,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:32:38,276 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 04:32:38,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:32:38,279 INFO L225 Difference]: With dead ends: 234 [2023-11-29 04:32:38,279 INFO L226 Difference]: Without dead ends: 131 [2023-11-29 04:32:38,280 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 04:32:38,282 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 04:32:38,282 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 04:32:38,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-29 04:32:38,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 114. [2023-11-29 04:32:38,296 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 04:32:38,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2023-11-29 04:32:38,298 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 85 [2023-11-29 04:32:38,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:32:38,298 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2023-11-29 04:32:38,299 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 04:32:38,299 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2023-11-29 04:32:38,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-29 04:32:38,300 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:32:38,300 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 04:32:38,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 04:32:38,301 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:32:38,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:32:38,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1531426724, now seen corresponding path program 1 times [2023-11-29 04:32:38,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:32:38,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679526900] [2023-11-29 04:32:38,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:32:38,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:32:38,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:42,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:32:42,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:42,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:32:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:42,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:32:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:42,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:32:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:42,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:32:42,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:42,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:32:42,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:42,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 04:32:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:42,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:32:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:42,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 04:32:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:42,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:32:42,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:42,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:32:42,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:42,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 04:32:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:42,652 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 04:32:42,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:32:42,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679526900] [2023-11-29 04:32:42,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679526900] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:32:42,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:32:42,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 04:32:42,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155878835] [2023-11-29 04:32:42,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:32:42,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:32:42,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:32:42,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:32:42,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:32:42,656 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 04:32:51,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 04:32:51,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:32:51,909 INFO L93 Difference]: Finished difference Result 259 states and 355 transitions. [2023-11-29 04:32:51,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 04:32:51,910 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 04:32:51,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:32:51,911 INFO L225 Difference]: With dead ends: 259 [2023-11-29 04:32:51,912 INFO L226 Difference]: Without dead ends: 146 [2023-11-29 04:32:51,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2023-11-29 04:32:51,913 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 116 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:32:51,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 334 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 350 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2023-11-29 04:32:51,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-11-29 04:32:51,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 114. [2023-11-29 04:32:51,928 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 04:32:51,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2023-11-29 04:32:51,930 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 85 [2023-11-29 04:32:51,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:32:51,931 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2023-11-29 04:32:51,931 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 04:32:51,931 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2023-11-29 04:32:51,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-29 04:32:51,933 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:32:51,933 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 04:32:51,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 04:32:51,933 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:32:51,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:32:51,934 INFO L85 PathProgramCache]: Analyzing trace with hash 722080098, now seen corresponding path program 1 times [2023-11-29 04:32:51,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:32:51,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093197763] [2023-11-29 04:32:51,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:32:51,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:32:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:32:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:32:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:32:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:32:53,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:32:53,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:32:53,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 04:32:53,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:32:53,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 04:32:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:32:53,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:32:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 04:32:53,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,112 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 04:32:53,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:32:53,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093197763] [2023-11-29 04:32:53,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093197763] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:32:53,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:32:53,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:32:53,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87689760] [2023-11-29 04:32:53,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:32:53,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:32:53,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:32:53,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:32:53,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:32:53,115 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 04:32:53,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:32:53,394 INFO L93 Difference]: Finished difference Result 230 states and 319 transitions. [2023-11-29 04:32:53,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:32:53,395 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 04:32:53,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:32:53,396 INFO L225 Difference]: With dead ends: 230 [2023-11-29 04:32:53,397 INFO L226 Difference]: Without dead ends: 117 [2023-11-29 04:32:53,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:32:53,398 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 04:32:53,399 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 04:32:53,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-11-29 04:32:53,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 104. [2023-11-29 04:32:53,413 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 04:32:53,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 144 transitions. [2023-11-29 04:32:53,415 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 144 transitions. Word has length 85 [2023-11-29 04:32:53,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:32:53,416 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 144 transitions. [2023-11-29 04:32:53,416 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 04:32:53,416 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 144 transitions. [2023-11-29 04:32:53,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-29 04:32:53,418 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:32:53,418 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 04:32:53,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 04:32:53,418 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:32:53,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:32:53,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1262680296, now seen corresponding path program 1 times [2023-11-29 04:32:53,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:32:53,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762149858] [2023-11-29 04:32:53,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:32:53,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:32:53,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:32:53,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:32:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:32:53,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:32:53,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:32:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:32:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 04:32:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:32:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 04:32:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:32:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:32:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 04:32:53,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,484 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 04:32:53,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:32:53,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762149858] [2023-11-29 04:32:53,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762149858] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:32:53,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:32:53,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:32:53,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284399216] [2023-11-29 04:32:53,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:32:53,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:32:53,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:32:53,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:32:53,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:32:53,487 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 04:32:53,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:32:53,522 INFO L93 Difference]: Finished difference Result 210 states and 289 transitions. [2023-11-29 04:32:53,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:32:53,523 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 04:32:53,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:32:53,524 INFO L225 Difference]: With dead ends: 210 [2023-11-29 04:32:53,524 INFO L226 Difference]: Without dead ends: 107 [2023-11-29 04:32:53,525 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 04:32:53,526 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 04:32:53,526 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 04:32:53,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-29 04:32:53,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2023-11-29 04:32:53,540 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 04:32:53,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 143 transitions. [2023-11-29 04:32:53,541 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 143 transitions. Word has length 85 [2023-11-29 04:32:53,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:32:53,542 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 143 transitions. [2023-11-29 04:32:53,542 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 04:32:53,543 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 143 transitions. [2023-11-29 04:32:53,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-29 04:32:53,544 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:32:53,544 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 04:32:53,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 04:32:53,544 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:32:53,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:32:53,545 INFO L85 PathProgramCache]: Analyzing trace with hash 251563046, now seen corresponding path program 1 times [2023-11-29 04:32:53,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:32:53,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633763964] [2023-11-29 04:32:53,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:32:53,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:32:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:32:53,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:32:53,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:32:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:32:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:32:53,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:32:53,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 04:32:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:32:53,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 04:32:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:32:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:32:53,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 04:32:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,681 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 04:32:53,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:32:53,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633763964] [2023-11-29 04:32:53,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633763964] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:32:53,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:32:53,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:32:53,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709966300] [2023-11-29 04:32:53,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:32:53,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:32:53,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:32:53,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:32:53,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:32:53,684 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 04:32:53,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:32:53,729 INFO L93 Difference]: Finished difference Result 210 states and 287 transitions. [2023-11-29 04:32:53,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:32:53,730 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 04:32:53,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:32:53,731 INFO L225 Difference]: With dead ends: 210 [2023-11-29 04:32:53,731 INFO L226 Difference]: Without dead ends: 107 [2023-11-29 04:32:53,732 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 04:32:53,732 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 04:32:53,733 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 04:32:53,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-29 04:32:53,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2023-11-29 04:32:53,743 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 04:32:53,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 141 transitions. [2023-11-29 04:32:53,744 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 141 transitions. Word has length 85 [2023-11-29 04:32:53,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:32:53,745 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 141 transitions. [2023-11-29 04:32:53,745 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 04:32:53,745 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 141 transitions. [2023-11-29 04:32:53,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-29 04:32:53,746 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:32:53,746 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 04:32:53,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 04:32:53,747 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:32:53,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:32:53,747 INFO L85 PathProgramCache]: Analyzing trace with hash -745219659, now seen corresponding path program 1 times [2023-11-29 04:32:53,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:32:53,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031357136] [2023-11-29 04:32:53,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:32:53,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:32:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:32:53,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:32:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:32:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:32:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:32:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:32:53,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 04:32:53,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:32:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 04:32:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:32:53,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:32:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 04:32:53,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:53,817 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 04:32:53,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:32:53,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031357136] [2023-11-29 04:32:53,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031357136] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:32:53,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:32:53,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:32:53,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052866820] [2023-11-29 04:32:53,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:32:53,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:32:53,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:32:53,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:32:53,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:32:53,820 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 04:32:53,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:32:53,864 INFO L93 Difference]: Finished difference Result 207 states and 281 transitions. [2023-11-29 04:32:53,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:32:53,865 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 04:32:53,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:32:53,867 INFO L225 Difference]: With dead ends: 207 [2023-11-29 04:32:53,867 INFO L226 Difference]: Without dead ends: 104 [2023-11-29 04:32:53,868 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 04:32:53,869 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 04:32:53,869 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 04:32:53,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-29 04:32:53,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2023-11-29 04:32:53,878 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 04:32:53,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 137 transitions. [2023-11-29 04:32:53,879 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 137 transitions. Word has length 88 [2023-11-29 04:32:53,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:32:53,879 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 137 transitions. [2023-11-29 04:32:53,880 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 04:32:53,880 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 137 transitions. [2023-11-29 04:32:53,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-29 04:32:53,881 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:32:53,881 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 04:32:53,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 04:32:53,881 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:32:53,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:32:53,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1647609509, now seen corresponding path program 1 times [2023-11-29 04:32:53,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:32:53,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599724198] [2023-11-29 04:32:53,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:32:53,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:32:53,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:54,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:32:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:54,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:32:54,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:54,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:32:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:54,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:32:54,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:54,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:32:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:54,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:32:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:54,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 04:32:54,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:54,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:32:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:54,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 04:32:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:54,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:32:54,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:54,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:32:54,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:54,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 04:32:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:54,139 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 04:32:54,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:32:54,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599724198] [2023-11-29 04:32:54,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599724198] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:32:54,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450119733] [2023-11-29 04:32:54,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:32:54,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:32:54,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:32:54,142 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:32:54,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 04:32:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:54,262 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 04:32:54,271 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:32:54,454 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 04:32:54,454 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:32:55,254 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 04:32:55,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450119733] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:32:55,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:32:55,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 9] total 14 [2023-11-29 04:32:55,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657248882] [2023-11-29 04:32:55,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:32:55,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 04:32:55,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:32:55,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 04:32:55,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2023-11-29 04:32:55,257 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 04:32:56,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:32:56,688 INFO L93 Difference]: Finished difference Result 262 states and 328 transitions. [2023-11-29 04:32:56,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 04:32:56,689 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 04:32:56,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:32:56,691 INFO L225 Difference]: With dead ends: 262 [2023-11-29 04:32:56,691 INFO L226 Difference]: Without dead ends: 153 [2023-11-29 04:32:56,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=242, Invalid=688, Unknown=0, NotChecked=0, Total=930 [2023-11-29 04:32:56,693 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 143 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2023-11-29 04:32:56,693 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.8s Time] [2023-11-29 04:32:56,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-11-29 04:32:56,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 100. [2023-11-29 04:32:56,708 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 04:32:56,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 125 transitions. [2023-11-29 04:32:56,709 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 125 transitions. Word has length 90 [2023-11-29 04:32:56,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:32:56,710 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 125 transitions. [2023-11-29 04:32:56,710 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 04:32:56,710 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 125 transitions. [2023-11-29 04:32:56,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-29 04:32:56,711 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:32:56,712 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 04:32:56,724 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 04:32:56,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-29 04:32:56,913 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:32:56,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:32:56,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1545220059, now seen corresponding path program 1 times [2023-11-29 04:32:56,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:32:56,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463378497] [2023-11-29 04:32:56,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:32:56,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:32:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:57,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:32:57,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:57,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:32:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:57,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:32:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:57,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:32:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:57,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:32:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:57,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 04:32:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:57,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 04:32:57,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:57,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 04:32:57,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:57,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 04:32:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:57,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-29 04:32:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:57,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 04:32:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:57,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-29 04:32:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:57,424 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 04:32:57,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:32:57,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463378497] [2023-11-29 04:32:57,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463378497] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:32:57,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847394087] [2023-11-29 04:32:57,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:32:57,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:32:57,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:32:57,430 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:32:57,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 04:32:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:57,547 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 04:32:57,551 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:32:57,871 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 04:32:57,871 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:32:58,133 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 04:32:58,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847394087] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:32:58,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:32:58,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22 [2023-11-29 04:32:58,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104327504] [2023-11-29 04:32:58,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:32:58,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-29 04:32:58,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:32:58,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-29 04:32:58,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2023-11-29 04:32:58,137 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 04:32:59,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:32:59,050 INFO L93 Difference]: Finished difference Result 211 states and 259 transitions. [2023-11-29 04:32:59,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 04:32:59,050 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 04:32:59,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:32:59,052 INFO L225 Difference]: With dead ends: 211 [2023-11-29 04:32:59,052 INFO L226 Difference]: Without dead ends: 112 [2023-11-29 04:32:59,053 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 04:32:59,053 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 302 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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 04:32:59,054 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 04:32:59,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-29 04:32:59,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 104. [2023-11-29 04:32:59,070 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 04:32:59,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 126 transitions. [2023-11-29 04:32:59,071 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 126 transitions. Word has length 90 [2023-11-29 04:32:59,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:32:59,071 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 126 transitions. [2023-11-29 04:32:59,071 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 04:32:59,072 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 126 transitions. [2023-11-29 04:32:59,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-29 04:32:59,073 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:32:59,073 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 04:32:59,079 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 04:32:59,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:32:59,274 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:32:59,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:32:59,274 INFO L85 PathProgramCache]: Analyzing trace with hash 958414045, now seen corresponding path program 1 times [2023-11-29 04:32:59,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:32:59,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214108923] [2023-11-29 04:32:59,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:32:59,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:32:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:32:59,299 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 04:32:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 04:32:59,352 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 04:32:59,352 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 04:32:59,353 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 04:32:59,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 04:32:59,359 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:32:59,363 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 04:32:59,409 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 04:32:59,410 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 04:32:59,411 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-29 04:32:59,411 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 04:32:59,411 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-29 04:32:59,411 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite6 could not be translated [2023-11-29 04:32:59,411 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-29 04:32:59,412 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-29 04:32:59,413 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-29 04:32:59,413 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated [2023-11-29 04:32:59,413 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated [2023-11-29 04:32:59,413 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-29 04:32:59,414 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated [2023-11-29 04:32:59,414 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-29 04:32:59,414 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated [2023-11-29 04:32:59,414 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite17 could not be translated [2023-11-29 04:32:59,414 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated [2023-11-29 04:32:59,414 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-29 04:32:59,415 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated [2023-11-29 04:32:59,415 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated [2023-11-29 04:32:59,415 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-29 04:32:59,415 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite17 could not be translated [2023-11-29 04:32:59,415 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated [2023-11-29 04:32:59,431 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 04:32:59 BoogieIcfgContainer [2023-11-29 04:32:59,431 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 04:32:59,432 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 04:32:59,432 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 04:32:59,432 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 04:32:59,432 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:32:33" (3/4) ... [2023-11-29 04:32:59,434 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 04:32:59,436 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 04:32:59,436 INFO L158 Benchmark]: Toolchain (without parser) took 26705.19ms. Allocated memory was 151.0MB in the beginning and 268.4MB in the end (delta: 117.4MB). Free memory was 111.7MB in the beginning and 83.3MB in the end (delta: 28.4MB). Peak memory consumption was 146.9MB. Max. memory is 16.1GB. [2023-11-29 04:32:59,437 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 151.0MB. Free memory is still 93.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:32:59,437 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.75ms. Allocated memory is still 151.0MB. Free memory was 111.3MB in the beginning and 98.8MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 04:32:59,437 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.19ms. Allocated memory is still 151.0MB. Free memory was 98.8MB in the beginning and 95.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 04:32:59,438 INFO L158 Benchmark]: Boogie Preprocessor took 48.51ms. Allocated memory is still 151.0MB. Free memory was 95.6MB in the beginning and 92.1MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:32:59,438 INFO L158 Benchmark]: RCFGBuilder took 452.15ms. Allocated memory is still 151.0MB. Free memory was 92.1MB in the beginning and 73.3MB in the end (delta: 18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 04:32:59,438 INFO L158 Benchmark]: TraceAbstraction took 25837.56ms. Allocated memory was 151.0MB in the beginning and 268.4MB in the end (delta: 117.4MB). Free memory was 72.6MB in the beginning and 83.3MB in the end (delta: -10.7MB). Peak memory consumption was 107.1MB. Max. memory is 16.1GB. [2023-11-29 04:32:59,439 INFO L158 Benchmark]: Witness Printer took 4.08ms. Allocated memory is still 268.4MB. Free memory is still 83.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:32:59,440 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.21ms. Allocated memory is still 151.0MB. Free memory is still 93.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 306.75ms. Allocated memory is still 151.0MB. Free memory was 111.3MB in the beginning and 98.8MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.19ms. Allocated memory is still 151.0MB. Free memory was 98.8MB in the beginning and 95.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.51ms. Allocated memory is still 151.0MB. Free memory was 95.6MB in the beginning and 92.1MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 452.15ms. Allocated memory is still 151.0MB. Free memory was 92.1MB in the beginning and 73.3MB in the end (delta: 18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 25837.56ms. Allocated memory was 151.0MB in the beginning and 268.4MB in the end (delta: 117.4MB). Free memory was 72.6MB in the beginning and 83.3MB in the end (delta: -10.7MB). Peak memory consumption was 107.1MB. Max. memory is 16.1GB. * Witness Printer took 4.08ms. Allocated memory is still 268.4MB. Free memory is still 83.3MB. 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~nondet5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite6 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~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~short18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet16 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~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~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: 25.7s, OverallIterations: 13, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 921 SdHoareTripleChecker+Valid, 7.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 917 mSDsluCounter, 2074 SdHoareTripleChecker+Invalid, 6.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1343 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1954 IncrementalHoareTripleChecker+Invalid, 2021 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 731 mSDtfsCounter, 1954 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 772 GetRequests, 665 SyntacticMatches, 2 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 6.9s 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.1s 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 04:32:59,465 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/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_6ca12dd2-2040-427d-905c-a2bef7ef4adf/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/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_6ca12dd2-2040-427d-905c-a2bef7ef4adf/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 9fafab56630000a79d8eb06cf156a630d9ee1a5dd58dfc1d8991b95956e4dffd --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:33:01,461 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:33:01,541 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 04:33:01,548 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:33:01,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:33:01,580 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:33:01,581 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:33:01,581 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:33:01,582 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:33:01,582 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:33:01,583 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:33:01,584 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:33:01,584 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:33:01,585 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:33:01,585 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:33:01,586 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:33:01,587 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:33:01,587 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:33:01,588 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:33:01,588 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:33:01,589 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:33:01,589 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:33:01,590 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:33:01,590 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:33:01,591 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 04:33:01,591 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 04:33:01,591 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:33:01,592 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:33:01,592 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:33:01,593 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:33:01,593 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:33:01,594 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:33:01,594 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:33:01,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:33:01,595 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:33:01,595 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:33:01,595 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:33:01,595 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 04:33:01,596 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 04:33:01,596 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:33:01,596 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:33:01,596 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:33:01,597 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:33:01,597 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:33:01,597 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 04:33:01,597 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_6ca12dd2-2040-427d-905c-a2bef7ef4adf/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_6ca12dd2-2040-427d-905c-a2bef7ef4adf/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 -> 9fafab56630000a79d8eb06cf156a630d9ee1a5dd58dfc1d8991b95956e4dffd [2023-11-29 04:33:01,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:33:01,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:33:01,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:33:01,946 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:33:01,946 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:33:01,948 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.i [2023-11-29 04:33:04,819 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:33:05,020 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:33:05,021 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.i [2023-11-29 04:33:05,029 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/bin/uautomizer-verify-BQ2R08f2Ya/data/766eb5e8e/97e15d1222c141db9528ded215947466/FLAGda2ac3e3a [2023-11-29 04:33:05,043 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/bin/uautomizer-verify-BQ2R08f2Ya/data/766eb5e8e/97e15d1222c141db9528ded215947466 [2023-11-29 04:33:05,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:33:05,048 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:33:05,050 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:33:05,050 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:33:05,056 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:33:05,057 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:33:05" (1/1) ... [2023-11-29 04:33:05,059 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4026a5f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:33:05, skipping insertion in model container [2023-11-29 04:33:05,059 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:33:05" (1/1) ... [2023-11-29 04:33:05,085 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:33:05,222 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_6ca12dd2-2040-427d-905c-a2bef7ef4adf/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.i[913,926] [2023-11-29 04:33:05,267 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:33:05,284 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:33:05,296 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_6ca12dd2-2040-427d-905c-a2bef7ef4adf/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-70.i[913,926] [2023-11-29 04:33:05,319 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:33:05,338 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:33:05,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:33:05 WrapperNode [2023-11-29 04:33:05,338 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:33:05,340 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:33:05,340 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:33:05,340 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:33:05,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:33:05" (1/1) ... [2023-11-29 04:33:05,359 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:33:05" (1/1) ... [2023-11-29 04:33:05,388 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 98 [2023-11-29 04:33:05,388 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:33:05,389 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:33:05,390 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:33:05,390 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:33:05,400 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:33:05" (1/1) ... [2023-11-29 04:33:05,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:33:05" (1/1) ... [2023-11-29 04:33:05,405 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:33:05" (1/1) ... [2023-11-29 04:33:05,418 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 04:33:05,419 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:33:05" (1/1) ... [2023-11-29 04:33:05,419 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:33:05" (1/1) ... [2023-11-29 04:33:05,430 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:33:05" (1/1) ... [2023-11-29 04:33:05,434 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:33:05" (1/1) ... [2023-11-29 04:33:05,437 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:33:05" (1/1) ... [2023-11-29 04:33:05,439 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:33:05" (1/1) ... [2023-11-29 04:33:05,443 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:33:05,445 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:33:05,445 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:33:05,445 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:33:05,446 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:33:05" (1/1) ... [2023-11-29 04:33:05,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:33:05,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:33:05,473 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:33:05,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:33:05,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:33:05,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 04:33:05,517 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 04:33:05,517 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 04:33:05,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:33:05,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:33:05,606 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:33:05,608 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:33:07,106 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:33:07,149 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:33:07,150 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 04:33:07,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:33:07 BoogieIcfgContainer [2023-11-29 04:33:07,150 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:33:07,153 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:33:07,153 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:33:07,156 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:33:07,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:33:05" (1/3) ... [2023-11-29 04:33:07,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281c07bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:33:07, skipping insertion in model container [2023-11-29 04:33:07,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:33:05" (2/3) ... [2023-11-29 04:33:07,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281c07bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:33:07, skipping insertion in model container [2023-11-29 04:33:07,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:33:07" (3/3) ... [2023-11-29 04:33:07,159 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-70.i [2023-11-29 04:33:07,176 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:33:07,177 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 04:33:07,221 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:33:07,226 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;@34a594eb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:33:07,226 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 04:33:07,230 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 04:33:07,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-29 04:33:07,242 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:33:07,242 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 04:33:07,243 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:33:07,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:33:07,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1254920039, now seen corresponding path program 1 times [2023-11-29 04:33:07,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:33:07,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865049938] [2023-11-29 04:33:07,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:33:07,262 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 04:33:07,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:33:07,264 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/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 04:33:07,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/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 04:33:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:07,662 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 04:33:07,669 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:33:07,708 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 04:33:07,709 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:33:07,709 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:33:07,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1865049938] [2023-11-29 04:33:07,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1865049938] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:33:07,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:33:07,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:33:07,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65238207] [2023-11-29 04:33:07,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:33:07,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 04:33:07,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:33:07,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 04:33:07,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:33:07,757 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 04:33:08,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:33:08,776 INFO L93 Difference]: Finished difference Result 75 states and 124 transitions. [2023-11-29 04:33:08,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 04:33:08,793 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 04:33:08,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:33:08,799 INFO L225 Difference]: With dead ends: 75 [2023-11-29 04:33:08,799 INFO L226 Difference]: Without dead ends: 37 [2023-11-29 04:33:08,802 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 04:33:08,806 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:33:08,807 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.0s Time] [2023-11-29 04:33:08,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-29 04:33:08,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-11-29 04:33:08,840 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 04:33:08,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 52 transitions. [2023-11-29 04:33:08,843 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 52 transitions. Word has length 79 [2023-11-29 04:33:08,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:33:08,844 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 52 transitions. [2023-11-29 04:33:08,844 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 04:33:08,844 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 52 transitions. [2023-11-29 04:33:08,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-29 04:33:08,848 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:33:08,849 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 04:33:08,860 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/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 04:33:09,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/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 04:33:09,050 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:33:09,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:33:09,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1235641761, now seen corresponding path program 1 times [2023-11-29 04:33:09,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:33:09,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1738388305] [2023-11-29 04:33:09,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:33:09,052 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 04:33:09,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:33:09,054 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/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 04:33:09,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/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 04:33:09,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:09,368 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 04:33:09,373 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:33:09,433 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 04:33:09,433 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:33:09,433 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:33:09,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1738388305] [2023-11-29 04:33:09,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1738388305] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:33:09,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:33:09,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:33:09,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104361959] [2023-11-29 04:33:09,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:33:09,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:33:09,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:33:09,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:33:09,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:33:09,440 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 04:33:10,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:33:10,654 INFO L93 Difference]: Finished difference Result 73 states and 103 transitions. [2023-11-29 04:33:10,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:33:10,670 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 04:33:10,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:33:10,673 INFO L225 Difference]: With dead ends: 73 [2023-11-29 04:33:10,673 INFO L226 Difference]: Without dead ends: 37 [2023-11-29 04:33:10,674 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 04:33:10,676 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:33:10,676 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.2s Time] [2023-11-29 04:33:10,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-29 04:33:10,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-11-29 04:33:10,685 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 04:33:10,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2023-11-29 04:33:10,687 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 79 [2023-11-29 04:33:10,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:33:10,689 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2023-11-29 04:33:10,689 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 04:33:10,689 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2023-11-29 04:33:10,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-29 04:33:10,691 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:33:10,691 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 04:33:10,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/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)] Forceful destruction successful, exit code 0 [2023-11-29 04:33:10,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/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 04:33:10,892 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:33:10,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:33:10,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1235701343, now seen corresponding path program 1 times [2023-11-29 04:33:10,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:33:10,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1858085317] [2023-11-29 04:33:10,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:33:10,894 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 04:33:10,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:33:10,895 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/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 04:33:10,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/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 04:33:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:11,183 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 04:33:11,189 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:33:11,851 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 04:33:11,852 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:33:12,033 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:33:12,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1858085317] [2023-11-29 04:33:12,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1858085317] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:33:12,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [532430567] [2023-11-29 04:33:12,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:33:12,034 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:33:12,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:33:12,039 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:33:12,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2023-11-29 04:33:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:13,133 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 04:33:13,139 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:33:13,591 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 04:33:13,591 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:33:14,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [532430567] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:33:14,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:33:14,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2023-11-29 04:33:14,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661415699] [2023-11-29 04:33:14,057 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:33:14,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 04:33:14,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:33:14,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 04:33:14,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2023-11-29 04:33:14,060 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 04:33:16,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:33:16,392 INFO L93 Difference]: Finished difference Result 103 states and 132 transitions. [2023-11-29 04:33:16,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 04:33:16,393 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 04:33:16,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:33:16,396 INFO L225 Difference]: With dead ends: 103 [2023-11-29 04:33:16,396 INFO L226 Difference]: Without dead ends: 67 [2023-11-29 04:33:16,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2023-11-29 04:33:16,399 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 72 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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, 1.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:33:16,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 74 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-11-29 04:33:16,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-29 04:33:16,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2023-11-29 04:33:16,413 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 04:33:16,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2023-11-29 04:33:16,415 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 79 [2023-11-29 04:33:16,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:33:16,416 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2023-11-29 04:33:16,417 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 04:33:16,417 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2023-11-29 04:33:16,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-29 04:33:16,419 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:33:16,419 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 04:33:16,427 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2023-11-29 04:33:16,633 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/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 04:33:16,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/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 04:33:16,828 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:33:16,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:33:16,829 INFO L85 PathProgramCache]: Analyzing trace with hash 426354717, now seen corresponding path program 1 times [2023-11-29 04:33:16,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:33:16,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1237764008] [2023-11-29 04:33:16,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:33:16,830 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 04:33:16,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:33:16,831 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/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 04:33:16,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6ca12dd2-2040-427d-905c-a2bef7ef4adf/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 04:33:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:17,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-29 04:33:17,147 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:34:22,663 WARN L293 SmtUtils]: Spent 23.04s 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 04:44:17,579 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 04:44:58,747 WARN L293 SmtUtils]: Spent 8.08s 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 04:45:07,494 WARN L293 SmtUtils]: Spent 8.08s 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 04:45:15,572 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:45:23,832 WARN L293 SmtUtils]: Spent 8.08s 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 04:45:31,996 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:45:53,080 WARN L293 SmtUtils]: Spent 8.06s on a formula simplification. DAG size of input: 8 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:46:00,596 WARN L293 SmtUtils]: Spent 7.36s 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 04:46:08,678 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:46:14,552 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 04:46:40,682 WARN L293 SmtUtils]: Spent 8.08s 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 04:46:53,961 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 04:47:02,438 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)