./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/Muller_Kahan.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/Muller_Kahan.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU --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 61ce2c272542663cace3442e405f7ab093d2a72e636da199b8b44596c79af6c9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:13:25,827 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:13:25,908 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:13:25,918 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:13:25,919 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:13:25,944 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:13:25,945 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:13:25,946 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:13:25,947 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:13:25,947 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:13:25,948 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:13:25,948 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:13:25,949 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:13:25,950 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:13:25,950 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:13:25,951 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:13:25,951 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:13:25,952 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:13:25,952 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:13:25,952 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:13:25,957 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:13:25,960 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:13:25,961 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:13:25,961 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:13:25,961 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:13:25,962 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:13:25,962 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:13:25,962 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:13:25,962 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:13:25,963 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:13:25,963 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:13:25,963 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:13:25,964 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:13:25,966 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:13:25,967 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:13:25,967 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:13:25,967 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:13:25,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:13:25,968 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:13:25,968 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:13:25,968 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:13:25,970 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:13:25,970 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_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/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_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 61ce2c272542663cace3442e405f7ab093d2a72e636da199b8b44596c79af6c9 [2024-10-31 22:13:26,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:13:26,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:13:26,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:13:26,366 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:13:26,366 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:13:26,368 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/float-benchs/Muller_Kahan.c Unable to find full path for "g++" [2024-10-31 22:13:28,578 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:13:28,778 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:13:28,779 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/sv-benchmarks/c/float-benchs/Muller_Kahan.c [2024-10-31 22:13:28,787 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/data/9055196ca/6125bde811474fa49b87b085991e6468/FLAGc2aad65af [2024-10-31 22:13:29,164 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/data/9055196ca/6125bde811474fa49b87b085991e6468 [2024-10-31 22:13:29,166 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:13:29,170 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:13:29,172 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:13:29,172 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:13:29,180 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:13:29,180 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:13:29" (1/1) ... [2024-10-31 22:13:29,182 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2630d63e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:29, skipping insertion in model container [2024-10-31 22:13:29,182 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:13:29" (1/1) ... [2024-10-31 22:13:29,201 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:13:29,386 WARN L251 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_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/sv-benchmarks/c/float-benchs/Muller_Kahan.c[631,644] [2024-10-31 22:13:29,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:13:29,412 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:13:29,421 WARN L251 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_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/sv-benchmarks/c/float-benchs/Muller_Kahan.c[631,644] [2024-10-31 22:13:29,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:13:29,441 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:13:29,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:29 WrapperNode [2024-10-31 22:13:29,441 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:13:29,442 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:13:29,443 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:13:29,443 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:13:29,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:29" (1/1) ... [2024-10-31 22:13:29,457 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:29" (1/1) ... [2024-10-31 22:13:29,478 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 35 [2024-10-31 22:13:29,478 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:13:29,484 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:13:29,484 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:13:29,484 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:13:29,512 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:29" (1/1) ... [2024-10-31 22:13:29,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:29" (1/1) ... [2024-10-31 22:13:29,514 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:29" (1/1) ... [2024-10-31 22:13:29,536 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-31 22:13:29,536 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:29" (1/1) ... [2024-10-31 22:13:29,536 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:29" (1/1) ... [2024-10-31 22:13:29,544 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:29" (1/1) ... [2024-10-31 22:13:29,557 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:29" (1/1) ... [2024-10-31 22:13:29,559 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:29" (1/1) ... [2024-10-31 22:13:29,561 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:29" (1/1) ... [2024-10-31 22:13:29,563 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:13:29,567 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:13:29,572 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:13:29,572 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:13:29,573 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:29" (1/1) ... [2024-10-31 22:13:29,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:13:29,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:13:29,641 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:13:29,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:13:29,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:13:29,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:13:29,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:13:29,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:13:29,778 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:13:29,784 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:13:29,948 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-31 22:13:29,948 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:13:29,973 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:13:29,977 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:13:29,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:13:29 BoogieIcfgContainer [2024-10-31 22:13:29,978 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:13:29,981 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:13:29,985 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:13:29,992 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:13:29,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:13:29" (1/3) ... [2024-10-31 22:13:29,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a95bb45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:13:29, skipping insertion in model container [2024-10-31 22:13:29,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:29" (2/3) ... [2024-10-31 22:13:29,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a95bb45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:13:29, skipping insertion in model container [2024-10-31 22:13:29,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:13:29" (3/3) ... [2024-10-31 22:13:29,998 INFO L112 eAbstractionObserver]: Analyzing ICFG Muller_Kahan.c [2024-10-31 22:13:30,022 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:13:30,023 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:13:30,103 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:13:30,110 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7b0c8834, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:13:30,111 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:13:30,116 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 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) [2024-10-31 22:13:30,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-31 22:13:30,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:30,122 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-31 22:13:30,123 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:13:30,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:30,129 INFO L85 PathProgramCache]: Analyzing trace with hash 889605037, now seen corresponding path program 1 times [2024-10-31 22:13:30,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:30,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387793697] [2024-10-31 22:13:30,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:30,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:30,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:30,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:30,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:30,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387793697] [2024-10-31 22:13:30,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387793697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:30,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:30,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:13:30,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136490877] [2024-10-31 22:13:30,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:30,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:13:30,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:30,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:13:30,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:13:30,479 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 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) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2024-10-31 22:13:30,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:30,515 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2024-10-31 22:13:30,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:13:30,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) Word has length 6 [2024-10-31 22:13:30,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:30,556 INFO L225 Difference]: With dead ends: 22 [2024-10-31 22:13:30,557 INFO L226 Difference]: Without dead ends: 10 [2024-10-31 22:13:30,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:13:30,566 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:30,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 17 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:13:30,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-10-31 22:13:30,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-10-31 22:13:30,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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) [2024-10-31 22:13:30,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-10-31 22:13:30,637 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2024-10-31 22:13:30,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:30,638 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-10-31 22:13:30,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2024-10-31 22:13:30,638 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-10-31 22:13:30,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-31 22:13:30,640 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:30,640 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:30,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:13:30,641 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:13:30,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:30,642 INFO L85 PathProgramCache]: Analyzing trace with hash 265180975, now seen corresponding path program 1 times [2024-10-31 22:13:30,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:30,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906356585] [2024-10-31 22:13:30,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:30,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:30,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:30,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:30,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906356585] [2024-10-31 22:13:30,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906356585] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:13:30,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697534082] [2024-10-31 22:13:30,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:30,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:13:30,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:13:30,822 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:13:30,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-31 22:13:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:30,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-31 22:13:30,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:13:30,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:30,994 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:13:31,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:31,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697534082] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:13:31,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:13:31,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-31 22:13:31,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927259587] [2024-10-31 22:13:31,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:13:31,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:13:31,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:31,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:13:31,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:13:31,039 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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) [2024-10-31 22:13:31,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:31,083 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2024-10-31 22:13:31,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:13:31,084 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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) Word has length 8 [2024-10-31 22:13:31,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:31,086 INFO L225 Difference]: With dead ends: 19 [2024-10-31 22:13:31,086 INFO L226 Difference]: Without dead ends: 15 [2024-10-31 22:13:31,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:13:31,087 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:31,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 22 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:13:31,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-10-31 22:13:31,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-10-31 22:13:31,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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) [2024-10-31 22:13:31,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-10-31 22:13:31,099 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2024-10-31 22:13:31,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:31,100 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-10-31 22:13:31,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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) [2024-10-31 22:13:31,100 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-10-31 22:13:31,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-31 22:13:31,100 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:31,101 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:31,121 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-31 22:13:31,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:13:31,302 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:13:31,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:31,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1745754443, now seen corresponding path program 2 times [2024-10-31 22:13:31,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:31,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308358464] [2024-10-31 22:13:31,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:31,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:31,464 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:31,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:31,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308358464] [2024-10-31 22:13:31,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308358464] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:13:31,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596368340] [2024-10-31 22:13:31,465 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-31 22:13:31,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:13:31,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:13:31,468 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:13:31,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-31 22:13:31,529 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-31 22:13:31,529 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-31 22:13:31,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-31 22:13:31,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:13:31,586 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:31,586 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:13:31,713 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:31,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596368340] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:13:31,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:13:31,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-10-31 22:13:31,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738159339] [2024-10-31 22:13:31,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:13:31,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-31 22:13:31,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:31,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-31 22:13:31,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-31 22:13:31,720 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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) [2024-10-31 22:13:31,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:31,775 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2024-10-31 22:13:31,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-31 22:13:31,775 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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) Word has length 14 [2024-10-31 22:13:31,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:31,776 INFO L225 Difference]: With dead ends: 31 [2024-10-31 22:13:31,776 INFO L226 Difference]: Without dead ends: 27 [2024-10-31 22:13:31,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-31 22:13:31,778 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:31,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 14 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:13:31,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-31 22:13:31,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-31 22:13:31,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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) [2024-10-31 22:13:31,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2024-10-31 22:13:31,784 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 14 [2024-10-31 22:13:31,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:31,784 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2024-10-31 22:13:31,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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) [2024-10-31 22:13:31,785 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2024-10-31 22:13:31,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-31 22:13:31,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:31,786 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:31,808 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-31 22:13:31,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:13:31,987 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:13:31,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:31,987 INFO L85 PathProgramCache]: Analyzing trace with hash -95702975, now seen corresponding path program 3 times [2024-10-31 22:13:31,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:31,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104608692] [2024-10-31 22:13:31,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:31,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:32,348 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:32,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:32,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104608692] [2024-10-31 22:13:32,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104608692] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:13:32,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799181611] [2024-10-31 22:13:32,352 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-31 22:13:32,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:13:32,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:13:32,357 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:13:32,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-31 22:13:32,463 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-10-31 22:13:32,464 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-31 22:13:32,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-31 22:13:32,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:13:32,548 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:32,548 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:13:32,919 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:32,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799181611] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:13:32,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:13:32,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-10-31 22:13:32,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096888352] [2024-10-31 22:13:32,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:13:32,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-31 22:13:32,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:32,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-31 22:13:32,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-10-31 22:13:32,924 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 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) [2024-10-31 22:13:33,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:33,030 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2024-10-31 22:13:33,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-31 22:13:33,031 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 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) Word has length 26 [2024-10-31 22:13:33,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:33,032 INFO L225 Difference]: With dead ends: 55 [2024-10-31 22:13:33,032 INFO L226 Difference]: Without dead ends: 51 [2024-10-31 22:13:33,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2024-10-31 22:13:33,034 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:33,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 18 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:13:33,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-31 22:13:33,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-31 22:13:33,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 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) [2024-10-31 22:13:33,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2024-10-31 22:13:33,043 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 26 [2024-10-31 22:13:33,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:33,043 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2024-10-31 22:13:33,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 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) [2024-10-31 22:13:33,044 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2024-10-31 22:13:33,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-31 22:13:33,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:33,046 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:33,062 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-31 22:13:33,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:13:33,250 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:13:33,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:33,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1293970777, now seen corresponding path program 4 times [2024-10-31 22:13:33,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:33,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355296276] [2024-10-31 22:13:33,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:33,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:33,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:34,134 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:34,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:34,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355296276] [2024-10-31 22:13:34,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355296276] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:13:34,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877485100] [2024-10-31 22:13:34,135 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-31 22:13:34,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:13:34,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:13:34,137 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:13:34,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-31 22:13:34,226 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-31 22:13:34,226 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-31 22:13:34,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-31 22:13:34,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:13:34,358 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:34,358 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:13:35,474 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:35,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877485100] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:13:35,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:13:35,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2024-10-31 22:13:35,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837034279] [2024-10-31 22:13:35,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:13:35,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-10-31 22:13:35,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:35,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-10-31 22:13:35,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2024-10-31 22:13:35,480 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand has 49 states, 49 states have (on average 2.020408163265306) internal successors, (99), 49 states have internal predecessors, (99), 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) [2024-10-31 22:13:35,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:35,694 INFO L93 Difference]: Finished difference Result 103 states and 126 transitions. [2024-10-31 22:13:35,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-10-31 22:13:35,696 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.020408163265306) internal successors, (99), 49 states have internal predecessors, (99), 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) Word has length 50 [2024-10-31 22:13:35,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:35,697 INFO L225 Difference]: With dead ends: 103 [2024-10-31 22:13:35,697 INFO L226 Difference]: Without dead ends: 99 [2024-10-31 22:13:35,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2024-10-31 22:13:35,701 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:35,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 30 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:13:35,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-31 22:13:35,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-31 22:13:35,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.010204081632653) internal successors, (99), 98 states have internal predecessors, (99), 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) [2024-10-31 22:13:35,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2024-10-31 22:13:35,724 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 50 [2024-10-31 22:13:35,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:35,737 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2024-10-31 22:13:35,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.020408163265306) internal successors, (99), 49 states have internal predecessors, (99), 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) [2024-10-31 22:13:35,738 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2024-10-31 22:13:35,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-31 22:13:35,741 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:35,741 INFO L215 NwaCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:35,763 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-31 22:13:35,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:13:35,947 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:13:35,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:35,948 INFO L85 PathProgramCache]: Analyzing trace with hash -675115127, now seen corresponding path program 5 times [2024-10-31 22:13:35,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:35,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104781744] [2024-10-31 22:13:35,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:35,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:36,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:38,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:38,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:38,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104781744] [2024-10-31 22:13:38,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104781744] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:13:38,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801537217] [2024-10-31 22:13:38,174 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-31 22:13:38,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:13:38,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:13:38,176 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:13:38,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-31 22:13:38,368 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2024-10-31 22:13:38,368 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-31 22:13:38,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-31 22:13:38,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:13:38,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:38,619 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:13:42,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:42,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801537217] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:13:42,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:13:42,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2024-10-31 22:13:42,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528854344] [2024-10-31 22:13:42,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:13:42,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2024-10-31 22:13:42,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:42,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2024-10-31 22:13:42,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2024-10-31 22:13:42,170 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand has 97 states, 97 states have (on average 2.0103092783505154) internal successors, (195), 97 states have internal predecessors, (195), 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) [2024-10-31 22:13:42,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:42,614 INFO L93 Difference]: Finished difference Result 199 states and 246 transitions. [2024-10-31 22:13:42,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-10-31 22:13:42,615 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 2.0103092783505154) internal successors, (195), 97 states have internal predecessors, (195), 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) Word has length 98 [2024-10-31 22:13:42,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:42,617 INFO L225 Difference]: With dead ends: 199 [2024-10-31 22:13:42,617 INFO L226 Difference]: Without dead ends: 195 [2024-10-31 22:13:42,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2024-10-31 22:13:42,620 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:42,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 30 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:13:42,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-31 22:13:42,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-10-31 22:13:42,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 194 states have (on average 1.0051546391752577) internal successors, (195), 194 states have internal predecessors, (195), 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) [2024-10-31 22:13:42,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2024-10-31 22:13:42,642 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 98 [2024-10-31 22:13:42,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:42,643 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2024-10-31 22:13:42,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 2.0103092783505154) internal successors, (195), 97 states have internal predecessors, (195), 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) [2024-10-31 22:13:42,644 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2024-10-31 22:13:42,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-31 22:13:42,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:42,652 INFO L215 NwaCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:42,673 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-31 22:13:42,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-31 22:13:42,858 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:13:42,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:42,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1064733719, now seen corresponding path program 6 times [2024-10-31 22:13:42,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:42,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774667160] [2024-10-31 22:13:42,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:42,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:49,935 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:49,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:49,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774667160] [2024-10-31 22:13:49,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774667160] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:13:49,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975700732] [2024-10-31 22:13:49,936 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-31 22:13:49,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 22:13:49,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:13:49,939 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 22:13:49,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-31 22:13:50,351 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2024-10-31 22:13:50,351 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-31 22:13:50,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-10-31 22:13:50,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:13:50,764 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:50,764 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:13:55,683 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:55,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975700732] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-31 22:13:55,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-31 22:13:55,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 103 [2024-10-31 22:13:55,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022843443] [2024-10-31 22:13:55,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-31 22:13:55,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2024-10-31 22:13:55,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:55,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2024-10-31 22:13:55,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2024-10-31 22:13:55,699 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand has 103 states, 103 states have (on average 2.029126213592233) internal successors, (209), 103 states have internal predecessors, (209), 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) [2024-10-31 22:13:56,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:56,155 INFO L93 Difference]: Finished difference Result 211 states and 216 transitions. [2024-10-31 22:13:56,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2024-10-31 22:13:56,156 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 2.029126213592233) internal successors, (209), 103 states have internal predecessors, (209), 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) Word has length 194 [2024-10-31 22:13:56,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:56,159 INFO L225 Difference]: With dead ends: 211 [2024-10-31 22:13:56,159 INFO L226 Difference]: Without dead ends: 207 [2024-10-31 22:13:56,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 292 SyntacticMatches, 90 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4831 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2024-10-31 22:13:56,162 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:56,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 30 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:13:56,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-10-31 22:13:56,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2024-10-31 22:13:56,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.0048543689320388) internal successors, (207), 206 states have internal predecessors, (207), 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) [2024-10-31 22:13:56,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2024-10-31 22:13:56,192 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 194 [2024-10-31 22:13:56,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:56,192 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2024-10-31 22:13:56,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 2.029126213592233) internal successors, (209), 103 states have internal predecessors, (209), 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) [2024-10-31 22:13:56,193 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2024-10-31 22:13:56,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-31 22:13:56,196 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:56,196 INFO L215 NwaCegarLoop]: trace histogram [100, 100, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:56,219 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-31 22:13:56,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-31 22:13:56,398 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:13:56,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:56,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1785393291, now seen corresponding path program 7 times [2024-10-31 22:13:56,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:56,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743905707] [2024-10-31 22:13:56,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:56,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:13:56,514 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:13:56,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:13:56,647 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:13:56,647 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:13:56,648 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-31 22:13:56,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:13:56,654 INFO L407 BasicCegarLoop]: Path program histogram: [7, 1] [2024-10-31 22:13:56,771 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:13:56,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:13:56 BoogieIcfgContainer [2024-10-31 22:13:56,774 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:13:56,776 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:13:56,776 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:13:56,777 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:13:56,777 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:13:29" (3/4) ... [2024-10-31 22:13:56,780 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 22:13:56,781 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:13:56,782 INFO L158 Benchmark]: Toolchain (without parser) took 27614.14ms. Allocated memory was 163.6MB in the beginning and 343.9MB in the end (delta: 180.4MB). Free memory was 130.1MB in the beginning and 240.8MB in the end (delta: -110.7MB). Peak memory consumption was 72.5MB. Max. memory is 16.1GB. [2024-10-31 22:13:56,782 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 104.9MB. Free memory is still 52.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:13:56,783 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.82ms. Allocated memory is still 163.6MB. Free memory was 130.1MB in the beginning and 118.0MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-31 22:13:56,783 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.03ms. Allocated memory is still 163.6MB. Free memory was 118.0MB in the beginning and 116.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:13:56,783 INFO L158 Benchmark]: Boogie Preprocessor took 82.90ms. Allocated memory is still 163.6MB. Free memory was 116.4MB in the beginning and 114.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:13:56,784 INFO L158 Benchmark]: RCFGBuilder took 410.42ms. Allocated memory is still 163.6MB. Free memory was 114.7MB in the beginning and 105.4MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-31 22:13:56,784 INFO L158 Benchmark]: TraceAbstraction took 26793.46ms. Allocated memory was 163.6MB in the beginning and 343.9MB in the end (delta: 180.4MB). Free memory was 104.6MB in the beginning and 240.8MB in the end (delta: -136.2MB). Peak memory consumption was 47.3MB. Max. memory is 16.1GB. [2024-10-31 22:13:56,784 INFO L158 Benchmark]: Witness Printer took 5.21ms. Allocated memory is still 343.9MB. Free memory is still 240.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:13:56,787 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.35ms. Allocated memory is still 104.9MB. Free memory is still 52.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 269.82ms. Allocated memory is still 163.6MB. Free memory was 130.1MB in the beginning and 118.0MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.03ms. Allocated memory is still 163.6MB. Free memory was 118.0MB in the beginning and 116.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.90ms. Allocated memory is still 163.6MB. Free memory was 116.4MB in the beginning and 114.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 410.42ms. Allocated memory is still 163.6MB. Free memory was 114.7MB in the beginning and 105.4MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 26793.46ms. Allocated memory was 163.6MB in the beginning and 343.9MB in the end (delta: 180.4MB). Free memory was 104.6MB in the beginning and 240.8MB in the end (delta: -136.2MB). Peak memory consumption was 47.3MB. Max. memory is 16.1GB. * Witness Printer took 5.21ms. Allocated memory is still 343.9MB. Free memory is still 240.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 12]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 27, overapproximation of someBinaryArithmeticDOUBLEoperation at line 22. Possible FailurePath: [L16] double x0, x1, x2; [L17] int i; [L19] x0 = 11. / 2. [L20] x1 = 61. / 11. [L21] i = 0 VAL [i=0] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=0, x1=116] [L21] i++ VAL [i=1, x1=116] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=1, x1=126] [L21] i++ VAL [i=2, x1=126] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=2, x1=196] [L21] i++ VAL [i=3, x1=196] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=3, x1=137] [L21] i++ VAL [i=4, x1=137] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=4, x1=145] [L21] i++ VAL [i=5, x1=145] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=5, x1=149] [L21] i++ VAL [i=6, x1=149] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=6, x1=159] [L21] i++ VAL [i=7, x1=159] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=7, x1=202] [L21] i++ VAL [i=8, x1=202] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=8, x1=183] [L21] i++ VAL [i=9, x1=183] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=9, x1=204] [L21] i++ VAL [i=10, x1=204] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=10, x1=177] [L21] i++ VAL [i=11, x1=177] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=11, x1=153] [L21] i++ VAL [i=12, x1=153] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=12, x1=198] [L21] i++ VAL [i=13, x1=198] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=13, x1=134] [L21] i++ VAL [i=14, x1=134] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=14, x1=178] [L21] i++ VAL [i=15, x1=178] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=15, x1=125] [L21] i++ VAL [i=16, x1=125] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=16, x1=147] [L21] i++ VAL [i=17, x1=147] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=17, x1=169] [L21] i++ VAL [i=18, x1=169] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=18, x1=197] [L21] i++ VAL [i=19, x1=197] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=19, x1=160] [L21] i++ VAL [i=20, x1=160] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=20, x1=172] [L21] i++ VAL [i=21, x1=172] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=21, x1=155] [L21] i++ VAL [i=22, x1=155] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=22, x1=138] [L21] i++ VAL [i=23, x1=138] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=23, x1=151] [L21] i++ VAL [i=24, x1=151] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=24, x1=194] [L21] i++ VAL [i=25, x1=194] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=25, x1=168] [L21] i++ VAL [i=26, x1=168] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=26, x1=142] [L21] i++ VAL [i=27, x1=142] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=27, x1=184] [L21] i++ VAL [i=28, x1=184] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=28, x1=148] [L21] i++ VAL [i=29, x1=148] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=29, x1=119] [L21] i++ VAL [i=30, x1=119] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=30, x1=123] [L21] i++ VAL [i=31, x1=123] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=31, x1=154] [L21] i++ VAL [i=32, x1=154] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=32, x1=200] [L21] i++ VAL [i=33, x1=200] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=33, x1=140] [L21] i++ VAL [i=34, x1=140] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=34, x1=109] [L21] i++ VAL [i=35, x1=109] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=35, x1=190] [L21] i++ VAL [i=36, x1=190] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=36, x1=106] [L21] i++ VAL [i=37, x1=106] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=37, x1=179] [L21] i++ VAL [i=38, x1=179] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=38, x1=124] [L21] i++ VAL [i=39, x1=124] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=39, x1=156] [L21] i++ VAL [i=40, x1=156] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=40, x1=181] [L21] i++ VAL [i=41, x1=181] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=41, x1=115] [L21] i++ VAL [i=42, x1=115] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=42, x1=131] [L21] i++ VAL [i=43, x1=131] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=43, x1=189] [L21] i++ VAL [i=44, x1=189] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=44, x1=128] [L21] i++ VAL [i=45, x1=128] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=45, x1=121] [L21] i++ VAL [i=46, x1=121] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=46, x1=205] [L21] i++ VAL [i=47, x1=205] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=47, x1=146] [L21] i++ VAL [i=48, x1=146] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=48, x1=185] [L21] i++ VAL [i=49, x1=185] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=49, x1=150] [L21] i++ VAL [i=50, x1=150] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=50, x1=107] [L21] i++ VAL [i=51, x1=107] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=51, x1=175] [L21] i++ VAL [i=52, x1=175] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=52, x1=122] [L21] i++ VAL [i=53, x1=122] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=53, x1=193] [L21] i++ VAL [i=54, x1=193] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=54, x1=129] [L21] i++ VAL [i=55, x1=129] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=55, x1=192] [L21] i++ VAL [i=56, x1=192] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=56, x1=127] [L21] i++ VAL [i=57, x1=127] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=57, x1=139] [L21] i++ VAL [i=58, x1=139] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=58, x1=118] [L21] i++ VAL [i=59, x1=118] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=59, x1=166] [L21] i++ VAL [i=60, x1=166] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=60, x1=199] [L21] i++ VAL [i=61, x1=199] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=61, x1=158] [L21] i++ VAL [i=62, x1=158] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=62, x1=143] [L21] i++ VAL [i=63, x1=143] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=63, x1=173] [L21] i++ VAL [i=64, x1=173] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=64, x1=186] [L21] i++ VAL [i=65, x1=186] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=65, x1=191] [L21] i++ VAL [i=66, x1=191] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=66, x1=170] [L21] i++ VAL [i=67, x1=170] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=67, x1=161] [L21] i++ VAL [i=68, x1=161] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=68, x1=141] [L21] i++ VAL [i=69, x1=141] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=69, x1=133] [L21] i++ VAL [i=70, x1=133] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=70, x1=180] [L21] i++ VAL [i=71, x1=180] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=71, x1=201] [L21] i++ VAL [i=72, x1=201] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=72, x1=105] [L21] i++ VAL [i=73, x1=105] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=73, x1=152] [L21] i++ VAL [i=74, x1=152] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=74, x1=110] [L21] i++ VAL [i=75, x1=110] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=75, x1=165] [L21] i++ VAL [i=76, x1=165] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=76, x1=171] [L21] i++ VAL [i=77, x1=171] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=77, x1=176] [L21] i++ VAL [i=78, x1=176] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=78, x1=117] [L21] i++ VAL [i=79, x1=117] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=79, x1=113] [L21] i++ VAL [i=80, x1=113] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=80, x1=144] [L21] i++ VAL [i=81, x1=144] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=81, x1=203] [L21] i++ VAL [i=82, x1=203] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=82, x1=187] [L21] i++ VAL [i=83, x1=187] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=83, x1=135] [L21] i++ VAL [i=84, x1=135] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=84, x1=182] [L21] i++ VAL [i=85, x1=182] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=85, x1=114] [L21] i++ VAL [i=86, x1=114] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=86, x1=163] [L21] i++ VAL [i=87, x1=163] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=87, x1=164] [L21] i++ VAL [i=88, x1=164] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=88, x1=120] [L21] i++ VAL [i=89, x1=120] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=89, x1=132] [L21] i++ VAL [i=90, x1=132] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=90, x1=136] [L21] i++ VAL [i=91, x1=136] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=91, x1=188] [L21] i++ VAL [i=92, x1=188] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=92, x1=130] [L21] i++ VAL [i=93, x1=130] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=93, x1=111] [L21] i++ VAL [i=94, x1=111] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=94, x1=108] [L21] i++ VAL [i=95, x1=108] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=95, x1=112] [L21] i++ VAL [i=96, x1=112] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=96, x1=162] [L21] i++ VAL [i=97, x1=162] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=97, x1=195] [L21] i++ VAL [i=98, x1=195] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=98, x1=157] [L21] i++ VAL [i=99, x1=157] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=99, x1=167] [L21] i++ VAL [i=100, x1=167] [L21] COND FALSE !(i < 100) VAL [x1=167] [L27] CALL __VERIFIER_assert(x0 >= 99. && x0 <= 101.) [L12] COND TRUE !(cond) [L12] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.6s, OverallIterations: 8, TraceHistogramMax: 100, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 161 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 115 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 597 IncrementalHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 46 mSDtfsCounter, 597 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 966 GetRequests, 593 SyntacticMatches, 90 SemanticMatches, 283 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5163 ImplicationChecksByTransitivity, 15.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=207occurred in iteration=7, InterpolantAutomatonStates: 291, 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, 7 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 21.8s InterpolantComputationTime, 992 NumberOfCodeBlocks, 992 NumberOfCodeBlocksAsserted, 166 NumberOfCheckSat, 1157 ConstructedInterpolants, 0 QuantifiedInterpolants, 3319 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1425 ConjunctsInSsa, 189 ConjunctsInUnsatCore, 19 InterpolantComputations, 1 PerfectInterpolantSequences, 0/34659 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-31 22:13:56,821 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/Muller_Kahan.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU --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 61ce2c272542663cace3442e405f7ab093d2a72e636da199b8b44596c79af6c9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:13:59,415 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:13:59,517 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-31 22:13:59,527 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:13:59,528 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:13:59,583 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:13:59,584 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:13:59,585 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:13:59,586 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:13:59,587 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:13:59,587 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:13:59,588 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:13:59,590 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:13:59,594 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:13:59,594 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:13:59,595 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:13:59,596 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:13:59,596 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:13:59,596 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:13:59,597 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:13:59,597 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:13:59,598 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:13:59,598 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:13:59,598 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:13:59,600 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-31 22:13:59,601 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:13:59,601 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-31 22:13:59,601 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:13:59,603 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:13:59,604 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:13:59,604 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:13:59,604 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:13:59,605 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:13:59,606 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:13:59,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:13:59,607 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:13:59,607 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:13:59,607 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:13:59,607 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-31 22:13:59,608 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-31 22:13:59,608 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:13:59,608 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:13:59,609 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:13:59,609 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:13:59,609 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-31 22:13:59,610 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_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/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_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 61ce2c272542663cace3442e405f7ab093d2a72e636da199b8b44596c79af6c9 [2024-10-31 22:14:00,070 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:14:00,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:14:00,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:14:00,108 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:14:00,108 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:14:00,111 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a23f8ed-2fc5-47a0-994d-cd5e56b3573c/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/float-benchs/Muller_Kahan.c