./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30e01a73 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ --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 3559b3594a82cd675e67391d8043202d21aa0bea5a13d40b68d97450424826dd --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 22:41:55,285 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 22:41:55,429 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-23 22:41:55,441 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 22:41:55,442 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 22:41:55,488 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 22:41:55,489 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 22:41:55,490 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 22:41:55,491 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 22:41:55,496 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 22:41:55,496 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 22:41:55,498 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 22:41:55,498 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 22:41:55,500 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 22:41:55,501 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 22:41:55,501 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 22:41:55,502 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 22:41:55,502 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 22:41:55,503 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 22:41:55,505 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 22:41:55,505 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 22:41:55,506 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 22:41:55,506 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 22:41:55,507 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 22:41:55,507 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 22:41:55,508 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 22:41:55,508 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 22:41:55,509 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 22:41:55,510 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 22:41:55,510 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 22:41:55,511 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 22:41:55,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:41:55,512 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 22:41:55,512 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 22:41:55,512 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 22:41:55,513 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 22:41:55,513 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 22:41:55,513 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 22:41:55,513 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 22:41:55,514 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 22:41:55,514 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 22:41:55,514 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 22:41:55,515 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_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/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_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ 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 -> 3559b3594a82cd675e67391d8043202d21aa0bea5a13d40b68d97450424826dd [2023-11-23 22:41:55,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 22:41:55,845 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 22:41:55,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 22:41:55,849 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 22:41:55,850 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 22:41:55,852 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i [2023-11-23 22:41:59,058 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 22:41:59,339 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 22:41:59,340 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i [2023-11-23 22:41:59,349 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/data/0d56282d6/597ecd90a7a544759d602ca179ffc778/FLAG886492f43 [2023-11-23 22:41:59,365 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/data/0d56282d6/597ecd90a7a544759d602ca179ffc778 [2023-11-23 22:41:59,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 22:41:59,369 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 22:41:59,371 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 22:41:59,372 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 22:41:59,384 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 22:41:59,384 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:41:59" (1/1) ... [2023-11-23 22:41:59,385 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26ccfc99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:41:59, skipping insertion in model container [2023-11-23 22:41:59,386 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:41:59" (1/1) ... [2023-11-23 22:41:59,444 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 22:41:59,621 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_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i[916,929] [2023-11-23 22:41:59,676 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:41:59,690 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 22:41:59,702 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_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i[916,929] [2023-11-23 22:41:59,729 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:41:59,748 INFO L206 MainTranslator]: Completed translation [2023-11-23 22:41:59,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:41:59 WrapperNode [2023-11-23 22:41:59,748 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 22:41:59,750 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 22:41:59,750 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 22:41:59,750 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 22:41:59,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:41:59" (1/1) ... [2023-11-23 22:41:59,768 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:41:59" (1/1) ... [2023-11-23 22:41:59,802 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 143 [2023-11-23 22:41:59,803 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 22:41:59,803 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 22:41:59,803 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 22:41:59,804 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 22:41:59,816 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:41:59" (1/1) ... [2023-11-23 22:41:59,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:41:59" (1/1) ... [2023-11-23 22:41:59,820 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:41:59" (1/1) ... [2023-11-23 22:41:59,835 INFO L189 HeapSplitter]: Split 2 memory accesses to 1 slices as follows [2] [2023-11-23 22:41:59,835 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:41:59" (1/1) ... [2023-11-23 22:41:59,836 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:41:59" (1/1) ... [2023-11-23 22:41:59,843 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:41:59" (1/1) ... [2023-11-23 22:41:59,857 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:41:59" (1/1) ... [2023-11-23 22:41:59,859 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:41:59" (1/1) ... [2023-11-23 22:41:59,861 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:41:59" (1/1) ... [2023-11-23 22:41:59,865 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 22:41:59,868 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 22:41:59,868 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 22:41:59,871 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 22:41:59,872 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:41:59" (1/1) ... [2023-11-23 22:41:59,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:41:59,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:41:59,926 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 22:41:59,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 22:41:59,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 22:41:59,974 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 22:41:59,975 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 22:41:59,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 22:41:59,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 22:41:59,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 22:42:00,089 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 22:42:00,092 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 22:42:00,568 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 22:42:00,626 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 22:42:00,631 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-23 22:42:00,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:42:00 BoogieIcfgContainer [2023-11-23 22:42:00,632 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 22:42:00,637 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 22:42:00,637 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 22:42:00,642 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 22:42:00,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:41:59" (1/3) ... [2023-11-23 22:42:00,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ede78ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:42:00, skipping insertion in model container [2023-11-23 22:42:00,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:41:59" (2/3) ... [2023-11-23 22:42:00,646 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ede78ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:42:00, skipping insertion in model container [2023-11-23 22:42:00,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:42:00" (3/3) ... [2023-11-23 22:42:00,650 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-55.i [2023-11-23 22:42:00,682 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 22:42:00,683 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 22:42:00,756 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 22:42:00,767 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;@2c174a47, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 22:42:00,768 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 22:42:00,775 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 38 states have internal predecessors, (55), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-23 22:42:00,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-23 22:42:00,799 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:42:00,800 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:42:00,802 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:42:00,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:42:00,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1069761762, now seen corresponding path program 1 times [2023-11-23 22:42:00,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:42:00,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084048834] [2023-11-23 22:42:00,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:42:00,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:42:01,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:01,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:42:01,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:01,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:42:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:01,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 22:42:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:01,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 22:42:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:01,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 22:42:01,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:01,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:42:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:01,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 22:42:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:01,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 22:42:01,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:01,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 22:42:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:01,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 22:42:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:01,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 22:42:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:01,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 22:42:01,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:01,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 22:42:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:01,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 22:42:01,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:01,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 22:42:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:01,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-23 22:42:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:01,290 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-23 22:42:01,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:42:01,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084048834] [2023-11-23 22:42:01,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084048834] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:42:01,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:42:01,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:42:01,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282380262] [2023-11-23 22:42:01,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:42:01,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 22:42:01,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:42:01,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 22:42:01,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 22:42:01,345 INFO L87 Difference]: Start difference. First operand has 56 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 38 states have internal predecessors, (55), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-23 22:42:01,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:42:01,390 INFO L93 Difference]: Finished difference Result 109 states and 188 transitions. [2023-11-23 22:42:01,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 22:42:01,393 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 102 [2023-11-23 22:42:01,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:42:01,403 INFO L225 Difference]: With dead ends: 109 [2023-11-23 22:42:01,403 INFO L226 Difference]: Without dead ends: 54 [2023-11-23 22:42:01,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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-23 22:42:01,416 INFO L413 NwaCegarLoop]: 79 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, 79 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-23 22:42:01,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 22:42:01,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-11-23 22:42:01,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-11-23 22:42:01,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-23 22:42:01,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 82 transitions. [2023-11-23 22:42:01,493 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 82 transitions. Word has length 102 [2023-11-23 22:42:01,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:42:01,494 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 82 transitions. [2023-11-23 22:42:01,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-23 22:42:01,495 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 82 transitions. [2023-11-23 22:42:01,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-23 22:42:01,499 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:42:01,499 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:42:01,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 22:42:01,500 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:42:01,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:42:01,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1715067678, now seen corresponding path program 1 times [2023-11-23 22:42:01,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:42:01,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140463481] [2023-11-23 22:42:01,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:42:01,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:42:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:01,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:42:01,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:01,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:42:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:01,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 22:42:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:01,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 22:42:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:01,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 22:42:01,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:01,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:42:01,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:01,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 22:42:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:01,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 22:42:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:01,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 22:42:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:01,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 22:42:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:01,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 22:42:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:01,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 22:42:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:01,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 22:42:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:01,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 22:42:01,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:01,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 22:42:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:01,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-23 22:42:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:01,950 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-23 22:42:01,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:42:01,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140463481] [2023-11-23 22:42:01,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140463481] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:42:01,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:42:01,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 22:42:01,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81154727] [2023-11-23 22:42:01,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:42:01,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:42:01,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:42:01,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:42:01,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:42:01,967 INFO L87 Difference]: Start difference. First operand 54 states and 82 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 22:42:02,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:42:02,038 INFO L93 Difference]: Finished difference Result 129 states and 195 transitions. [2023-11-23 22:42:02,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:42:02,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 102 [2023-11-23 22:42:02,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:42:02,042 INFO L225 Difference]: With dead ends: 129 [2023-11-23 22:42:02,042 INFO L226 Difference]: Without dead ends: 76 [2023-11-23 22:42:02,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-23 22:42:02,045 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 30 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 22:42:02,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 150 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 22:42:02,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-23 22:42:02,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2023-11-23 22:42:02,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-23 22:42:02,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 83 transitions. [2023-11-23 22:42:02,060 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 83 transitions. Word has length 102 [2023-11-23 22:42:02,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:42:02,062 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 83 transitions. [2023-11-23 22:42:02,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 22:42:02,062 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 83 transitions. [2023-11-23 22:42:02,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-23 22:42:02,065 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:42:02,065 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:42:02,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 22:42:02,065 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:42:02,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:42:02,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1878835040, now seen corresponding path program 1 times [2023-11-23 22:42:02,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:42:02,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300759329] [2023-11-23 22:42:02,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:42:02,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:42:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:02,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:42:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:02,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:42:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:02,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 22:42:02,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:02,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 22:42:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:02,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 22:42:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:02,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:42:02,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:02,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 22:42:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:02,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 22:42:02,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:02,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 22:42:02,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:02,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 22:42:02,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:02,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 22:42:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:02,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 22:42:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:02,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 22:42:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:02,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 22:42:02,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:02,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 22:42:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:02,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-23 22:42:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:02,288 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-23 22:42:02,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:42:02,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300759329] [2023-11-23 22:42:02,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300759329] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:42:02,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:42:02,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 22:42:02,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547893017] [2023-11-23 22:42:02,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:42:02,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:42:02,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:42:02,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:42:02,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:42:02,293 INFO L87 Difference]: Start difference. First operand 55 states and 83 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 22:42:02,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:42:02,355 INFO L93 Difference]: Finished difference Result 109 states and 165 transitions. [2023-11-23 22:42:02,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:42:02,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 102 [2023-11-23 22:42:02,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:42:02,358 INFO L225 Difference]: With dead ends: 109 [2023-11-23 22:42:02,358 INFO L226 Difference]: Without dead ends: 55 [2023-11-23 22:42:02,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-23 22:42:02,361 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 4 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 132 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-23 22:42:02,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 132 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 22:42:02,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-11-23 22:42:02,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-11-23 22:42:02,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 37 states have internal predecessors, (50), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-23 22:42:02,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 82 transitions. [2023-11-23 22:42:02,372 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 82 transitions. Word has length 102 [2023-11-23 22:42:02,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:42:02,373 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 82 transitions. [2023-11-23 22:42:02,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 22:42:02,374 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 82 transitions. [2023-11-23 22:42:02,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-23 22:42:02,376 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:42:02,376 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:42:02,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 22:42:02,376 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:42:02,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:42:02,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1785126821, now seen corresponding path program 1 times [2023-11-23 22:42:02,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:42:02,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281200328] [2023-11-23 22:42:02,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:42:02,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:42:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:03,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:42:03,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:03,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:42:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:03,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 22:42:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:03,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 22:42:03,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:03,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 22:42:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:03,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:42:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:03,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 22:42:03,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:03,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 22:42:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:03,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 22:42:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:03,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 22:42:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:03,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 22:42:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:03,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 22:42:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:03,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 22:42:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:03,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 22:42:03,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:03,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 22:42:03,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:03,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-23 22:42:03,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:03,282 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-23 22:42:03,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:42:03,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281200328] [2023-11-23 22:42:03,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281200328] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:42:03,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:42:03,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 22:42:03,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972020630] [2023-11-23 22:42:03,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:42:03,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 22:42:03,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:42:03,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 22:42:03,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 22:42:03,288 INFO L87 Difference]: Start difference. First operand 55 states and 82 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 22:42:03,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:42:03,489 INFO L93 Difference]: Finished difference Result 131 states and 193 transitions. [2023-11-23 22:42:03,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 22:42:03,490 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2023-11-23 22:42:03,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:42:03,494 INFO L225 Difference]: With dead ends: 131 [2023-11-23 22:42:03,494 INFO L226 Difference]: Without dead ends: 77 [2023-11-23 22:42:03,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-23 22:42:03,497 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 57 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 22:42:03,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 183 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 22:42:03,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-11-23 22:42:03,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2023-11-23 22:42:03,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 states have internal predecessors, (64), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-23 22:42:03,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 96 transitions. [2023-11-23 22:42:03,510 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 96 transitions. Word has length 104 [2023-11-23 22:42:03,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:42:03,511 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 96 transitions. [2023-11-23 22:42:03,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 22:42:03,511 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 96 transitions. [2023-11-23 22:42:03,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-23 22:42:03,513 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:42:03,514 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:42:03,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 22:42:03,514 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:42:03,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:42:03,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1595104073, now seen corresponding path program 1 times [2023-11-23 22:42:03,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:42:03,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391229093] [2023-11-23 22:42:03,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:42:03,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:42:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:03,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:42:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:03,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:42:03,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:03,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 22:42:03,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:03,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 22:42:03,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:03,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 22:42:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:03,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:42:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:03,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 22:42:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:03,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 22:42:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:03,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 22:42:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:03,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 22:42:03,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:03,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 22:42:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:03,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 22:42:03,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:03,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 22:42:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:03,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 22:42:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:03,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 22:42:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:03,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-23 22:42:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:03,843 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-23 22:42:03,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:42:03,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391229093] [2023-11-23 22:42:03,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391229093] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:42:03,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:42:03,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 22:42:03,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054041122] [2023-11-23 22:42:03,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:42:03,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:42:03,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:42:03,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:42:03,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:42:03,848 INFO L87 Difference]: Start difference. First operand 65 states and 96 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 22:42:03,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:42:03,962 INFO L93 Difference]: Finished difference Result 182 states and 271 transitions. [2023-11-23 22:42:03,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:42:03,963 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2023-11-23 22:42:03,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:42:03,965 INFO L225 Difference]: With dead ends: 182 [2023-11-23 22:42:03,966 INFO L226 Difference]: Without dead ends: 118 [2023-11-23 22:42:03,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-23 22:42:03,968 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 44 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 22:42:03,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 146 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 22:42:03,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-11-23 22:42:03,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 115. [2023-11-23 22:42:03,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 80 states have (on average 1.3125) internal successors, (105), 80 states have internal predecessors, (105), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-23 22:42:03,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 169 transitions. [2023-11-23 22:42:03,993 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 169 transitions. Word has length 105 [2023-11-23 22:42:03,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:42:03,994 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 169 transitions. [2023-11-23 22:42:03,994 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 22:42:03,994 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 169 transitions. [2023-11-23 22:42:03,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-23 22:42:03,996 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:42:03,997 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:42:03,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 22:42:03,997 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:42:03,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:42:03,998 INFO L85 PathProgramCache]: Analyzing trace with hash -213981125, now seen corresponding path program 1 times [2023-11-23 22:42:03,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:42:03,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163067101] [2023-11-23 22:42:03,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:42:03,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:42:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:05,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:42:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:05,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:42:05,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:05,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 22:42:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:05,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 22:42:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:05,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 22:42:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:05,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:42:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:05,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 22:42:05,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:05,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 22:42:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:05,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 22:42:05,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:05,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 22:42:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:05,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 22:42:05,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:05,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 22:42:05,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:05,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 22:42:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:05,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 22:42:05,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:05,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 22:42:05,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:05,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-23 22:42:05,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:05,694 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-23 22:42:05,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:42:05,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163067101] [2023-11-23 22:42:05,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163067101] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:42:05,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:42:05,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 22:42:05,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209933496] [2023-11-23 22:42:05,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:42:05,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 22:42:05,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:42:05,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 22:42:05,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-23 22:42:05,700 INFO L87 Difference]: Start difference. First operand 115 states and 169 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-23 22:42:06,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:42:06,505 INFO L93 Difference]: Finished difference Result 403 states and 581 transitions. [2023-11-23 22:42:06,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-23 22:42:06,507 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 105 [2023-11-23 22:42:06,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:42:06,511 INFO L225 Difference]: With dead ends: 403 [2023-11-23 22:42:06,511 INFO L226 Difference]: Without dead ends: 289 [2023-11-23 22:42:06,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2023-11-23 22:42:06,514 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 218 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 22:42:06,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 423 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 22:42:06,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2023-11-23 22:42:06,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 219. [2023-11-23 22:42:06,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 150 states have (on average 1.28) internal successors, (192), 150 states have internal predecessors, (192), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2023-11-23 22:42:06,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 320 transitions. [2023-11-23 22:42:06,565 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 320 transitions. Word has length 105 [2023-11-23 22:42:06,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:42:06,566 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 320 transitions. [2023-11-23 22:42:06,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-23 22:42:06,566 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 320 transitions. [2023-11-23 22:42:06,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-23 22:42:06,576 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:42:06,576 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:42:06,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 22:42:06,577 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:42:06,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:42:06,578 INFO L85 PathProgramCache]: Analyzing trace with hash -123214019, now seen corresponding path program 1 times [2023-11-23 22:42:06,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:42:06,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924892732] [2023-11-23 22:42:06,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:42:06,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:42:06,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:06,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:42:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:06,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:42:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:06,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 22:42:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:06,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 22:42:06,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:06,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 22:42:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:06,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:42:06,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:06,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 22:42:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:06,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 22:42:06,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:06,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 22:42:06,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:06,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 22:42:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:06,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 22:42:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:06,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 22:42:06,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:06,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 22:42:06,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:06,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 22:42:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:06,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 22:42:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:06,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-23 22:42:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:06,745 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-23 22:42:06,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:42:06,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924892732] [2023-11-23 22:42:06,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924892732] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:42:06,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:42:06,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 22:42:06,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120553712] [2023-11-23 22:42:06,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:42:06,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:42:06,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:42:06,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:42:06,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:42:06,754 INFO L87 Difference]: Start difference. First operand 219 states and 320 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 22:42:06,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:42:06,823 INFO L93 Difference]: Finished difference Result 439 states and 641 transitions. [2023-11-23 22:42:06,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:42:06,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2023-11-23 22:42:06,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:42:06,830 INFO L225 Difference]: With dead ends: 439 [2023-11-23 22:42:06,830 INFO L226 Difference]: Without dead ends: 221 [2023-11-23 22:42:06,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 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-23 22:42:06,833 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 5 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 22:42:06,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 132 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 22:42:06,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2023-11-23 22:42:06,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 219. [2023-11-23 22:42:06,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 150 states have (on average 1.2533333333333334) internal successors, (188), 150 states have internal predecessors, (188), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2023-11-23 22:42:06,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 316 transitions. [2023-11-23 22:42:06,905 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 316 transitions. Word has length 107 [2023-11-23 22:42:06,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:42:06,907 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 316 transitions. [2023-11-23 22:42:06,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 22:42:06,907 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 316 transitions. [2023-11-23 22:42:06,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-23 22:42:06,909 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:42:06,909 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:42:06,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 22:42:06,910 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:42:06,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:42:06,910 INFO L85 PathProgramCache]: Analyzing trace with hash -2139734824, now seen corresponding path program 1 times [2023-11-23 22:42:06,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:42:06,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596836452] [2023-11-23 22:42:06,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:42:06,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:42:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:07,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:42:07,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:07,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:42:07,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:07,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 22:42:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:07,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 22:42:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:07,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 22:42:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:07,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:42:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:07,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 22:42:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:07,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 22:42:07,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:07,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 22:42:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:07,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 22:42:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:07,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 22:42:07,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:07,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 22:42:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:07,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 22:42:07,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:07,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 22:42:07,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:07,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 22:42:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:07,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-23 22:42:07,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:07,286 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-23 22:42:07,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:42:07,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596836452] [2023-11-23 22:42:07,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596836452] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:42:07,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:42:07,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 22:42:07,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12504899] [2023-11-23 22:42:07,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:42:07,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 22:42:07,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:42:07,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 22:42:07,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-23 22:42:07,290 INFO L87 Difference]: Start difference. First operand 219 states and 316 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 22:42:07,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:42:07,639 INFO L93 Difference]: Finished difference Result 494 states and 692 transitions. [2023-11-23 22:42:07,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 22:42:07,640 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 109 [2023-11-23 22:42:07,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:42:07,645 INFO L225 Difference]: With dead ends: 494 [2023-11-23 22:42:07,645 INFO L226 Difference]: Without dead ends: 368 [2023-11-23 22:42:07,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-23 22:42:07,648 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 126 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 22:42:07,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 327 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 22:42:07,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2023-11-23 22:42:07,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 268. [2023-11-23 22:42:07,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 182 states have (on average 1.2362637362637363) internal successors, (225), 182 states have internal predecessors, (225), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-11-23 22:42:07,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 385 transitions. [2023-11-23 22:42:07,709 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 385 transitions. Word has length 109 [2023-11-23 22:42:07,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:42:07,709 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 385 transitions. [2023-11-23 22:42:07,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 22:42:07,710 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 385 transitions. [2023-11-23 22:42:07,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-23 22:42:07,712 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:42:07,712 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:42:07,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 22:42:07,712 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:42:07,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:42:07,713 INFO L85 PathProgramCache]: Analyzing trace with hash 123046868, now seen corresponding path program 1 times [2023-11-23 22:42:07,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:42:07,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498440747] [2023-11-23 22:42:07,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:42:07,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:42:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:07,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:42:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:07,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:42:07,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:07,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 22:42:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:07,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 22:42:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:07,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 22:42:07,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:07,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:42:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:07,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 22:42:07,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:07,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 22:42:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:07,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 22:42:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:07,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 22:42:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:07,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 22:42:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:07,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 22:42:07,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:07,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 22:42:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:07,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 22:42:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:07,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 22:42:07,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:07,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-23 22:42:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:07,825 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-23 22:42:07,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:42:07,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498440747] [2023-11-23 22:42:07,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498440747] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:42:07,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:42:07,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 22:42:07,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453984570] [2023-11-23 22:42:07,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:42:07,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:42:07,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:42:07,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:42:07,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:42:07,831 INFO L87 Difference]: Start difference. First operand 268 states and 385 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 22:42:07,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:42:07,964 INFO L93 Difference]: Finished difference Result 496 states and 722 transitions. [2023-11-23 22:42:07,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:42:07,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 109 [2023-11-23 22:42:07,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:42:07,969 INFO L225 Difference]: With dead ends: 496 [2023-11-23 22:42:07,969 INFO L226 Difference]: Without dead ends: 376 [2023-11-23 22:42:07,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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-23 22:42:07,973 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 64 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 22:42:07,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 130 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 22:42:07,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2023-11-23 22:42:08,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 256. [2023-11-23 22:42:08,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 170 states have (on average 1.2411764705882353) internal successors, (211), 170 states have internal predecessors, (211), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-11-23 22:42:08,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 371 transitions. [2023-11-23 22:42:08,037 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 371 transitions. Word has length 109 [2023-11-23 22:42:08,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:42:08,038 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 371 transitions. [2023-11-23 22:42:08,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 22:42:08,039 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 371 transitions. [2023-11-23 22:42:08,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-23 22:42:08,041 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:42:08,041 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:42:08,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 22:42:08,042 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:42:08,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:42:08,043 INFO L85 PathProgramCache]: Analyzing trace with hash -629041456, now seen corresponding path program 1 times [2023-11-23 22:42:08,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:42:08,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022230659] [2023-11-23 22:42:08,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:42:08,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:42:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:10,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:42:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:10,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:42:10,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:10,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 22:42:10,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:10,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 22:42:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:10,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 22:42:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:10,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:42:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:10,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 22:42:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:10,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 22:42:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:10,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 22:42:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:10,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 22:42:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:10,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 22:42:10,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:10,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 22:42:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:10,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 22:42:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:10,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 22:42:10,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:10,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 22:42:10,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:10,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-23 22:42:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:10,679 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-11-23 22:42:10,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:42:10,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022230659] [2023-11-23 22:42:10,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022230659] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:42:10,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668655608] [2023-11-23 22:42:10,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:42:10,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:42:10,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:42:10,683 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:42:10,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 22:42:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:11,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-23 22:42:11,310 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:42:12,225 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 183 proven. 45 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2023-11-23 22:42:12,226 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 22:42:13,505 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-11-23 22:42:13,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668655608] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 22:42:13,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 22:42:13,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 10] total 26 [2023-11-23 22:42:13,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823880226] [2023-11-23 22:42:13,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 22:42:13,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-23 22:42:13,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:42:13,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-23 22:42:13,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2023-11-23 22:42:13,509 INFO L87 Difference]: Start difference. First operand 256 states and 371 transitions. Second operand has 26 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 26 states have internal predecessors, (82), 3 states have call successors, (22), 2 states have call predecessors, (22), 5 states have return successors, (24), 4 states have call predecessors, (24), 3 states have call successors, (24) [2023-11-23 22:42:15,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:42:15,682 INFO L93 Difference]: Finished difference Result 396 states and 507 transitions. [2023-11-23 22:42:15,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-23 22:42:15,683 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 26 states have internal predecessors, (82), 3 states have call successors, (22), 2 states have call predecessors, (22), 5 states have return successors, (24), 4 states have call predecessors, (24), 3 states have call successors, (24) Word has length 109 [2023-11-23 22:42:15,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:42:15,686 INFO L225 Difference]: With dead ends: 396 [2023-11-23 22:42:15,686 INFO L226 Difference]: Without dead ends: 394 [2023-11-23 22:42:15,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 234 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=643, Invalid=2113, Unknown=0, NotChecked=0, Total=2756 [2023-11-23 22:42:15,689 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 387 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-23 22:42:15,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 310 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-23 22:42:15,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2023-11-23 22:42:15,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 334. [2023-11-23 22:42:15,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 234 states have (on average 1.1923076923076923) internal successors, (279), 234 states have internal predecessors, (279), 80 states have call successors, (80), 19 states have call predecessors, (80), 19 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-11-23 22:42:15,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 439 transitions. [2023-11-23 22:42:15,758 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 439 transitions. Word has length 109 [2023-11-23 22:42:15,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:42:15,759 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 439 transitions. [2023-11-23 22:42:15,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.1538461538461537) internal successors, (82), 26 states have internal predecessors, (82), 3 states have call successors, (22), 2 states have call predecessors, (22), 5 states have return successors, (24), 4 states have call predecessors, (24), 3 states have call successors, (24) [2023-11-23 22:42:15,759 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 439 transitions. [2023-11-23 22:42:15,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-23 22:42:15,761 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:42:15,761 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:42:15,791 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 22:42:15,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-23 22:42:15,972 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:42:15,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:42:15,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1209278763, now seen corresponding path program 1 times [2023-11-23 22:42:15,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:42:15,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468423888] [2023-11-23 22:42:15,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:42:15,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:42:16,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:16,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-23 22:42:16,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:16,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-23 22:42:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:16,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 22:42:16,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:16,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-23 22:42:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:16,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 22:42:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:16,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 22:42:16,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:16,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 22:42:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:16,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 22:42:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:16,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 22:42:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:16,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 22:42:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:16,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 22:42:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:16,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 22:42:16,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:16,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 22:42:16,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:16,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 22:42:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:16,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 22:42:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:16,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-23 22:42:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:16,250 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-11-23 22:42:16,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 22:42:16,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468423888] [2023-11-23 22:42:16,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468423888] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 22:42:16,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071830186] [2023-11-23 22:42:16,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:42:16,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 22:42:16,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:42:16,252 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 22:42:16,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 22:42:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:16,355 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 22:42:16,368 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:42:16,539 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 183 proven. 9 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2023-11-23 22:42:16,539 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 22:42:16,734 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-11-23 22:42:16,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071830186] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 22:42:16,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 22:42:16,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-11-23 22:42:16,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587249061] [2023-11-23 22:42:16,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 22:42:16,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-23 22:42:16,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 22:42:16,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-23 22:42:16,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-11-23 22:42:16,738 INFO L87 Difference]: Start difference. First operand 334 states and 439 transitions. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 3 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2023-11-23 22:42:17,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:42:17,176 INFO L93 Difference]: Finished difference Result 530 states and 687 transitions. [2023-11-23 22:42:17,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-23 22:42:17,177 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 3 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 110 [2023-11-23 22:42:17,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:42:17,186 INFO L225 Difference]: With dead ends: 530 [2023-11-23 22:42:17,186 INFO L226 Difference]: Without dead ends: 362 [2023-11-23 22:42:17,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 243 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2023-11-23 22:42:17,188 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 126 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 22:42:17,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 171 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 22:42:17,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2023-11-23 22:42:17,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 334. [2023-11-23 22:42:17,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 234 states have (on average 1.1666666666666667) internal successors, (273), 234 states have internal predecessors, (273), 80 states have call successors, (80), 19 states have call predecessors, (80), 19 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-11-23 22:42:17,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 433 transitions. [2023-11-23 22:42:17,257 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 433 transitions. Word has length 110 [2023-11-23 22:42:17,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:42:17,258 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 433 transitions. [2023-11-23 22:42:17,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 states have internal predecessors, (61), 3 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2023-11-23 22:42:17,259 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 433 transitions. [2023-11-23 22:42:17,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-23 22:42:17,260 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:42:17,260 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:42:17,287 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 22:42:17,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-23 22:42:17,482 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:42:17,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:42:17,483 INFO L85 PathProgramCache]: Analyzing trace with hash -508214185, now seen corresponding path program 1 times [2023-11-23 22:42:17,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 22:42:17,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804905110] [2023-11-23 22:42:17,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:42:17,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 22:42:17,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:42:17,540 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 22:42:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 22:42:17,643 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 22:42:17,643 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 22:42:17,645 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-23 22:42:17,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 22:42:17,650 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 22:42:17,655 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 22:42:17,755 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-23 22:42:17,756 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-23 22:42:17,757 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-23 22:42:17,757 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-23 22:42:17,757 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite6 could not be translated [2023-11-23 22:42:17,757 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated [2023-11-23 22:42:17,758 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated [2023-11-23 22:42:17,758 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-23 22:42:17,759 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated [2023-11-23 22:42:17,759 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-23 22:42:17,759 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-23 22:42:17,760 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated [2023-11-23 22:42:17,760 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-23 22:42:17,760 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated [2023-11-23 22:42:17,761 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated [2023-11-23 22:42:17,761 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated [2023-11-23 22:42:17,761 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated [2023-11-23 22:42:17,761 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite17 could not be translated [2023-11-23 22:42:17,762 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-23 22:42:17,762 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated [2023-11-23 22:42:17,762 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated [2023-11-23 22:42:17,762 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated [2023-11-23 22:42:17,762 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite17 could not be translated [2023-11-23 22:42:17,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:42:17 BoogieIcfgContainer [2023-11-23 22:42:17,789 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 22:42:17,790 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 22:42:17,790 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 22:42:17,790 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 22:42:17,791 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:42:00" (3/4) ... [2023-11-23 22:42:17,793 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-23 22:42:17,794 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 22:42:17,795 INFO L158 Benchmark]: Toolchain (without parser) took 18425.67ms. Allocated memory was 163.6MB in the beginning and 343.9MB in the end (delta: 180.4MB). Free memory was 125.9MB in the beginning and 186.7MB in the end (delta: -60.8MB). Peak memory consumption was 120.2MB. Max. memory is 16.1GB. [2023-11-23 22:42:17,795 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 121.6MB. Free memory is still 90.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 22:42:17,796 INFO L158 Benchmark]: CACSL2BoogieTranslator took 377.57ms. Allocated memory is still 163.6MB. Free memory was 125.9MB in the beginning and 113.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-23 22:42:17,796 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.07ms. Allocated memory is still 163.6MB. Free memory was 113.3MB in the beginning and 110.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 22:42:17,796 INFO L158 Benchmark]: Boogie Preprocessor took 63.86ms. Allocated memory is still 163.6MB. Free memory was 110.6MB in the beginning and 107.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 22:42:17,797 INFO L158 Benchmark]: RCFGBuilder took 764.27ms. Allocated memory is still 163.6MB. Free memory was 107.7MB in the beginning and 88.2MB in the end (delta: 19.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-23 22:42:17,798 INFO L158 Benchmark]: TraceAbstraction took 17152.47ms. Allocated memory was 163.6MB in the beginning and 343.9MB in the end (delta: 180.4MB). Free memory was 87.5MB in the beginning and 187.8MB in the end (delta: -100.2MB). Peak memory consumption was 82.4MB. Max. memory is 16.1GB. [2023-11-23 22:42:17,798 INFO L158 Benchmark]: Witness Printer took 4.77ms. Allocated memory is still 343.9MB. Free memory was 187.8MB in the beginning and 186.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 22:42:17,801 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 121.6MB. Free memory is still 90.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 377.57ms. Allocated memory is still 163.6MB. Free memory was 125.9MB in the beginning and 113.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.07ms. Allocated memory is still 163.6MB. Free memory was 113.3MB in the beginning and 110.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.86ms. Allocated memory is still 163.6MB. Free memory was 110.6MB in the beginning and 107.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 764.27ms. Allocated memory is still 163.6MB. Free memory was 107.7MB in the beginning and 88.2MB in the end (delta: 19.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 17152.47ms. Allocated memory was 163.6MB in the beginning and 343.9MB in the end (delta: 180.4MB). Free memory was 87.5MB in the beginning and 187.8MB in the end (delta: -100.2MB). Peak memory consumption was 82.4MB. Max. memory is 16.1GB. * Witness Printer took 4.77ms. Allocated memory is still 343.9MB. Free memory was 187.8MB in the beginning and 186.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet16 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~nondet16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite17 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 shiftRight at line 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_5 = 0; [L25] signed long int var_1_7 = 256; [L26] signed long int var_1_8 = 63; [L27] signed long int var_1_9 = 1; [L28] signed long int var_1_10 = 0; [L29] signed long int var_1_11 = 16; [L30] signed long int var_1_12 = -5; [L31] unsigned char var_1_14 = 128; [L32] signed long int var_1_15 = 4; [L33] unsigned long int var_1_16 = 500; [L34] unsigned char var_1_17 = 2; [L35] unsigned char var_1_18 = 100; [L36] signed long int last_1_var_1_12 = -5; [L37] unsigned char last_1_var_1_17 = 2; [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L97] last_1_var_1_12 = var_1_12 [L98] last_1_var_1_17 = var_1_17 [L108] RET updateLastVariables() [L109] CALL updateVariables() [L71] var_1_2 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_5=0, var_1_7=256, var_1_8=63, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_5=0, var_1_7=256, var_1_8=63, var_1_9=1] [L72] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_5=0, var_1_7=256, var_1_8=63, var_1_9=1] [L73] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=0, var_1_7=256, var_1_8=63, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=0, var_1_7=256, var_1_8=63, var_1_9=1] [L73] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=0, var_1_7=256, var_1_8=63, var_1_9=1] [L74] var_1_5 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_7=256, var_1_8=63, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_7=256, var_1_8=63, var_1_9=1] [L75] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_7=256, var_1_8=63, var_1_9=1] [L76] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=63, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=63, var_1_9=1] [L76] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=63, var_1_9=1] [L77] var_1_8 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=1] [L78] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=1] [L79] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=1] [L79] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=1] [L80] var_1_9 = __VERIFIER_nondet_long() [L81] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L81] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L82] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L82] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L83] var_1_10 = __VERIFIER_nondet_long() [L84] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L84] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L85] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L85] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=16, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L86] var_1_11 = __VERIFIER_nondet_long() [L87] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L87] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L88] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L88] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=128, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L89] var_1_14 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_14 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L90] RET assume_abort_if_not(var_1_14 >= 127) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L91] CALL assume_abort_if_not(var_1_14 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L91] RET assume_abort_if_not(var_1_14 <= 255) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=100, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L92] var_1_18 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L93] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L94] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L94] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L109] RET updateVariables() [L110] CALL step() [L41] unsigned char stepLocal_1 = last_1_var_1_12 >= last_1_var_1_17; [L42] signed long int stepLocal_0 = last_1_var_1_17; VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=10, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L43] COND FALSE !(\read(var_1_2)) [L52] var_1_1 = last_1_var_1_17 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L54] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=4, var_1_16=500, var_1_17=2, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L57] var_1_15 = var_1_8 [L58] var_1_16 = var_1_14 [L59] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L60] EXPR -4 >> var_1_1 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L60] EXPR (((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L60] EXPR -4 >> var_1_1 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L60] EXPR (((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L60] signed long int stepLocal_3 = ((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)); [L61] signed long int stepLocal_2 = var_1_1 / -8; VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, stepLocal_2=0, stepLocal_3=-255, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L62] COND TRUE (~ var_1_17) <= stepLocal_3 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, stepLocal_2=0, stepLocal_3=-255, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L63] COND FALSE !((var_1_14 - 64) < stepLocal_2) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, stepLocal_0=2, stepLocal_1=0, stepLocal_2=0, stepLocal_3=-255, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR ((var_1_2 ? (((last_1_var_1_12 >= last_1_var_1_17) && var_1_5) ? ((last_1_var_1_12 >= last_1_var_1_17) ? (var_1_1 == ((unsigned short int) 5)) : (var_1_1 == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : (var_1_1 == ((unsigned short int) last_1_var_1_17))) && (var_1_2 ? (var_1_7 == ((signed long int) (((var_1_8 + var_1_9) + var_1_10) - var_1_11))) : 1)) && (((~ var_1_17) <= (((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)))) ? (((var_1_14 - 64) < (var_1_1 / -8)) ? (var_1_12 == ((signed long int) var_1_1)) : 1) : (var_1_12 == ((signed long int) (var_1_17 - var_1_14)))) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L101] EXPR -4 >> var_1_1 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L101] EXPR (((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L101] EXPR -4 >> var_1_1 VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L101] EXPR (((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L101] EXPR ((var_1_2 ? (((last_1_var_1_12 >= last_1_var_1_17) && var_1_5) ? ((last_1_var_1_12 >= last_1_var_1_17) ? (var_1_1 == ((unsigned short int) 5)) : (var_1_1 == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : (var_1_1 == ((unsigned short int) last_1_var_1_17))) && (var_1_2 ? (var_1_7 == ((signed long int) (((var_1_8 + var_1_9) + var_1_10) - var_1_11))) : 1)) && (((~ var_1_17) <= (((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)))) ? (((var_1_14 - 64) < (var_1_1 / -8)) ? (var_1_12 == ((signed long int) var_1_1)) : 1) : (var_1_12 == ((signed long int) (var_1_17 - var_1_14)))) VAL [isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L101-L102] return (((((var_1_2 ? (((last_1_var_1_12 >= last_1_var_1_17) && var_1_5) ? ((last_1_var_1_12 >= last_1_var_1_17) ? (var_1_1 == ((unsigned short int) 5)) : (var_1_1 == ((unsigned short int) ((((25) < (last_1_var_1_17)) ? (25) : (last_1_var_1_17)))))) : 1) : (var_1_1 == ((unsigned short int) last_1_var_1_17))) && (var_1_2 ? (var_1_7 == ((signed long int) (((var_1_8 + var_1_9) + var_1_10) - var_1_11))) : 1)) && (((~ var_1_17) <= (((((-4 >> var_1_1)) < (var_1_1)) ? ((-4 >> var_1_1)) : (var_1_1)))) ? (((var_1_14 - 64) < (var_1_1 / -8)) ? (var_1_12 == ((signed long int) var_1_1)) : 1) : (var_1_12 == ((signed long int) (var_1_17 - var_1_14))))) && (var_1_15 == ((signed long int) var_1_8))) && (var_1_16 == ((unsigned long int) var_1_14))) && (var_1_17 == ((unsigned char) var_1_18)) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_12=-5, last_1_var_1_17=2, var_1_10=0, var_1_11=0, var_1_12=-5, var_1_14=127, var_1_15=0, var_1_16=127, var_1_17=254, var_1_18=254, var_1_1=2, var_1_2=0, var_1_5=1, var_1_7=256, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.9s, OverallIterations: 12, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1109 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1061 mSDsluCounter, 2183 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1372 mSDsCounter, 351 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1368 IncrementalHoareTripleChecker+Invalid, 1719 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 351 mSolverCounterUnsat, 811 mSDtfsCounter, 1368 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 909 GetRequests, 801 SyntacticMatches, 4 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=334occurred in iteration=10, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 416 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 1493 NumberOfCodeBlocks, 1493 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1587 ConstructedInterpolants, 0 QuantifiedInterpolants, 6985 SizeOfPredicates, 24 NumberOfNonLiveVariables, 535 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 7110/7200 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-23 22:42:17,858 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ --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 3559b3594a82cd675e67391d8043202d21aa0bea5a13d40b68d97450424826dd --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 22:42:20,535 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 22:42:20,683 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-23 22:42:20,693 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 22:42:20,694 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 22:42:20,742 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 22:42:20,743 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 22:42:20,744 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 22:42:20,747 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 22:42:20,753 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 22:42:20,753 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 22:42:20,754 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 22:42:20,755 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 22:42:20,756 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 22:42:20,757 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 22:42:20,758 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 22:42:20,758 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 22:42:20,759 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 22:42:20,759 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 22:42:20,760 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 22:42:20,761 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 22:42:20,762 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 22:42:20,762 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 22:42:20,763 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 22:42:20,763 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-23 22:42:20,764 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-23 22:42:20,764 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 22:42:20,765 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 22:42:20,765 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 22:42:20,766 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 22:42:20,767 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 22:42:20,768 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 22:42:20,768 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 22:42:20,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:42:20,769 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 22:42:20,769 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 22:42:20,770 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 22:42:20,770 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-23 22:42:20,771 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-23 22:42:20,771 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 22:42:20,771 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 22:42:20,772 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 22:42:20,772 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 22:42:20,772 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 22:42:20,773 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-23 22:42:20,773 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_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/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_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ 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 -> 3559b3594a82cd675e67391d8043202d21aa0bea5a13d40b68d97450424826dd [2023-11-23 22:42:21,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 22:42:21,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 22:42:21,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 22:42:21,263 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 22:42:21,264 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 22:42:21,265 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i [2023-11-23 22:42:24,434 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 22:42:24,701 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 22:42:24,702 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i [2023-11-23 22:42:24,712 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/data/cebbf2e76/5d0216845d0944c69cb89489786708bd/FLAG8d538c2e8 [2023-11-23 22:42:24,728 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/data/cebbf2e76/5d0216845d0944c69cb89489786708bd [2023-11-23 22:42:24,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 22:42:24,732 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 22:42:24,734 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 22:42:24,734 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 22:42:24,740 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 22:42:24,741 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:42:24" (1/1) ... [2023-11-23 22:42:24,742 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7959a1a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:42:24, skipping insertion in model container [2023-11-23 22:42:24,743 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:42:24" (1/1) ... [2023-11-23 22:42:24,772 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 22:42:24,988 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_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i[916,929] [2023-11-23 22:42:25,060 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:42:25,080 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 22:42:25,098 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_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-55.i[916,929] [2023-11-23 22:42:25,138 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 22:42:25,170 INFO L206 MainTranslator]: Completed translation [2023-11-23 22:42:25,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:42:25 WrapperNode [2023-11-23 22:42:25,170 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 22:42:25,172 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 22:42:25,172 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 22:42:25,173 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 22:42:25,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:42:25" (1/1) ... [2023-11-23 22:42:25,269 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:42:25" (1/1) ... [2023-11-23 22:42:25,311 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2023-11-23 22:42:25,314 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 22:42:25,315 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 22:42:25,315 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 22:42:25,316 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 22:42:25,329 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:42:25" (1/1) ... [2023-11-23 22:42:25,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:42:25" (1/1) ... [2023-11-23 22:42:25,352 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:42:25" (1/1) ... [2023-11-23 22:42:25,370 INFO L189 HeapSplitter]: Split 2 memory accesses to 1 slices as follows [2] [2023-11-23 22:42:25,376 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:42:25" (1/1) ... [2023-11-23 22:42:25,376 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:42:25" (1/1) ... [2023-11-23 22:42:25,384 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:42:25" (1/1) ... [2023-11-23 22:42:25,395 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:42:25" (1/1) ... [2023-11-23 22:42:25,399 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:42:25" (1/1) ... [2023-11-23 22:42:25,407 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:42:25" (1/1) ... [2023-11-23 22:42:25,410 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 22:42:25,418 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 22:42:25,418 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 22:42:25,419 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 22:42:25,421 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:42:25" (1/1) ... [2023-11-23 22:42:25,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 22:42:25,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 22:42:25,457 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 22:42:25,488 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 22:42:25,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 22:42:25,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-23 22:42:25,510 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 22:42:25,510 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 22:42:25,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 22:42:25,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 22:42:25,600 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 22:42:25,603 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 22:42:25,952 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 22:42:26,068 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 22:42:26,068 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-23 22:42:26,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:42:26 BoogieIcfgContainer [2023-11-23 22:42:26,070 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 22:42:26,072 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 22:42:26,073 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 22:42:26,076 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 22:42:26,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:42:24" (1/3) ... [2023-11-23 22:42:26,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c269b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:42:26, skipping insertion in model container [2023-11-23 22:42:26,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:42:25" (2/3) ... [2023-11-23 22:42:26,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c269b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:42:26, skipping insertion in model container [2023-11-23 22:42:26,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:42:26" (3/3) ... [2023-11-23 22:42:26,083 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-55.i [2023-11-23 22:42:26,104 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 22:42:26,105 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 22:42:26,207 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 22:42:26,216 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;@72c3bbd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 22:42:26,219 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 22:42:26,223 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-23 22:42:26,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-11-23 22:42:26,239 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:42:26,240 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:42:26,241 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:42:26,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:42:26,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1570447154, now seen corresponding path program 1 times [2023-11-23 22:42:26,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 22:42:26,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [919819963] [2023-11-23 22:42:26,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:42:26,268 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-23 22:42:26,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 22:42:26,275 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/mathsat -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-23 22:42:26,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/mathsat -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-23 22:42:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:26,490 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-23 22:42:26,502 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:42:26,564 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2023-11-23 22:42:26,564 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 22:42:26,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 22:42:26,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [919819963] [2023-11-23 22:42:26,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [919819963] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:42:26,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:42:26,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 22:42:26,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082587102] [2023-11-23 22:42:26,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:42:26,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 22:42:26,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 22:42:26,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 22:42:26,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 22:42:26,621 INFO L87 Difference]: Start difference. First operand has 44 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 22:42:26,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:42:26,681 INFO L93 Difference]: Finished difference Result 85 states and 150 transitions. [2023-11-23 22:42:26,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 22:42:26,686 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 97 [2023-11-23 22:42:26,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:42:26,698 INFO L225 Difference]: With dead ends: 85 [2023-11-23 22:42:26,698 INFO L226 Difference]: Without dead ends: 42 [2023-11-23 22:42:26,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 96 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-23 22:42:26,708 INFO L413 NwaCegarLoop]: 60 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, 60 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-23 22:42:26,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 22:42:26,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-11-23 22:42:26,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-11-23 22:42:26,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-23 22:42:26,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 63 transitions. [2023-11-23 22:42:26,771 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 63 transitions. Word has length 97 [2023-11-23 22:42:26,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:42:26,772 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 63 transitions. [2023-11-23 22:42:26,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 22:42:26,775 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 63 transitions. [2023-11-23 22:42:26,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-11-23 22:42:26,785 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:42:26,785 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:42:26,789 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-11-23 22:42:26,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/mathsat -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-23 22:42:26,990 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:42:26,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:42:26,991 INFO L85 PathProgramCache]: Analyzing trace with hash -169214158, now seen corresponding path program 1 times [2023-11-23 22:42:26,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 22:42:26,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2078489954] [2023-11-23 22:42:26,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:42:26,993 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-23 22:42:26,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 22:42:26,994 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/mathsat -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-23 22:42:27,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/mathsat -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-23 22:42:27,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:27,160 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-23 22:42:27,167 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 22:42:27,194 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-23 22:42:27,195 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 22:42:27,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 22:42:27,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2078489954] [2023-11-23 22:42:27,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2078489954] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 22:42:27,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 22:42:27,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 22:42:27,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956129697] [2023-11-23 22:42:27,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 22:42:27,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 22:42:27,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 22:42:27,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 22:42:27,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 22:42:27,200 INFO L87 Difference]: Start difference. First operand 42 states and 63 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 22:42:27,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 22:42:27,249 INFO L93 Difference]: Finished difference Result 93 states and 138 transitions. [2023-11-23 22:42:27,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 22:42:27,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 97 [2023-11-23 22:42:27,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 22:42:27,253 INFO L225 Difference]: With dead ends: 93 [2023-11-23 22:42:27,253 INFO L226 Difference]: Without dead ends: 52 [2023-11-23 22:42:27,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 95 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-23 22:42:27,256 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 11 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 22:42:27,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 113 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 22:42:27,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-11-23 22:42:27,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2023-11-23 22:42:27,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-23 22:42:27,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2023-11-23 22:42:27,268 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 97 [2023-11-23 22:42:27,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 22:42:27,270 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2023-11-23 22:42:27,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-23 22:42:27,271 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2023-11-23 22:42:27,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-11-23 22:42:27,273 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 22:42:27,273 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-23 22:42:27,282 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/mathsat -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-23 22:42:27,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/mathsat -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-23 22:42:27,477 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 22:42:27,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 22:42:27,478 INFO L85 PathProgramCache]: Analyzing trace with hash -111955856, now seen corresponding path program 1 times [2023-11-23 22:42:27,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 22:42:27,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1017254991] [2023-11-23 22:42:27,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 22:42:27,479 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-23 22:42:27,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 22:42:27,482 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/mathsat -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-23 22:42:27,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b45cd278-7c9f-4f01-9efa-4322d8baa0a3/bin/uautomizer-verify-zZY32mL2XJ/mathsat -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-23 22:42:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 22:42:27,607 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-23 22:42:27,616 INFO L285 TraceCheckSpWp]: Computing forward predicates...