./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-82.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f12e881-a843-4b24-9206-c39eec24f3cb/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f12e881-a843-4b24-9206-c39eec24f3cb/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f12e881-a843-4b24-9206-c39eec24f3cb/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f12e881-a843-4b24-9206-c39eec24f3cb/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-82.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f12e881-a843-4b24-9206-c39eec24f3cb/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f12e881-a843-4b24-9206-c39eec24f3cb/bin/uautomizer-verify-VRDe98Ueme --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 339edc38035dfe8cb71e349cc2d95f28254ea4491ede16137abb97bcdb10ff6a --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:43:43,203 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:43:43,333 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f12e881-a843-4b24-9206-c39eec24f3cb/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-26 11:43:43,341 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:43:43,342 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:43:43,382 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:43:43,383 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:43:43,384 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:43:43,385 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:43:43,390 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:43:43,390 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:43:43,391 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:43:43,392 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:43:43,393 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:43:43,394 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:43:43,394 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:43:43,395 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:43:43,395 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:43:43,396 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:43:43,396 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:43:43,396 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:43:43,397 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:43:43,397 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:43:43,398 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:43:43,398 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:43:43,398 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:43:43,399 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:43:43,400 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:43:43,400 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:43:43,400 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:43:43,402 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:43:43,402 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:43:43,402 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:43:43,402 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:43:43,403 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:43:43,403 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:43:43,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:43:43,403 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:43:43,403 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:43:43,404 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:43:43,404 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:43:43,404 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:43:43,404 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_0f12e881-a843-4b24-9206-c39eec24f3cb/bin/uautomizer-verify-VRDe98Ueme/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_0f12e881-a843-4b24-9206-c39eec24f3cb/bin/uautomizer-verify-VRDe98Ueme 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 -> 339edc38035dfe8cb71e349cc2d95f28254ea4491ede16137abb97bcdb10ff6a [2023-11-26 11:43:43,732 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:43:43,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:43:43,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:43:43,784 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:43:43,784 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:43:43,786 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f12e881-a843-4b24-9206-c39eec24f3cb/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-82.i [2023-11-26 11:43:46,983 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:43:47,313 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:43:47,315 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f12e881-a843-4b24-9206-c39eec24f3cb/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-82.i [2023-11-26 11:43:47,325 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f12e881-a843-4b24-9206-c39eec24f3cb/bin/uautomizer-verify-VRDe98Ueme/data/2f875083d/ba673c88b23342539a78bd9f5cfce831/FLAGf4015f2be [2023-11-26 11:43:47,353 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f12e881-a843-4b24-9206-c39eec24f3cb/bin/uautomizer-verify-VRDe98Ueme/data/2f875083d/ba673c88b23342539a78bd9f5cfce831 [2023-11-26 11:43:47,359 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:43:47,361 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:43:47,365 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:43:47,365 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:43:47,370 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:43:47,371 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:43:47" (1/1) ... [2023-11-26 11:43:47,373 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5619652c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:47, skipping insertion in model container [2023-11-26 11:43:47,373 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:43:47" (1/1) ... [2023-11-26 11:43:47,399 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:43:47,590 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_0f12e881-a843-4b24-9206-c39eec24f3cb/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-82.i[915,928] [2023-11-26 11:43:47,621 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:43:47,635 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:43:47,647 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_0f12e881-a843-4b24-9206-c39eec24f3cb/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-82.i[915,928] [2023-11-26 11:43:47,667 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:43:47,692 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:43:47,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:47 WrapperNode [2023-11-26 11:43:47,693 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:43:47,694 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:43:47,695 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:43:47,695 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:43:47,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:47" (1/1) ... [2023-11-26 11:43:47,711 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:47" (1/1) ... [2023-11-26 11:43:47,746 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 80 [2023-11-26 11:43:47,746 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:43:47,747 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:43:47,747 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:43:47,748 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:43:47,758 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:47" (1/1) ... [2023-11-26 11:43:47,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:47" (1/1) ... [2023-11-26 11:43:47,761 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:47" (1/1) ... [2023-11-26 11:43:47,775 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-26 11:43:47,775 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:47" (1/1) ... [2023-11-26 11:43:47,775 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:47" (1/1) ... [2023-11-26 11:43:47,782 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:47" (1/1) ... [2023-11-26 11:43:47,786 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:47" (1/1) ... [2023-11-26 11:43:47,788 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:47" (1/1) ... [2023-11-26 11:43:47,789 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:47" (1/1) ... [2023-11-26 11:43:47,793 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:43:47,794 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:43:47,794 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:43:47,794 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:43:47,795 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:47" (1/1) ... [2023-11-26 11:43:47,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:43:47,816 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f12e881-a843-4b24-9206-c39eec24f3cb/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:43:47,827 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f12e881-a843-4b24-9206-c39eec24f3cb/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:43:47,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f12e881-a843-4b24-9206-c39eec24f3cb/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:43:47,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:43:47,875 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-26 11:43:47,875 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-26 11:43:47,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 11:43:47,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:43:47,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:43:47,951 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:43:47,954 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:43:48,245 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:43:48,292 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:43:48,293 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-26 11:43:48,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:43:48 BoogieIcfgContainer [2023-11-26 11:43:48,293 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:43:48,297 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:43:48,297 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:43:48,301 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:43:48,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:43:47" (1/3) ... [2023-11-26 11:43:48,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35882eb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:43:48, skipping insertion in model container [2023-11-26 11:43:48,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:43:47" (2/3) ... [2023-11-26 11:43:48,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35882eb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:43:48, skipping insertion in model container [2023-11-26 11:43:48,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:43:48" (3/3) ... [2023-11-26 11:43:48,304 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-82.i [2023-11-26 11:43:48,326 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:43:48,326 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-26 11:43:48,400 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:43:48,408 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;@6a96c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:43:48,408 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-26 11:43:48,413 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-26 11:43:48,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-26 11:43:48,424 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:43:48,425 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:43:48,426 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:43:48,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:43:48,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1027765869, now seen corresponding path program 1 times [2023-11-26 11:43:48,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:43:48,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137963592] [2023-11-26 11:43:48,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:43:48,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:43:48,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:48,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:43:48,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:48,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 11:43:48,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:48,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 11:43:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:48,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 11:43:48,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:48,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 11:43:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:48,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 11:43:48,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:48,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 11:43:48,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:48,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 11:43:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:48,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 11:43:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:48,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-26 11:43:48,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:48,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 11:43:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:48,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:43:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:48,893 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-26 11:43:48,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:43:48,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137963592] [2023-11-26 11:43:48,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137963592] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:43:48,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:43:48,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:43:48,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761816802] [2023-11-26 11:43:48,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:43:48,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-26 11:43:48,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:43:48,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-26 11:43:48,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:43:48,940 INFO L87 Difference]: Start difference. First operand has 34 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-26 11:43:49,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:43:49,016 INFO L93 Difference]: Finished difference Result 65 states and 112 transitions. [2023-11-26 11:43:49,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-26 11:43:49,019 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 72 [2023-11-26 11:43:49,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:43:49,028 INFO L225 Difference]: With dead ends: 65 [2023-11-26 11:43:49,029 INFO L226 Difference]: Without dead ends: 32 [2023-11-26 11:43:49,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-26 11:43:49,039 INFO L413 NwaCegarLoop]: 43 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, 43 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-26 11:43:49,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-26 11:43:49,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-26 11:43:49,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-11-26 11:43:49,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-26 11:43:49,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2023-11-26 11:43:49,090 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 72 [2023-11-26 11:43:49,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:43:49,091 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2023-11-26 11:43:49,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-26 11:43:49,092 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2023-11-26 11:43:49,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-26 11:43:49,096 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:43:49,096 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:43:49,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:43:49,097 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:43:49,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:43:49,098 INFO L85 PathProgramCache]: Analyzing trace with hash 619471251, now seen corresponding path program 1 times [2023-11-26 11:43:49,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:43:49,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775623737] [2023-11-26 11:43:49,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:43:49,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:43:49,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:49,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:43:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:49,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 11:43:49,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:49,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 11:43:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:49,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 11:43:49,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:49,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 11:43:49,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:49,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 11:43:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:49,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 11:43:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:49,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 11:43:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:49,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 11:43:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:49,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-26 11:43:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:49,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 11:43:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:49,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:43:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:49,927 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-26 11:43:49,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:43:49,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775623737] [2023-11-26 11:43:49,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775623737] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:43:49,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:43:49,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:43:49,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205738587] [2023-11-26 11:43:49,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:43:49,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:43:49,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:43:49,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:43:49,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:43:49,933 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-26 11:43:50,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:43:50,057 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2023-11-26 11:43:50,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:43:50,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 72 [2023-11-26 11:43:50,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:43:50,061 INFO L225 Difference]: With dead ends: 38 [2023-11-26 11:43:50,061 INFO L226 Difference]: Without dead ends: 36 [2023-11-26 11:43:50,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:43:50,063 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 4 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:43:50,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 113 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:43:50,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-11-26 11:43:50,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2023-11-26 11:43:50,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-26 11:43:50,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2023-11-26 11:43:50,094 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 72 [2023-11-26 11:43:50,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:43:50,096 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2023-11-26 11:43:50,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-26 11:43:50,096 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2023-11-26 11:43:50,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-26 11:43:50,099 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:43:50,100 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:43:50,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 11:43:50,101 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:43:50,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:43:50,101 INFO L85 PathProgramCache]: Analyzing trace with hash 2023907769, now seen corresponding path program 1 times [2023-11-26 11:43:50,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:43:50,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648611231] [2023-11-26 11:43:50,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:43:50,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:43:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:56,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:43:56,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:56,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 11:43:56,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:56,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 11:43:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:56,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 11:43:56,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:56,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 11:43:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:56,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 11:43:56,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:56,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 11:43:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:56,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 11:43:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:56,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 11:43:56,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:56,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-26 11:43:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:56,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 11:43:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:56,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:43:56,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:56,541 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-26 11:43:56,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:43:56,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648611231] [2023-11-26 11:43:56,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648611231] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:43:56,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:43:56,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:43:56,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698927706] [2023-11-26 11:43:56,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:43:56,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:43:56,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:43:56,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:43:56,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:43:56,546 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-26 11:43:56,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:43:56,745 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2023-11-26 11:43:56,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 11:43:56,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 73 [2023-11-26 11:43:56,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:43:56,748 INFO L225 Difference]: With dead ends: 42 [2023-11-26 11:43:56,748 INFO L226 Difference]: Without dead ends: 40 [2023-11-26 11:43:56,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-26 11:43:56,750 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 15 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:43:56,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 144 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:43:56,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-11-26 11:43:56,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2023-11-26 11:43:56,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-26 11:43:56,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2023-11-26 11:43:56,759 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 73 [2023-11-26 11:43:56,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:43:56,760 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2023-11-26 11:43:56,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-26 11:43:56,760 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2023-11-26 11:43:56,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-26 11:43:56,762 INFO L187 NwaCegarLoop]: Found error trace [2023-11-26 11:43:56,762 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:43:56,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:43:56,763 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-26 11:43:56,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:43:56,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1692525012, now seen corresponding path program 1 times [2023-11-26 11:43:56,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:43:56,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479738285] [2023-11-26 11:43:56,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:43:56,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:43:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:57,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:43:57,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:57,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-26 11:43:57,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:57,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 11:43:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:57,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 11:43:57,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:57,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 11:43:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:57,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 11:43:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:57,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 11:43:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:57,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 11:43:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:57,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-26 11:43:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:57,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-26 11:43:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:57,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-26 11:43:57,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:57,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-26 11:43:57,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:43:57,163 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-26 11:43:57,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:43:57,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479738285] [2023-11-26 11:43:57,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479738285] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:43:57,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:43:57,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:43:57,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573227662] [2023-11-26 11:43:57,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:43:57,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:43:57,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:43:57,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:43:57,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:43:57,167 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-26 11:43:57,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:43:57,363 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2023-11-26 11:43:57,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 11:43:57,364 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 74 [2023-11-26 11:43:57,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-26 11:43:57,365 INFO L225 Difference]: With dead ends: 44 [2023-11-26 11:43:57,365 INFO L226 Difference]: Without dead ends: 0 [2023-11-26 11:43:57,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-11-26 11:43:57,367 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 11 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-26 11:43:57,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 176 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-26 11:43:57,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-26 11:43:57,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-26 11:43:57,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:43:57,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-26 11:43:57,369 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2023-11-26 11:43:57,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-26 11:43:57,369 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-26 11:43:57,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-26 11:43:57,370 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-26 11:43:57,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-26 11:43:57,377 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-26 11:43:57,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 11:43:57,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-26 11:43:57,402 INFO L902 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: true [2023-11-26 11:43:57,402 INFO L902 garLoopResultBuilder]: At program point L64-1(line 64) the Hoare annotation is: true [2023-11-26 11:43:57,403 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2023-11-26 11:43:57,403 INFO L902 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: true [2023-11-26 11:43:57,403 INFO L902 garLoopResultBuilder]: At program point L52-1(line 52) the Hoare annotation is: true [2023-11-26 11:43:57,403 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-26 11:43:57,403 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-26 11:43:57,404 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-26 11:43:57,404 INFO L902 garLoopResultBuilder]: At program point L77-2(lines 77 83) the Hoare annotation is: true [2023-11-26 11:43:57,404 INFO L899 garLoopResultBuilder]: For program point L77-3(lines 77 83) no Hoare annotation was computed. [2023-11-26 11:43:57,405 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 44) no Hoare annotation was computed. [2023-11-26 11:43:57,406 INFO L899 garLoopResultBuilder]: For program point L36-1(lines 32 46) no Hoare annotation was computed. [2023-11-26 11:43:57,406 INFO L899 garLoopResultBuilder]: For program point L65(lines 47 66) no Hoare annotation was computed. [2023-11-26 11:43:57,406 INFO L902 garLoopResultBuilder]: At program point L61(line 61) the Hoare annotation is: true [2023-11-26 11:43:57,406 INFO L902 garLoopResultBuilder]: At program point L61-1(line 61) the Hoare annotation is: true [2023-11-26 11:43:57,407 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-26 11:43:57,407 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2023-11-26 11:43:57,407 INFO L902 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: true [2023-11-26 11:43:57,407 INFO L902 garLoopResultBuilder]: At program point L49-1(line 49) the Hoare annotation is: true [2023-11-26 11:43:57,408 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 41) no Hoare annotation was computed. [2023-11-26 11:43:57,408 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 45) no Hoare annotation was computed. [2023-11-26 11:43:57,408 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-26 11:43:57,408 INFO L899 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2023-11-26 11:43:57,408 INFO L902 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: true [2023-11-26 11:43:57,408 INFO L902 garLoopResultBuilder]: At program point L58-1(line 58) the Hoare annotation is: true [2023-11-26 11:43:57,409 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2023-11-26 11:43:57,409 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-26 11:43:57,409 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2023-11-26 11:43:57,409 INFO L902 garLoopResultBuilder]: At program point L55(line 55) the Hoare annotation is: true [2023-11-26 11:43:57,409 INFO L902 garLoopResultBuilder]: At program point L55-1(line 55) the Hoare annotation is: true [2023-11-26 11:43:57,411 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-26 11:43:57,412 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-26 11:43:57,412 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-26 11:43:57,413 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-26 11:43:57,416 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-26 11:43:57,420 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 11:43:57,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 11:43:57 BoogieIcfgContainer [2023-11-26 11:43:57,434 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 11:43:57,434 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 11:43:57,435 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 11:43:57,435 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 11:43:57,435 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:43:48" (3/4) ... [2023-11-26 11:43:57,437 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-26 11:43:57,443 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-26 11:43:57,450 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2023-11-26 11:43:57,451 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-11-26 11:43:57,451 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-26 11:43:57,452 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-26 11:43:57,550 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f12e881-a843-4b24-9206-c39eec24f3cb/bin/uautomizer-verify-VRDe98Ueme/witness.graphml [2023-11-26 11:43:57,551 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f12e881-a843-4b24-9206-c39eec24f3cb/bin/uautomizer-verify-VRDe98Ueme/witness.yml [2023-11-26 11:43:57,551 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 11:43:57,552 INFO L158 Benchmark]: Toolchain (without parser) took 10190.74ms. Allocated memory was 132.1MB in the beginning and 281.0MB in the end (delta: 148.9MB). Free memory was 100.9MB in the beginning and 170.5MB in the end (delta: -69.6MB). Peak memory consumption was 81.1MB. Max. memory is 16.1GB. [2023-11-26 11:43:57,552 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 104.9MB. Free memory is still 65.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:43:57,553 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.74ms. Allocated memory is still 132.1MB. Free memory was 100.7MB in the beginning and 89.2MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-26 11:43:57,553 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.01ms. Allocated memory is still 132.1MB. Free memory was 89.2MB in the beginning and 86.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:43:57,553 INFO L158 Benchmark]: Boogie Preprocessor took 45.73ms. Allocated memory is still 132.1MB. Free memory was 86.9MB in the beginning and 84.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:43:57,554 INFO L158 Benchmark]: RCFGBuilder took 499.90ms. Allocated memory is still 132.1MB. Free memory was 84.4MB in the beginning and 69.3MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-26 11:43:57,554 INFO L158 Benchmark]: TraceAbstraction took 9137.23ms. Allocated memory was 132.1MB in the beginning and 281.0MB in the end (delta: 148.9MB). Free memory was 68.8MB in the beginning and 175.8MB in the end (delta: -107.0MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. [2023-11-26 11:43:57,555 INFO L158 Benchmark]: Witness Printer took 116.68ms. Allocated memory is still 281.0MB. Free memory was 175.8MB in the beginning and 170.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 11:43:57,557 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.31ms. Allocated memory is still 104.9MB. Free memory is still 65.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 328.74ms. Allocated memory is still 132.1MB. Free memory was 100.7MB in the beginning and 89.2MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.01ms. Allocated memory is still 132.1MB. Free memory was 89.2MB in the beginning and 86.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.73ms. Allocated memory is still 132.1MB. Free memory was 86.9MB in the beginning and 84.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 499.90ms. Allocated memory is still 132.1MB. Free memory was 84.4MB in the beginning and 69.3MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9137.23ms. Allocated memory was 132.1MB in the beginning and 281.0MB in the end (delta: 148.9MB). Free memory was 68.8MB in the beginning and 175.8MB in the end (delta: -107.0MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. * Witness Printer took 116.68ms. Allocated memory is still 281.0MB. Free memory was 175.8MB in the beginning and 170.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.0s, OverallIterations: 4, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 30 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 476 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 306 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 143 IncrementalHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 170 mSDtfsCounter, 143 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=0, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 37 PreInvPairs, 53 NumberOfFragments, 14 HoareAnnotationTreeSize, 37 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 14 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 291 NumberOfCodeBlocks, 291 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 287 ConstructedInterpolants, 0 QuantifiedInterpolants, 728 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 1056/1056 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 77]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-11-26 11:43:57,581 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f12e881-a843-4b24-9206-c39eec24f3cb/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE