./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_287349d3-c4db-498b-a420-ac43808d2a1c/bin/utaipan-WLngWcDbfI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_287349d3-c4db-498b-a420-ac43808d2a1c/bin/utaipan-WLngWcDbfI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_287349d3-c4db-498b-a420-ac43808d2a1c/bin/utaipan-WLngWcDbfI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_287349d3-c4db-498b-a420-ac43808d2a1c/bin/utaipan-WLngWcDbfI/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_287349d3-c4db-498b-a420-ac43808d2a1c/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_287349d3-c4db-498b-a420-ac43808d2a1c/bin/utaipan-WLngWcDbfI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dc63a805379d435830d30b53773a27b22aa93e78 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2021-10-11 02:23:19,296 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 02:23:19,298 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 02:23:19,344 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 02:23:19,345 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 02:23:19,346 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 02:23:19,349 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 02:23:19,353 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 02:23:19,356 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 02:23:19,358 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 02:23:19,359 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 02:23:19,361 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 02:23:19,362 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 02:23:19,364 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 02:23:19,366 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 02:23:19,368 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 02:23:19,370 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 02:23:19,371 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 02:23:19,374 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 02:23:19,378 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 02:23:19,380 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 02:23:19,383 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 02:23:19,385 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 02:23:19,386 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 02:23:19,391 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 02:23:19,392 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 02:23:19,392 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 02:23:19,394 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 02:23:19,395 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 02:23:19,396 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 02:23:19,397 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 02:23:19,398 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 02:23:19,400 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 02:23:19,401 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 02:23:19,403 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 02:23:19,404 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 02:23:19,405 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 02:23:19,406 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 02:23:19,406 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 02:23:19,408 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 02:23:19,409 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 02:23:19,410 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_287349d3-c4db-498b-a420-ac43808d2a1c/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-11 02:23:19,443 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 02:23:19,443 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 02:23:19,444 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-11 02:23:19,445 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-11 02:23:19,445 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-11 02:23:19,445 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-11 02:23:19,446 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-11 02:23:19,446 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-11 02:23:19,446 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-11 02:23:19,447 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-11 02:23:19,447 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-11 02:23:19,447 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-11 02:23:19,447 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-11 02:23:19,448 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-11 02:23:19,448 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-11 02:23:19,449 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 02:23:19,449 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 02:23:19,450 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 02:23:19,450 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 02:23:19,450 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 02:23:19,450 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-11 02:23:19,451 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-11 02:23:19,451 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-11 02:23:19,451 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-11 02:23:19,452 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 02:23:19,452 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 02:23:19,452 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 02:23:19,452 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-11 02:23:19,453 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 02:23:19,453 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-11 02:23:19,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:23:19,454 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 02:23:19,454 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-11 02:23:19,454 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-11 02:23:19,454 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-11 02:23:19,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-11 02:23:19,455 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-11 02:23:19,455 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 02:23:19,456 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-11 02:23:19,456 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_287349d3-c4db-498b-a420-ac43808d2a1c/bin/utaipan-WLngWcDbfI/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_287349d3-c4db-498b-a420-ac43808d2a1c/bin/utaipan-WLngWcDbfI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> Taipan 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 -> dc63a805379d435830d30b53773a27b22aa93e78 [2021-10-11 02:23:19,811 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 02:23:19,849 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 02:23:19,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 02:23:19,854 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 02:23:19,855 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 02:23:19,856 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_287349d3-c4db-498b-a420-ac43808d2a1c/bin/utaipan-WLngWcDbfI/../../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2021-10-11 02:23:19,935 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_287349d3-c4db-498b-a420-ac43808d2a1c/bin/utaipan-WLngWcDbfI/data/8fac67393/938d624414ce430188e84b74d30b8d78/FLAG2390e1341 [2021-10-11 02:23:20,495 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 02:23:20,500 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_287349d3-c4db-498b-a420-ac43808d2a1c/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2021-10-11 02:23:20,515 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_287349d3-c4db-498b-a420-ac43808d2a1c/bin/utaipan-WLngWcDbfI/data/8fac67393/938d624414ce430188e84b74d30b8d78/FLAG2390e1341 [2021-10-11 02:23:20,840 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_287349d3-c4db-498b-a420-ac43808d2a1c/bin/utaipan-WLngWcDbfI/data/8fac67393/938d624414ce430188e84b74d30b8d78 [2021-10-11 02:23:20,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 02:23:20,848 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 02:23:20,851 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 02:23:20,851 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 02:23:20,856 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 02:23:20,857 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:23:20" (1/1) ... [2021-10-11 02:23:20,865 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6224866e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:20, skipping insertion in model container [2021-10-11 02:23:20,865 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:23:20" (1/1) ... [2021-10-11 02:23:20,877 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 02:23:20,905 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 02:23:21,155 WARN L226 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_287349d3-c4db-498b-a420-ac43808d2a1c/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i[838,851] [2021-10-11 02:23:21,217 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:23:21,226 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 02:23:21,250 WARN L226 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_287349d3-c4db-498b-a420-ac43808d2a1c/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i[838,851] [2021-10-11 02:23:21,283 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:23:21,308 INFO L208 MainTranslator]: Completed translation [2021-10-11 02:23:21,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:21 WrapperNode [2021-10-11 02:23:21,310 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 02:23:21,311 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 02:23:21,312 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 02:23:21,312 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 02:23:21,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:21" (1/1) ... [2021-10-11 02:23:21,344 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:21" (1/1) ... [2021-10-11 02:23:21,392 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 02:23:21,396 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 02:23:21,397 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 02:23:21,398 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 02:23:21,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:21" (1/1) ... [2021-10-11 02:23:21,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:21" (1/1) ... [2021-10-11 02:23:21,427 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:21" (1/1) ... [2021-10-11 02:23:21,428 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:21" (1/1) ... [2021-10-11 02:23:21,436 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:21" (1/1) ... [2021-10-11 02:23:21,454 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:21" (1/1) ... [2021-10-11 02:23:21,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:21" (1/1) ... [2021-10-11 02:23:21,460 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 02:23:21,461 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 02:23:21,461 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 02:23:21,462 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 02:23:21,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:21" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_287349d3-c4db-498b-a420-ac43808d2a1c/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:23:21,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 02:23:21,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 02:23:21,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-11 02:23:21,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 02:23:21,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 02:23:21,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-11 02:23:21,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-11 02:23:22,324 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 02:23:22,324 INFO L299 CfgBuilder]: Removed 24 assume(true) statements. [2021-10-11 02:23:22,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:23:22 BoogieIcfgContainer [2021-10-11 02:23:22,327 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 02:23:22,359 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-11 02:23:22,359 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-11 02:23:22,363 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-11 02:23:22,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:23:20" (1/3) ... [2021-10-11 02:23:22,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b13b916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:23:22, skipping insertion in model container [2021-10-11 02:23:22,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:23:21" (2/3) ... [2021-10-11 02:23:22,365 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b13b916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:23:22, skipping insertion in model container [2021-10-11 02:23:22,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:23:22" (3/3) ... [2021-10-11 02:23:22,367 INFO L111 eAbstractionObserver]: Analyzing ICFG data_structures_set_multi_proc_trivial_ground.i [2021-10-11 02:23:22,412 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-11 02:23:22,422 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2021-10-11 02:23:22,436 INFO L253 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-10-11 02:23:22,480 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-10-11 02:23:22,481 INFO L378 AbstractCegarLoop]: Hoare is true [2021-10-11 02:23:22,481 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-10-11 02:23:22,481 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 02:23:22,482 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 02:23:22,482 INFO L382 AbstractCegarLoop]: Difference is false [2021-10-11 02:23:22,482 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 02:23:22,482 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-10-11 02:23:22,503 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2021-10-11 02:23:22,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-11 02:23:22,509 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:22,510 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-11 02:23:22,512 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:22,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:22,519 INFO L82 PathProgramCache]: Analyzing trace with hash 2054062916, now seen corresponding path program 1 times [2021-10-11 02:23:22,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:22,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966950652] [2021-10-11 02:23:22,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:22,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:22,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966950652] [2021-10-11 02:23:22,708 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:23:22,709 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 02:23:22,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587995401] [2021-10-11 02:23:22,714 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:23:22,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:22,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:23:22,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:22,734 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 3 states. [2021-10-11 02:23:22,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:22,834 INFO L93 Difference]: Finished difference Result 75 states and 113 transitions. [2021-10-11 02:23:22,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:23:22,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2021-10-11 02:23:22,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:22,847 INFO L225 Difference]: With dead ends: 75 [2021-10-11 02:23:22,847 INFO L226 Difference]: Without dead ends: 49 [2021-10-11 02:23:22,851 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:23:22,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-10-11 02:23:22,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 26. [2021-10-11 02:23:22,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2021-10-11 02:23:22,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2021-10-11 02:23:22,893 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 6 [2021-10-11 02:23:22,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:22,894 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2021-10-11 02:23:22,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:23:22,895 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2021-10-11 02:23:22,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-11 02:23:22,895 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:22,896 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:22,896 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-11 02:23:22,896 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:22,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:22,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1265048519, now seen corresponding path program 1 times [2021-10-11 02:23:22,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:22,898 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148275190] [2021-10-11 02:23:22,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:22,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:22,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148275190] [2021-10-11 02:23:22,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155667698] [2021-10-11 02:23:22,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_287349d3-c4db-498b-a420-ac43808d2a1c/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:23:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:23,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-11 02:23:23,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:23:23,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:23,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:23:23,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:23,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [406384461] [2021-10-11 02:23:23,226 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2021-10-11 02:23:23,227 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:23:23,235 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-11 02:23:23,242 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-11 02:23:23,242 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-11 02:23:24,137 INFO L180 IcfgInterpreter]: Interpretation finished [2021-10-11 02:23:24,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:23:24,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3, 3] total 8 [2021-10-11 02:23:24,280 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674855599] [2021-10-11 02:23:24,281 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:24,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:24,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:24,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2021-10-11 02:23:24,284 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand 4 states. [2021-10-11 02:23:24,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:24,380 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2021-10-11 02:23:24,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:23:24,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2021-10-11 02:23:24,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:24,389 INFO L225 Difference]: With dead ends: 49 [2021-10-11 02:23:24,389 INFO L226 Difference]: Without dead ends: 25 [2021-10-11 02:23:24,391 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2021-10-11 02:23:24,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-10-11 02:23:24,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2021-10-11 02:23:24,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2021-10-11 02:23:24,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2021-10-11 02:23:24,404 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 7 [2021-10-11 02:23:24,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:24,404 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2021-10-11 02:23:24,404 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:24,405 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2021-10-11 02:23:24,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-11 02:23:24,406 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:24,407 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:24,625 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2021-10-11 02:23:24,626 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:24,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:24,626 INFO L82 PathProgramCache]: Analyzing trace with hash -2145157739, now seen corresponding path program 1 times [2021-10-11 02:23:24,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:24,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123636389] [2021-10-11 02:23:24,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:24,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:23:24,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123636389] [2021-10-11 02:23:24,689 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125350317] [2021-10-11 02:23:24,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_287349d3-c4db-498b-a420-ac43808d2a1c/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:23:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:24,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-11 02:23:24,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:23:24,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 02:23:24,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:23:24,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 02:23:24,813 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-10-11 02:23:24,813 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [3] total 6 [2021-10-11 02:23:24,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337759093] [2021-10-11 02:23:24,814 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:23:24,814 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:24,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:23:24,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:23:24,817 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand 4 states. [2021-10-11 02:23:24,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:24,877 INFO L93 Difference]: Finished difference Result 51 states and 72 transitions. [2021-10-11 02:23:24,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:23:24,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2021-10-11 02:23:24,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:24,883 INFO L225 Difference]: With dead ends: 51 [2021-10-11 02:23:24,883 INFO L226 Difference]: Without dead ends: 34 [2021-10-11 02:23:24,884 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:23:24,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-10-11 02:23:24,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2021-10-11 02:23:24,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2021-10-11 02:23:24,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 45 transitions. [2021-10-11 02:23:24,900 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 45 transitions. Word has length 12 [2021-10-11 02:23:24,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:24,901 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 45 transitions. [2021-10-11 02:23:24,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:23:24,901 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 45 transitions. [2021-10-11 02:23:24,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-11 02:23:24,902 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:24,903 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:25,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-10-11 02:23:25,131 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:25,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:25,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1077510347, now seen corresponding path program 1 times [2021-10-11 02:23:25,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:25,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663472621] [2021-10-11 02:23:25,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:25,171 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-11 02:23:25,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663472621] [2021-10-11 02:23:25,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823922299] [2021-10-11 02:23:25,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_287349d3-c4db-498b-a420-ac43808d2a1c/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:23:25,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:25,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-11 02:23:25,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:23:25,295 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-11 02:23:25,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:23:25,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-11 02:23:25,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1375636846] [2021-10-11 02:23:25,349 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-11 02:23:25,350 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:23:25,350 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-11 02:23:25,351 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-11 02:23:25,352 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-11 02:23:26,126 INFO L180 IcfgInterpreter]: Interpretation finished [2021-10-11 02:23:26,552 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2021-10-11 02:23:26,699 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2021-10-11 02:23:26,856 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2021-10-11 02:23:26,857 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:23:26,857 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [3, 3, 3] total 13 [2021-10-11 02:23:26,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417202328] [2021-10-11 02:23:26,858 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-10-11 02:23:26,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:26,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-11 02:23:26,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2021-10-11 02:23:26,860 INFO L87 Difference]: Start difference. First operand 32 states and 45 transitions. Second operand 9 states. [2021-10-11 02:23:26,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:26,947 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2021-10-11 02:23:26,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-11 02:23:26,947 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2021-10-11 02:23:26,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:26,948 INFO L225 Difference]: With dead ends: 55 [2021-10-11 02:23:26,948 INFO L226 Difference]: Without dead ends: 31 [2021-10-11 02:23:26,949 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2021-10-11 02:23:26,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-10-11 02:23:26,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2021-10-11 02:23:26,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2021-10-11 02:23:26,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2021-10-11 02:23:26,956 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 14 [2021-10-11 02:23:26,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:26,956 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2021-10-11 02:23:26,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-10-11 02:23:26,956 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2021-10-11 02:23:26,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-11 02:23:26,957 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:23:26,957 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:23:27,171 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-10-11 02:23:27,171 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:23:27,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:23:27,172 INFO L82 PathProgramCache]: Analyzing trace with hash -469179314, now seen corresponding path program 1 times [2021-10-11 02:23:27,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:23:27,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402599435] [2021-10-11 02:23:27,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:23:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:27,207 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-11 02:23:27,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402599435] [2021-10-11 02:23:27,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298192541] [2021-10-11 02:23:27,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_287349d3-c4db-498b-a420-ac43808d2a1c/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:23:27,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:23:27,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-11 02:23:27,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:23:27,290 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-11 02:23:27,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:23:27,321 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-11 02:23:27,321 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [806956622] [2021-10-11 02:23:27,324 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2021-10-11 02:23:27,324 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:23:27,325 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-11 02:23:27,325 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-11 02:23:27,325 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-11 02:23:28,439 INFO L180 IcfgInterpreter]: Interpretation finished [2021-10-11 02:23:28,659 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 33 [2021-10-11 02:23:29,248 WARN L197 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 57 [2021-10-11 02:23:29,698 WARN L197 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 73 [2021-10-11 02:23:30,321 WARN L197 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 67 [2021-10-11 02:23:30,585 WARN L197 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2021-10-11 02:23:30,587 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:23:30,587 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [3, 3, 3] total 13 [2021-10-11 02:23:30,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480101874] [2021-10-11 02:23:30,588 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-10-11 02:23:30,588 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:23:30,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-11 02:23:30,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=98, Unknown=0, NotChecked=0, Total=182 [2021-10-11 02:23:30,589 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand 9 states. [2021-10-11 02:23:30,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:23:30,676 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2021-10-11 02:23:30,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-11 02:23:30,678 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2021-10-11 02:23:30,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:23:30,678 INFO L225 Difference]: With dead ends: 33 [2021-10-11 02:23:30,678 INFO L226 Difference]: Without dead ends: 0 [2021-10-11 02:23:30,679 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=84, Invalid=98, Unknown=0, NotChecked=0, Total=182 [2021-10-11 02:23:30,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-11 02:23:30,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-11 02:23:30,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-10-11 02:23:30,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-11 02:23:30,680 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2021-10-11 02:23:30,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:23:30,680 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 02:23:30,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-10-11 02:23:30,680 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-11 02:23:30,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-11 02:23:30,891 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:23:30,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-11 02:23:31,291 WARN L197 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2021-10-11 02:23:31,397 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 31 [2021-10-11 02:23:32,000 WARN L197 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2021-10-11 02:23:32,291 WARN L197 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 55 [2021-10-11 02:23:32,295 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2021-10-11 02:23:32,295 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-11 02:23:32,295 INFO L258 CegarLoopResult]: At program point L61-3(lines 61 65) the Hoare annotation is: (and (= |#t~string1.offset| 0) (<= 0 |#t~string0.base|) (= ULTIMATE.start_main_~n~0 0) (= |#NULL.base| 0) (= ULTIMATE.start_main_~x~0 0) (= |ULTIMATE.start_main_~#set~0.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#set~0.base|) (= |#t~string0.offset| 0) (<= 0 |#t~string1.base|) (<= 0 |#StackHeapBarrier|)) [2021-10-11 02:23:32,295 INFO L258 CegarLoopResult]: At program point L62-3(lines 62 64) the Hoare annotation is: false [2021-10-11 02:23:32,296 INFO L262 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2021-10-11 02:23:32,296 INFO L262 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2021-10-11 02:23:32,296 INFO L262 CegarLoopResult]: For program point L13-3(line 13) no Hoare annotation was computed. [2021-10-11 02:23:32,296 INFO L262 CegarLoopResult]: For program point L13-4(line 13) no Hoare annotation was computed. [2021-10-11 02:23:32,296 INFO L262 CegarLoopResult]: For program point L13-5(line 13) no Hoare annotation was computed. [2021-10-11 02:23:32,297 INFO L262 CegarLoopResult]: For program point L13-7(line 13) no Hoare annotation was computed. [2021-10-11 02:23:32,297 INFO L262 CegarLoopResult]: For program point L13-8(line 13) no Hoare annotation was computed. [2021-10-11 02:23:32,297 INFO L262 CegarLoopResult]: For program point L13-9(line 13) no Hoare annotation was computed. [2021-10-11 02:23:32,297 INFO L262 CegarLoopResult]: For program point L13-11(line 13) no Hoare annotation was computed. [2021-10-11 02:23:32,297 INFO L258 CegarLoopResult]: At program point L55-3(lines 55 59) the Hoare annotation is: (and (< ULTIMATE.start_main_~v~0 100000) (<= 0 |ULTIMATE.start_main_~#set~0.base|) (<= ULTIMATE.start_elem_exists_~set.offset 0) (<= 0 ULTIMATE.start_elem_exists_~size) (<= 0 ULTIMATE.start_main_~x~0) (<= 0 ULTIMATE.start_elem_exists_~set.offset) (= |#NULL.offset| 0) (= |ULTIMATE.start_main_~#values~0.offset| 0) (<= ULTIMATE.start_elem_exists_~size 0) (<= |ULTIMATE.start_elem_exists_#in~set.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#t~string1.offset| 0) (<= 0 |#t~string0.base|) (<= 0 |ULTIMATE.start_main_~#values~0.base|) (= |#NULL.base| 0) (= ULTIMATE.start_elem_exists_~i~0 0) (<= 0 ULTIMATE.start_main_~n~0) (<= ULTIMATE.start_main_~x~0 0) (<= 0 |ULTIMATE.start_elem_exists_#in~set.base|) (= |ULTIMATE.start_elem_exists_#res| 0) (<= |ULTIMATE.start_main_~#set~0.offset| 0) (<= 0 ULTIMATE.start_main_~v~0) (<= |ULTIMATE.start_elem_exists_#in~size| 0) (<= 0 |#t~string1.base|) (<= 0 ULTIMATE.start_elem_exists_~set.base) (<= 0 |ULTIMATE.start_elem_exists_#in~set.offset|) (<= 0 |ULTIMATE.start_elem_exists_#in~size|) (<= 0 |ULTIMATE.start_main_~#set~0.offset|) (<= ULTIMATE.start_main_~n~0 0) (= |#t~string0.offset| 0)) [2021-10-11 02:23:32,298 INFO L258 CegarLoopResult]: At program point L22-3(lines 22 24) the Hoare annotation is: (and (<= 0 |#NULL.offset|) (< ULTIMATE.start_main_~v~0 100000) (<= |#t~string1.offset| 0) (<= ULTIMATE.start_elem_exists_~set.offset 0) (<= 0 ULTIMATE.start_elem_exists_~size) (= |ULTIMATE.start_elem_exists_#in~set.base| ULTIMATE.start_elem_exists_~set.base) (<= 0 ULTIMATE.start_main_~x~0) (<= 0 |ULTIMATE.start_main_~#values~0.offset|) (<= 0 ULTIMATE.start_elem_exists_~set.offset) (<= ULTIMATE.start_elem_exists_~size 0) (<= |ULTIMATE.start_elem_exists_#in~set.offset| 0) (<= ULTIMATE.start_elem_exists_~i~0 0) (<= 0 |#StackHeapBarrier|) (<= 0 |#t~string0.base|) (<= 0 |ULTIMATE.start_main_~#values~0.base|) (= |ULTIMATE.start_elem_exists_#in~set.base| |ULTIMATE.start_main_~#set~0.base|) (<= |#NULL.base| 0) (<= 0 ULTIMATE.start_main_~n~0) (<= ULTIMATE.start_main_~x~0 0) (<= |ULTIMATE.start_main_~#set~0.offset| 0) (= |ULTIMATE.start_main_#t~mem14| (select (select |#memory_int| |ULTIMATE.start_main_~#values~0.base|) (+ (* ULTIMATE.start_main_~v~0 4) |ULTIMATE.start_main_~#values~0.offset|))) (<= 0 ULTIMATE.start_main_~v~0) (<= |ULTIMATE.start_elem_exists_#in~size| 0) (= |ULTIMATE.start_main_#t~mem14| |ULTIMATE.start_elem_exists_#in~value|) (<= 0 |#t~string1.base|) (<= 0 ULTIMATE.start_elem_exists_~i~0) (= ULTIMATE.start_elem_exists_~value |ULTIMATE.start_elem_exists_#in~value|) (<= |ULTIMATE.start_main_~#values~0.offset| 0) (<= |#t~string0.offset| 0) (<= 0 ULTIMATE.start_elem_exists_~set.base) (<= 0 |#t~string0.offset|) (<= 0 |ULTIMATE.start_elem_exists_#in~set.offset|) (<= 0 |ULTIMATE.start_elem_exists_#in~size|) (<= 0 |ULTIMATE.start_main_~#set~0.offset|) (<= 0 |#t~string1.offset|) (<= ULTIMATE.start_main_~n~0 0) (<= 0 |#NULL.base|) (<= |#NULL.offset| 0)) [2021-10-11 02:23:32,298 INFO L258 CegarLoopResult]: At program point L47-3(lines 47 50) the Hoare annotation is: (and (= |#t~string1.offset| 0) (<= 0 |#t~string0.base|) (<= 0 |ULTIMATE.start_main_~#values~0.base|) (= |#NULL.base| 0) (<= |ULTIMATE.start_main_~#set~0.offset| 0) (<= 0 |ULTIMATE.start_main_~#set~0.base|) (<= 0 ULTIMATE.start_main_~v~0) (<= 0 |#t~string1.base|) (= ULTIMATE.start_main_~n~0 0) (= ULTIMATE.start_main_~x~0 0) (<= 0 |ULTIMATE.start_main_~#set~0.offset|) (= |#NULL.offset| 0) (= |#t~string0.offset| 0) (= |ULTIMATE.start_main_~#values~0.offset| 0) (<= 0 |#StackHeapBarrier|)) [2021-10-11 02:23:32,299 INFO L258 CegarLoopResult]: At program point L39-3(lines 39 43) the Hoare annotation is: (and (= |#t~string1.offset| 0) (<= 0 |#t~string0.base|) (= ULTIMATE.start_main_~n~0 0) (= |#NULL.base| 0) (= ULTIMATE.start_main_~x~0 0) (= |ULTIMATE.start_main_~#set~0.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#set~0.base|) (= |#t~string0.offset| 0) (<= 0 |#t~string1.base|) (<= 0 |#StackHeapBarrier|)) [2021-10-11 02:23:32,299 INFO L262 CegarLoopResult]: For program point L23(line 23) no Hoare annotation was computed. [2021-10-11 02:23:32,299 INFO L258 CegarLoopResult]: At program point L56-3(lines 56 58) the Hoare annotation is: false [2021-10-11 02:23:32,299 INFO L258 CegarLoopResult]: At program point L40-3(lines 40 42) the Hoare annotation is: false [2021-10-11 02:23:32,299 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2021-10-11 02:23:32,300 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-11 02:23:32,300 INFO L258 CegarLoopResult]: At program point L33-3(lines 33 36) the Hoare annotation is: (and (<= 0 |#t~string0.base|) (= |#NULL.base| 0) (<= |ULTIMATE.start_main_~#set~0.offset| 0) (<= 0 |ULTIMATE.start_main_~#set~0.base|) (<= 0 |#t~string1.base|) (<= |#t~string1.offset| 0) (= ULTIMATE.start_main_~n~0 0) (<= 0 ULTIMATE.start_main_~x~0) (<= 0 |ULTIMATE.start_main_~#set~0.offset|) (<= 0 |#t~string1.offset|) (= |#NULL.offset| 0) (= |#t~string0.offset| 0) (<= 0 |#StackHeapBarrier|)) [2021-10-11 02:23:32,300 INFO L258 CegarLoopResult]: At program point L25(lines 20 26) the Hoare annotation is: (and (<= 0 |ULTIMATE.start_elem_exists_#in~size|) (let ((.cse0 (= ULTIMATE.start_elem_exists_~size |ULTIMATE.start_elem_exists_#in~size|)) (.cse1 (= |ULTIMATE.start_main_~#set~0.offset| 0)) (.cse2 (<= 0 |ULTIMATE.start_main_~#set~0.base|)) (.cse3 (= ULTIMATE.start_main_~x~0 0)) (.cse4 (= |ULTIMATE.start_elem_exists_#in~set.base| ULTIMATE.start_elem_exists_~set.base)) (.cse5 (= |#NULL.offset| 0)) (.cse6 (= ULTIMATE.start_main_~n~0 |ULTIMATE.start_elem_exists_#in~size|)) (.cse7 (= |ULTIMATE.start_main_~#values~0.offset| 0)) (.cse8 (<= 0 |#StackHeapBarrier|)) (.cse9 (= |#t~string1.offset| 0)) (.cse10 (<= 0 |#t~string0.base|)) (.cse11 (<= 0 |ULTIMATE.start_main_~#values~0.base|)) (.cse12 (= |ULTIMATE.start_elem_exists_#in~set.base| |ULTIMATE.start_main_~#set~0.base|)) (.cse13 (= |#NULL.base| 0)) (.cse14 (= ULTIMATE.start_elem_exists_~i~0 0)) (.cse15 (= |ULTIMATE.start_elem_exists_#res| 0)) (.cse16 (= |ULTIMATE.start_main_#t~mem14| (select (select |#memory_int| |ULTIMATE.start_main_~#values~0.base|) (+ (* ULTIMATE.start_main_~v~0 4) |ULTIMATE.start_main_~#values~0.offset|)))) (.cse17 (= |ULTIMATE.start_main_#t~mem14| |ULTIMATE.start_elem_exists_#in~value|)) (.cse18 (<= 0 |#t~string1.base|)) (.cse19 (= |ULTIMATE.start_main_~#set~0.offset| |ULTIMATE.start_elem_exists_#in~set.offset|)) (.cse20 (= |ULTIMATE.start_elem_exists_#in~set.offset| ULTIMATE.start_elem_exists_~set.offset)) (.cse21 (= ULTIMATE.start_elem_exists_~value |ULTIMATE.start_elem_exists_#in~value|)) (.cse22 (= |#t~string0.offset| 0))) (or (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_elem_exists_~size ULTIMATE.start_elem_exists_~i~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (= ULTIMATE.start_main_~v~0 0) .cse20 .cse21 .cse22) (and (< ULTIMATE.start_main_~v~0 100000) .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 ULTIMATE.start_main_~v~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~x~0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22)))) [2021-10-11 02:23:32,301 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2021-10-11 02:23:32,301 INFO L258 CegarLoopResult]: At program point L51-3(lines 51 60) the Hoare annotation is: (let ((.cse4 (= |#t~string1.offset| 0)) (.cse5 (<= 0 |#t~string0.base|)) (.cse6 (<= 0 |ULTIMATE.start_main_~#values~0.base|)) (.cse7 (= |#NULL.base| 0)) (.cse0 (<= 0 |ULTIMATE.start_main_~#set~0.base|)) (.cse8 (<= 0 |#t~string1.base|)) (.cse1 (= |#NULL.offset| 0)) (.cse9 (= |#t~string0.offset| 0)) (.cse2 (= |ULTIMATE.start_main_~#values~0.offset| 0)) (.cse3 (<= 0 |#StackHeapBarrier|))) (or (and .cse0 (<= ULTIMATE.start_elem_exists_~set.offset 0) (<= 0 ULTIMATE.start_elem_exists_~size) (<= 0 ULTIMATE.start_main_~x~0) (<= 0 ULTIMATE.start_elem_exists_~set.offset) .cse1 .cse2 (<= ULTIMATE.start_elem_exists_~size 0) (<= |ULTIMATE.start_elem_exists_#in~set.offset| 0) .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_elem_exists_~i~0 0) (<= 0 ULTIMATE.start_main_~n~0) (<= ULTIMATE.start_main_~x~0 0) (<= 0 |ULTIMATE.start_elem_exists_#in~set.base|) (= |ULTIMATE.start_elem_exists_#res| 0) (<= |ULTIMATE.start_main_~#set~0.offset| 0) (<= 0 ULTIMATE.start_main_~v~0) (<= |ULTIMATE.start_elem_exists_#in~size| 0) .cse8 (<= 0 ULTIMATE.start_elem_exists_~set.base) (<= 0 |ULTIMATE.start_elem_exists_#in~set.offset|) (<= 0 |ULTIMATE.start_elem_exists_#in~size|) (<= 0 |ULTIMATE.start_main_~#set~0.offset|) (<= ULTIMATE.start_main_~n~0 0) .cse9) (and .cse4 .cse5 .cse6 .cse7 (= |ULTIMATE.start_main_~#set~0.offset| 0) .cse0 .cse8 (= ULTIMATE.start_main_~v~0 0) (= ULTIMATE.start_main_~n~0 0) (= ULTIMATE.start_main_~x~0 0) .cse1 .cse9 .cse2 .cse3))) [2021-10-11 02:23:32,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:23:32 BoogieIcfgContainer [2021-10-11 02:23:32,344 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-11 02:23:32,344 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 02:23:32,345 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 02:23:32,345 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 02:23:32,345 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:23:22" (3/4) ... [2021-10-11 02:23:32,349 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-11 02:23:32,365 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2021-10-11 02:23:32,367 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2021-10-11 02:23:32,367 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-10-11 02:23:32,368 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-11 02:23:32,399 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((0 <= set && set <= 0) && 0 <= size) && 0 <= x) && 0 <= set) && #NULL == 0) && values == 0) && size <= 0) && set <= 0) && 0 <= unknown-#StackHeapBarrier-unknown) && "data_structures_set_multi_proc_trivial_ground.c" == 0) && 0 <= "0") && 0 <= values) && #NULL == 0) && i == 0) && 0 <= n) && x <= 0) && 0 <= set) && \result == 0) && set <= 0) && 0 <= v) && \old(size) <= 0) && 0 <= "data_structures_set_multi_proc_trivial_ground.c") && 0 <= set) && 0 <= set) && 0 <= \old(size)) && 0 <= set) && n <= 0) && "0" == 0) || ((((((((((((("data_structures_set_multi_proc_trivial_ground.c" == 0 && 0 <= "0") && 0 <= values) && #NULL == 0) && set == 0) && 0 <= set) && 0 <= "data_structures_set_multi_proc_trivial_ground.c") && v == 0) && n == 0) && x == 0) && #NULL == 0) && "0" == 0) && values == 0) && 0 <= unknown-#StackHeapBarrier-unknown) [2021-10-11 02:23:32,401 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((0 <= #NULL && v < 100000) && "data_structures_set_multi_proc_trivial_ground.c" <= 0) && set <= 0) && 0 <= size) && set == set) && 0 <= x) && 0 <= values) && 0 <= set) && size <= 0) && set <= 0) && i <= 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= "0") && 0 <= values) && set == set) && #NULL <= 0) && 0 <= n) && x <= 0) && set <= 0) && aux-values[ v ]-aux == unknown-#memory_int-unknown[values][v * 4 + values]) && 0 <= v) && \old(size) <= 0) && aux-values[ v ]-aux == \old(value)) && 0 <= "data_structures_set_multi_proc_trivial_ground.c") && 0 <= i) && value == \old(value)) && values <= 0) && "0" <= 0) && 0 <= set) && 0 <= "0") && 0 <= set) && 0 <= \old(size)) && 0 <= set) && 0 <= "data_structures_set_multi_proc_trivial_ground.c") && n <= 0) && 0 <= #NULL) && #NULL <= 0 [2021-10-11 02:23:32,401 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: 0 <= \old(size) && (((((((((((((((((((((((((size == \old(size) && set == 0) && 0 <= set) && size <= i) && x == 0) && set == set) && #NULL == 0) && n == \old(size)) && values == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && "data_structures_set_multi_proc_trivial_ground.c" == 0) && 0 <= "0") && 0 <= values) && set == set) && #NULL == 0) && i == 0) && \result == 0) && aux-values[ v ]-aux == unknown-#memory_int-unknown[values][v * 4 + values]) && aux-values[ v ]-aux == \old(value)) && 0 <= "data_structures_set_multi_proc_trivial_ground.c") && set == set) && v == 0) && set == set) && value == \old(value)) && "0" == 0) || (((((((((((((((((((((((((v < 100000 && size == \old(size)) && set == 0) && 0 <= set) && x == 0) && set == set) && 1 <= v) && #NULL == 0) && n == \old(size)) && values == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && "data_structures_set_multi_proc_trivial_ground.c" == 0) && 0 <= "0") && n <= x) && 0 <= values) && set == set) && #NULL == 0) && i == 0) && \result == 0) && aux-values[ v ]-aux == unknown-#memory_int-unknown[values][v * 4 + values]) && aux-values[ v ]-aux == \old(value)) && 0 <= "data_structures_set_multi_proc_trivial_ground.c") && set == set) && set == set) && value == \old(value)) && "0" == 0)) [2021-10-11 02:23:32,403 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((v < 100000 && 0 <= set) && set <= 0) && 0 <= size) && 0 <= x) && 0 <= set) && #NULL == 0) && values == 0) && size <= 0) && set <= 0) && 0 <= unknown-#StackHeapBarrier-unknown) && "data_structures_set_multi_proc_trivial_ground.c" == 0) && 0 <= "0") && 0 <= values) && #NULL == 0) && i == 0) && 0 <= n) && x <= 0) && 0 <= set) && \result == 0) && set <= 0) && 0 <= v) && \old(size) <= 0) && 0 <= "data_structures_set_multi_proc_trivial_ground.c") && 0 <= set) && 0 <= set) && 0 <= \old(size)) && 0 <= set) && n <= 0) && "0" == 0 [2021-10-11 02:23:32,448 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_287349d3-c4db-498b-a420-ac43808d2a1c/bin/utaipan-WLngWcDbfI/witness.graphml [2021-10-11 02:23:32,448 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 02:23:32,452 INFO L168 Benchmark]: Toolchain (without parser) took 11601.28 ms. Allocated memory was 111.1 MB in the beginning and 180.4 MB in the end (delta: 69.2 MB). Free memory was 72.2 MB in the beginning and 59.1 MB in the end (delta: 13.1 MB). Peak memory consumption was 82.2 MB. Max. memory is 16.1 GB. [2021-10-11 02:23:32,457 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 111.1 MB. Free memory is still 88.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:23:32,458 INFO L168 Benchmark]: CACSL2BoogieTranslator took 459.33 ms. Allocated memory is still 111.1 MB. Free memory was 72.0 MB in the beginning and 85.8 MB in the end (delta: -13.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-11 02:23:32,458 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.20 ms. Allocated memory is still 111.1 MB. Free memory was 85.8 MB in the beginning and 84.0 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:23:32,459 INFO L168 Benchmark]: Boogie Preprocessor took 63.83 ms. Allocated memory is still 111.1 MB. Free memory was 84.0 MB in the beginning and 82.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:23:32,459 INFO L168 Benchmark]: RCFGBuilder took 866.00 ms. Allocated memory is still 111.1 MB. Free memory was 82.3 MB in the beginning and 42.1 MB in the end (delta: 40.2 MB). Peak memory consumption was 39.8 MB. Max. memory is 16.1 GB. [2021-10-11 02:23:32,460 INFO L168 Benchmark]: TraceAbstraction took 9984.95 ms. Allocated memory was 111.1 MB in the beginning and 180.4 MB in the end (delta: 69.2 MB). Free memory was 87.3 MB in the beginning and 63.3 MB in the end (delta: 24.1 MB). Peak memory consumption was 108.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:23:32,461 INFO L168 Benchmark]: Witness Printer took 104.16 ms. Allocated memory is still 180.4 MB. Free memory was 63.3 MB in the beginning and 59.1 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-11 02:23:32,464 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36 ms. Allocated memory is still 111.1 MB. Free memory is still 88.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 459.33 ms. Allocated memory is still 111.1 MB. Free memory was 72.0 MB in the beginning and 85.8 MB in the end (delta: -13.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 83.20 ms. Allocated memory is still 111.1 MB. Free memory was 85.8 MB in the beginning and 84.0 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 63.83 ms. Allocated memory is still 111.1 MB. Free memory was 84.0 MB in the beginning and 82.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 866.00 ms. Allocated memory is still 111.1 MB. Free memory was 82.3 MB in the beginning and 42.1 MB in the end (delta: 40.2 MB). Peak memory consumption was 39.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 9984.95 ms. Allocated memory was 111.1 MB in the beginning and 180.4 MB in the end (delta: 69.2 MB). Free memory was 87.3 MB in the beginning and 63.3 MB in the end (delta: 24.1 MB). Peak memory consumption was 108.1 MB. Max. memory is 16.1 GB. * Witness Printer took 104.16 ms. Allocated memory is still 180.4 MB. Free memory was 63.3 MB in the beginning and 59.1 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 13]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 13]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: ((((((((("data_structures_set_multi_proc_trivial_ground.c" == 0 && 0 <= "0") && n == 0) && #NULL == 0) && x == 0) && set == 0) && #NULL == 0) && 0 <= set) && "0" == 0) && 0 <= "data_structures_set_multi_proc_trivial_ground.c") && 0 <= unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((0 <= set && set <= 0) && 0 <= size) && 0 <= x) && 0 <= set) && #NULL == 0) && values == 0) && size <= 0) && set <= 0) && 0 <= unknown-#StackHeapBarrier-unknown) && "data_structures_set_multi_proc_trivial_ground.c" == 0) && 0 <= "0") && 0 <= values) && #NULL == 0) && i == 0) && 0 <= n) && x <= 0) && 0 <= set) && \result == 0) && set <= 0) && 0 <= v) && \old(size) <= 0) && 0 <= "data_structures_set_multi_proc_trivial_ground.c") && 0 <= set) && 0 <= set) && 0 <= \old(size)) && 0 <= set) && n <= 0) && "0" == 0) || ((((((((((((("data_structures_set_multi_proc_trivial_ground.c" == 0 && 0 <= "0") && 0 <= values) && #NULL == 0) && set == 0) && 0 <= set) && 0 <= "data_structures_set_multi_proc_trivial_ground.c") && v == 0) && n == 0) && x == 0) && #NULL == 0) && "0" == 0) && values == 0) && 0 <= unknown-#StackHeapBarrier-unknown) - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((((((((((((("data_structures_set_multi_proc_trivial_ground.c" == 0 && 0 <= "0") && 0 <= values) && #NULL == 0) && set <= 0) && 0 <= set) && 0 <= v) && 0 <= "data_structures_set_multi_proc_trivial_ground.c") && n == 0) && x == 0) && 0 <= set) && #NULL == 0) && "0" == 0) && values == 0) && 0 <= unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((0 <= #NULL && v < 100000) && "data_structures_set_multi_proc_trivial_ground.c" <= 0) && set <= 0) && 0 <= size) && set == set) && 0 <= x) && 0 <= values) && 0 <= set) && size <= 0) && set <= 0) && i <= 0) && 0 <= unknown-#StackHeapBarrier-unknown) && 0 <= "0") && 0 <= values) && set == set) && #NULL <= 0) && 0 <= n) && x <= 0) && set <= 0) && aux-values[ v ]-aux == unknown-#memory_int-unknown[values][v * 4 + values]) && 0 <= v) && \old(size) <= 0) && aux-values[ v ]-aux == \old(value)) && 0 <= "data_structures_set_multi_proc_trivial_ground.c") && 0 <= i) && value == \old(value)) && values <= 0) && "0" <= 0) && 0 <= set) && 0 <= "0") && 0 <= set) && 0 <= \old(size)) && 0 <= set) && 0 <= "data_structures_set_multi_proc_trivial_ground.c") && n <= 0) && 0 <= #NULL) && #NULL <= 0 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((((((((0 <= "0" && #NULL == 0) && set <= 0) && 0 <= set) && 0 <= "data_structures_set_multi_proc_trivial_ground.c") && "data_structures_set_multi_proc_trivial_ground.c" <= 0) && n == 0) && 0 <= x) && 0 <= set) && 0 <= "data_structures_set_multi_proc_trivial_ground.c") && #NULL == 0) && "0" == 0) && 0 <= unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 0 <= \old(size) && (((((((((((((((((((((((((size == \old(size) && set == 0) && 0 <= set) && size <= i) && x == 0) && set == set) && #NULL == 0) && n == \old(size)) && values == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && "data_structures_set_multi_proc_trivial_ground.c" == 0) && 0 <= "0") && 0 <= values) && set == set) && #NULL == 0) && i == 0) && \result == 0) && aux-values[ v ]-aux == unknown-#memory_int-unknown[values][v * 4 + values]) && aux-values[ v ]-aux == \old(value)) && 0 <= "data_structures_set_multi_proc_trivial_ground.c") && set == set) && v == 0) && set == set) && value == \old(value)) && "0" == 0) || (((((((((((((((((((((((((v < 100000 && size == \old(size)) && set == 0) && 0 <= set) && x == 0) && set == set) && 1 <= v) && #NULL == 0) && n == \old(size)) && values == 0) && 0 <= unknown-#StackHeapBarrier-unknown) && "data_structures_set_multi_proc_trivial_ground.c" == 0) && 0 <= "0") && n <= x) && 0 <= values) && set == set) && #NULL == 0) && i == 0) && \result == 0) && aux-values[ v ]-aux == unknown-#memory_int-unknown[values][v * 4 + values]) && aux-values[ v ]-aux == \old(value)) && 0 <= "data_structures_set_multi_proc_trivial_ground.c") && set == set) && set == set) && value == \old(value)) && "0" == 0)) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: ((((((((("data_structures_set_multi_proc_trivial_ground.c" == 0 && 0 <= "0") && n == 0) && #NULL == 0) && x == 0) && set == 0) && #NULL == 0) && 0 <= set) && "0" == 0) && 0 <= "data_structures_set_multi_proc_trivial_ground.c") && 0 <= unknown-#StackHeapBarrier-unknown - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((v < 100000 && 0 <= set) && set <= 0) && 0 <= size) && 0 <= x) && 0 <= set) && #NULL == 0) && values == 0) && size <= 0) && set <= 0) && 0 <= unknown-#StackHeapBarrier-unknown) && "data_structures_set_multi_proc_trivial_ground.c" == 0) && 0 <= "0") && 0 <= values) && #NULL == 0) && i == 0) && 0 <= n) && x <= 0) && 0 <= set) && \result == 0) && set <= 0) && 0 <= v) && \old(size) <= 0) && 0 <= "data_structures_set_multi_proc_trivial_ground.c") && 0 <= set) && 0 <= set) && 0 <= \old(size)) && 0 <= set) && n <= 0) && "0" == 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 26 locations, 3 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 8.4s, OverallIterations: 5, TraceHistogramMax: 2, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 90 SDtfs, 115 SDslu, 67 SDs, 0 SdLazy, 111 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 31 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 11 PreInvPairs, 27 NumberOfFragments, 679 HoareAnnotationTreeSize, 11 FomulaSimplifications, 768 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 517 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 108 NumberOfCodeBlocks, 108 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 146 ConstructedInterpolants, 0 QuantifiedInterpolants, 2400 SizeOfPredicates, 0 NumberOfNonLiveVariables, 421 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 32/42 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: OVERALL_TIME[ms]: 2804, ICFG_INTERPRETER_ENTERED_PROCEDURES: 3, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 24, DAG_INTERPRETER_EARLY_EXITS: 3, TOOLS_POST_APPLICATIONS: 49, TOOLS_POST_TIME[ms]: 1667, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME[ms]: 0, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME[ms]: 0, TOOLS_QUANTIFIERELIM_APPLICATIONS: 49, TOOLS_QUANTIFIERELIM_TIME[ms]: 1641, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 247, FLUID_QUERY_TIME[ms]: 6, FLUID_QUERIES: 113, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 3, DOMAIN_JOIN_TIME[ms]: 210, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 12, DOMAIN_WIDEN_TIME[ms]: 748, DOMAIN_ISSUBSETEQ_APPLICATIONS: 18, DOMAIN_ISSUBSETEQ_TIME[ms]: 51, DOMAIN_ISBOTTOM_APPLICATIONS: 24, DOMAIN_ISBOTTOM_TIME[ms]: 26, LOOP_SUMMARIZER_APPLICATIONS: 6, LOOP_SUMMARIZER_CACHE_MISSES: 6, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 1974, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 1974, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 18, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME[ms]: 0, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 0, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 4, PATH_EXPR_TIME[ms]: 5, REGEX_TO_DAG_TIME[ms]: 7, DAG_COMPRESSION_TIME[ms]: 26, DAG_COMPRESSION_PROCESSED_NODES: 313, DAG_COMPRESSION_RETAINED_NODES: 95, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...