./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/xcsp/AllInterval-005.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57a0686b-58c0-4156-ab99-f152ed843bd5/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57a0686b-58c0-4156-ab99-f152ed843bd5/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57a0686b-58c0-4156-ab99-f152ed843bd5/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57a0686b-58c0-4156-ab99-f152ed843bd5/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/xcsp/AllInterval-005.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57a0686b-58c0-4156-ab99-f152ed843bd5/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57a0686b-58c0-4156-ab99-f152ed843bd5/bin/uautomizer-DrprNOufMa --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a9f3ee9eee9186ec2e7139b6da07915cfbf3926b7d28b3dac4ebf3fd8205beb2 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 19:44:28,372 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 19:44:28,374 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 19:44:28,404 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 19:44:28,404 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 19:44:28,406 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 19:44:28,407 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 19:44:28,409 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 19:44:28,411 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 19:44:28,412 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 19:44:28,413 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 19:44:28,415 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 19:44:28,415 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 19:44:28,416 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 19:44:28,418 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 19:44:28,419 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 19:44:28,420 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 19:44:28,421 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 19:44:28,423 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 19:44:28,425 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 19:44:28,427 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 19:44:28,429 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 19:44:28,430 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 19:44:28,431 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 19:44:28,434 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 19:44:28,435 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 19:44:28,435 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 19:44:28,436 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 19:44:28,437 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 19:44:28,438 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 19:44:28,438 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 19:44:28,439 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 19:44:28,440 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 19:44:28,441 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 19:44:28,442 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 19:44:28,442 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 19:44:28,443 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 19:44:28,443 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 19:44:28,443 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 19:44:28,444 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 19:44:28,445 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 19:44:28,445 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57a0686b-58c0-4156-ab99-f152ed843bd5/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 19:44:28,469 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 19:44:28,469 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 19:44:28,469 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 19:44:28,469 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 19:44:28,470 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 19:44:28,470 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 19:44:28,471 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 19:44:28,471 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 19:44:28,471 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 19:44:28,471 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 19:44:28,472 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 19:44:28,472 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 19:44:28,472 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 19:44:28,472 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 19:44:28,472 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 19:44:28,472 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 19:44:28,473 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 19:44:28,473 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 19:44:28,473 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 19:44:28,473 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 19:44:28,473 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 19:44:28,474 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 19:44:28,474 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 19:44:28,474 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 19:44:28,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 19:44:28,474 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 19:44:28,475 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 19:44:28,475 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 19:44:28,475 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 19:44:28,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 19:44:28,475 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 19:44:28,475 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 19:44:28,476 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 19:44:28,476 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 19:44:28,476 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_57a0686b-58c0-4156-ab99-f152ed843bd5/bin/uautomizer-DrprNOufMa/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_57a0686b-58c0-4156-ab99-f152ed843bd5/bin/uautomizer-DrprNOufMa 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 -> 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 -> a9f3ee9eee9186ec2e7139b6da07915cfbf3926b7d28b3dac4ebf3fd8205beb2 [2021-12-06 19:44:28,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 19:44:28,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 19:44:28,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 19:44:28,688 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 19:44:28,688 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 19:44:28,689 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57a0686b-58c0-4156-ab99-f152ed843bd5/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/xcsp/AllInterval-005.c [2021-12-06 19:44:28,738 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57a0686b-58c0-4156-ab99-f152ed843bd5/bin/uautomizer-DrprNOufMa/data/258075435/23ed16af905141b2823b6f9809903a89/FLAG5fe4c4d8a [2021-12-06 19:44:29,104 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 19:44:29,104 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57a0686b-58c0-4156-ab99-f152ed843bd5/sv-benchmarks/c/xcsp/AllInterval-005.c [2021-12-06 19:44:29,109 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57a0686b-58c0-4156-ab99-f152ed843bd5/bin/uautomizer-DrprNOufMa/data/258075435/23ed16af905141b2823b6f9809903a89/FLAG5fe4c4d8a [2021-12-06 19:44:29,120 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57a0686b-58c0-4156-ab99-f152ed843bd5/bin/uautomizer-DrprNOufMa/data/258075435/23ed16af905141b2823b6f9809903a89 [2021-12-06 19:44:29,122 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 19:44:29,124 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 19:44:29,125 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 19:44:29,125 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 19:44:29,128 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 19:44:29,129 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:44:29" (1/1) ... [2021-12-06 19:44:29,130 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c750957 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:44:29, skipping insertion in model container [2021-12-06 19:44:29,130 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:44:29" (1/1) ... [2021-12-06 19:44:29,135 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 19:44:29,150 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 19:44:29,285 WARN L230 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_57a0686b-58c0-4156-ab99-f152ed843bd5/sv-benchmarks/c/xcsp/AllInterval-005.c[2566,2579] [2021-12-06 19:44:29,288 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 19:44:29,296 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 19:44:29,315 WARN L230 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_57a0686b-58c0-4156-ab99-f152ed843bd5/sv-benchmarks/c/xcsp/AllInterval-005.c[2566,2579] [2021-12-06 19:44:29,316 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 19:44:29,327 INFO L208 MainTranslator]: Completed translation [2021-12-06 19:44:29,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:44:29 WrapperNode [2021-12-06 19:44:29,327 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 19:44:29,328 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 19:44:29,328 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 19:44:29,328 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 19:44:29,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:44:29" (1/1) ... [2021-12-06 19:44:29,339 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:44:29" (1/1) ... [2021-12-06 19:44:29,362 INFO L137 Inliner]: procedures = 13, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 116 [2021-12-06 19:44:29,363 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 19:44:29,363 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 19:44:29,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 19:44:29,364 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 19:44:29,371 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:44:29" (1/1) ... [2021-12-06 19:44:29,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:44:29" (1/1) ... [2021-12-06 19:44:29,374 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:44:29" (1/1) ... [2021-12-06 19:44:29,374 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:44:29" (1/1) ... [2021-12-06 19:44:29,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:44:29" (1/1) ... [2021-12-06 19:44:29,380 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:44:29" (1/1) ... [2021-12-06 19:44:29,381 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:44:29" (1/1) ... [2021-12-06 19:44:29,384 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 19:44:29,384 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 19:44:29,385 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 19:44:29,385 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 19:44:29,386 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:44:29" (1/1) ... [2021-12-06 19:44:29,393 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 19:44:29,403 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57a0686b-58c0-4156-ab99-f152ed843bd5/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:44:29,412 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57a0686b-58c0-4156-ab99-f152ed843bd5/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 19:44:29,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57a0686b-58c0-4156-ab99-f152ed843bd5/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 19:44:29,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 19:44:29,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 19:44:29,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 19:44:29,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 19:44:29,441 INFO L130 BoogieDeclarations]: Found specification of procedure assume [2021-12-06 19:44:29,441 INFO L138 BoogieDeclarations]: Found implementation of procedure assume [2021-12-06 19:44:29,492 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 19:44:29,494 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 19:44:29,631 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 19:44:29,636 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 19:44:29,637 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-06 19:44:29,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:44:29 BoogieIcfgContainer [2021-12-06 19:44:29,638 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 19:44:29,639 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 19:44:29,640 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 19:44:29,642 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 19:44:29,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:44:29" (1/3) ... [2021-12-06 19:44:29,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37cdb4d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:44:29, skipping insertion in model container [2021-12-06 19:44:29,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:44:29" (2/3) ... [2021-12-06 19:44:29,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37cdb4d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:44:29, skipping insertion in model container [2021-12-06 19:44:29,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:44:29" (3/3) ... [2021-12-06 19:44:29,645 INFO L111 eAbstractionObserver]: Analyzing ICFG AllInterval-005.c [2021-12-06 19:44:29,651 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 19:44:29,652 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-06 19:44:29,694 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 19:44:29,699 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-06 19:44:29,699 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-06 19:44:29,713 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2021-12-06 19:44:29,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2021-12-06 19:44:29,729 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:44:29,729 INFO L514 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:44:29,730 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:44:29,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:44:29,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1769002494, now seen corresponding path program 1 times [2021-12-06 19:44:29,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:44:29,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771978523] [2021-12-06 19:44:29,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:44:29,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:44:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:29,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:44:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:29,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-06 19:44:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:29,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 19:44:29,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:29,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 19:44:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:29,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 19:44:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:29,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-06 19:44:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:29,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 19:44:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:29,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 19:44:29,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:29,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-06 19:44:29,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:29,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 19:44:29,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:29,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-06 19:44:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:29,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-06 19:44:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:29,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-06 19:44:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:29,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 19:44:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:29,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-06 19:44:29,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:29,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-06 19:44:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:29,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 19:44:29,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:29,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-06 19:44:30,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:30,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-06 19:44:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:30,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-06 19:44:30,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:30,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-06 19:44:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:30,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-06 19:44:30,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:30,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-06 19:44:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:30,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-12-06 19:44:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:30,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-12-06 19:44:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:30,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-06 19:44:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:30,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-06 19:44:30,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:30,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-06 19:44:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:30,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-12-06 19:44:30,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:30,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-06 19:44:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:30,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-06 19:44:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:30,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-12-06 19:44:30,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:30,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-12-06 19:44:30,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:30,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-12-06 19:44:30,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:30,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2021-12-06 19:44:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:30,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-12-06 19:44:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:30,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-12-06 19:44:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:30,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-06 19:44:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:30,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2021-12-06 19:44:30,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:44:30,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771978523] [2021-12-06 19:44:30,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771978523] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 19:44:30,120 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 19:44:30,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 19:44:30,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850991648] [2021-12-06 19:44:30,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 19:44:30,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-06 19:44:30,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:44:30,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-06 19:44:30,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-06 19:44:30,151 INFO L87 Difference]: Start difference. First operand has 70 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) [2021-12-06 19:44:30,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:44:30,177 INFO L93 Difference]: Finished difference Result 134 states and 254 transitions. [2021-12-06 19:44:30,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-06 19:44:30,179 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) Word has length 214 [2021-12-06 19:44:30,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:44:30,185 INFO L225 Difference]: With dead ends: 134 [2021-12-06 19:44:30,185 INFO L226 Difference]: Without dead ends: 67 [2021-12-06 19:44:30,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-06 19:44:30,191 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:44:30,192 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 19:44:30,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-12-06 19:44:30,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2021-12-06 19:44:30,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 38 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2021-12-06 19:44:30,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 107 transitions. [2021-12-06 19:44:30,231 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 107 transitions. Word has length 214 [2021-12-06 19:44:30,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:44:30,231 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 107 transitions. [2021-12-06 19:44:30,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (38), 1 states have call predecessors, (38), 1 states have return successors, (38), 1 states have call predecessors, (38), 2 states have call successors, (38) [2021-12-06 19:44:30,231 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 107 transitions. [2021-12-06 19:44:30,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2021-12-06 19:44:30,235 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:44:30,235 INFO L514 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:44:30,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 19:44:30,236 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:44:30,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:44:30,236 INFO L85 PathProgramCache]: Analyzing trace with hash 829123638, now seen corresponding path program 1 times [2021-12-06 19:44:30,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:44:30,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548730726] [2021-12-06 19:44:30,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:44:30,237 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:44:30,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:31,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:44:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:31,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-06 19:44:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:31,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 19:44:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:31,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 19:44:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:31,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 19:44:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:31,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-06 19:44:31,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:31,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 19:44:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:31,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 19:44:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:31,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-06 19:44:31,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:31,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 19:44:31,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:31,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-06 19:44:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:31,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-06 19:44:31,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:31,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-06 19:44:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:31,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 19:44:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:31,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-06 19:44:31,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:31,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-06 19:44:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:31,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 19:44:31,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:31,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-06 19:44:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:31,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-06 19:44:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:31,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-06 19:44:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:31,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-06 19:44:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:31,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-06 19:44:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:31,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-06 19:44:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:31,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-12-06 19:44:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:31,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-12-06 19:44:31,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:31,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-06 19:44:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:31,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-06 19:44:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:31,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-06 19:44:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:31,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-12-06 19:44:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:31,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-06 19:44:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:31,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-06 19:44:31,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:31,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-12-06 19:44:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:31,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-12-06 19:44:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:31,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-12-06 19:44:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:31,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2021-12-06 19:44:31,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:31,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-12-06 19:44:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:31,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-12-06 19:44:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:31,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-06 19:44:31,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:31,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 483 proven. 357 refuted. 0 times theorem prover too weak. 1972 trivial. 0 not checked. [2021-12-06 19:44:31,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:44:31,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548730726] [2021-12-06 19:44:31,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548730726] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:44:31,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563490950] [2021-12-06 19:44:31,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:44:31,294 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:44:31,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57a0686b-58c0-4156-ab99-f152ed843bd5/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:44:31,296 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57a0686b-58c0-4156-ab99-f152ed843bd5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:44:31,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57a0686b-58c0-4156-ab99-f152ed843bd5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 19:44:31,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:31,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 67 conjunts are in the unsatisfiable core [2021-12-06 19:44:31,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:44:32,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 528 proven. 363 refuted. 0 times theorem prover too weak. 1921 trivial. 0 not checked. [2021-12-06 19:44:32,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:44:33,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 528 proven. 363 refuted. 0 times theorem prover too weak. 1921 trivial. 0 not checked. [2021-12-06 19:44:33,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563490950] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:44:33,873 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:44:33,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 26] total 59 [2021-12-06 19:44:33,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580521248] [2021-12-06 19:44:33,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:44:33,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2021-12-06 19:44:33,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:44:33,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2021-12-06 19:44:33,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=3188, Unknown=0, NotChecked=0, Total=3422 [2021-12-06 19:44:33,881 INFO L87 Difference]: Start difference. First operand 67 states and 107 transitions. Second operand has 59 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 47 states have internal predecessors, (66), 34 states have call successors, (99), 1 states have call predecessors, (99), 2 states have return successors, (100), 30 states have call predecessors, (100), 34 states have call successors, (100) [2021-12-06 19:44:36,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:44:36,710 INFO L93 Difference]: Finished difference Result 113 states and 165 transitions. [2021-12-06 19:44:36,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-12-06 19:44:36,711 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 47 states have internal predecessors, (66), 34 states have call successors, (99), 1 states have call predecessors, (99), 2 states have return successors, (100), 30 states have call predecessors, (100), 34 states have call successors, (100) Word has length 214 [2021-12-06 19:44:36,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:44:36,714 INFO L225 Difference]: With dead ends: 113 [2021-12-06 19:44:36,714 INFO L226 Difference]: Without dead ends: 109 [2021-12-06 19:44:36,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 478 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1457, Invalid=6199, Unknown=0, NotChecked=0, Total=7656 [2021-12-06 19:44:36,718 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 431 mSDsluCounter, 1689 mSDsCounter, 0 mSdLazyCounter, 1923 mSolverCounterSat, 538 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 1759 SdHoareTripleChecker+Invalid, 2461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 538 IncrementalHoareTripleChecker+Valid, 1923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-06 19:44:36,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [436 Valid, 1759 Invalid, 2461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [538 Valid, 1923 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-06 19:44:36,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-12-06 19:44:36,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 79. [2021-12-06 19:44:36,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 41 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2021-12-06 19:44:36,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 124 transitions. [2021-12-06 19:44:36,733 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 124 transitions. Word has length 214 [2021-12-06 19:44:36,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:44:36,734 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 124 transitions. [2021-12-06 19:44:36,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 53 states have (on average 1.2452830188679245) internal successors, (66), 47 states have internal predecessors, (66), 34 states have call successors, (99), 1 states have call predecessors, (99), 2 states have return successors, (100), 30 states have call predecessors, (100), 34 states have call successors, (100) [2021-12-06 19:44:36,734 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 124 transitions. [2021-12-06 19:44:36,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2021-12-06 19:44:36,737 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:44:36,738 INFO L514 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:44:36,770 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57a0686b-58c0-4156-ab99-f152ed843bd5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 19:44:36,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57a0686b-58c0-4156-ab99-f152ed843bd5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:44:36,940 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:44:36,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:44:36,941 INFO L85 PathProgramCache]: Analyzing trace with hash 19777012, now seen corresponding path program 1 times [2021-12-06 19:44:36,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:44:36,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466543457] [2021-12-06 19:44:36,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:44:36,943 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:44:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:40,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 19:44:40,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:40,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-06 19:44:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:40,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2021-12-06 19:44:40,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:40,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-06 19:44:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:40,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-12-06 19:44:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:40,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-06 19:44:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:40,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-06 19:44:40,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:40,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-12-06 19:44:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:40,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-12-06 19:44:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:40,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-06 19:44:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:40,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-06 19:44:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:40,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-06 19:44:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:40,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-06 19:44:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:40,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-06 19:44:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:40,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-06 19:44:40,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:40,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2021-12-06 19:44:40,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:40,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2021-12-06 19:44:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:40,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-06 19:44:40,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:40,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2021-12-06 19:44:40,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:40,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2021-12-06 19:44:40,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:40,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2021-12-06 19:44:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:40,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-06 19:44:40,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:40,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2021-12-06 19:44:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:40,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2021-12-06 19:44:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:40,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2021-12-06 19:44:40,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:40,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2021-12-06 19:44:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:40,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-06 19:44:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:40,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2021-12-06 19:44:40,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:40,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-12-06 19:44:40,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:40,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2021-12-06 19:44:40,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:40,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-06 19:44:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:40,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2021-12-06 19:44:40,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:40,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2021-12-06 19:44:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:40,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2021-12-06 19:44:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:40,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2021-12-06 19:44:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:40,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-12-06 19:44:40,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:40,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2021-12-06 19:44:40,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:40,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2021-12-06 19:44:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:40,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 750 proven. 306 refuted. 0 times theorem prover too weak. 1756 trivial. 0 not checked. [2021-12-06 19:44:40,459 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 19:44:40,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466543457] [2021-12-06 19:44:40,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466543457] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 19:44:40,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41475496] [2021-12-06 19:44:40,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:44:40,460 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:44:40,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57a0686b-58c0-4156-ab99-f152ed843bd5/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 19:44:40,461 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57a0686b-58c0-4156-ab99-f152ed843bd5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 19:44:40,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57a0686b-58c0-4156-ab99-f152ed843bd5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 19:44:40,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 19:44:40,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 67 conjunts are in the unsatisfiable core [2021-12-06 19:44:40,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 19:44:41,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 691 proven. 315 refuted. 0 times theorem prover too weak. 1806 trivial. 0 not checked. [2021-12-06 19:44:41,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 19:44:43,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 543 proven. 348 refuted. 0 times theorem prover too weak. 1921 trivial. 0 not checked. [2021-12-06 19:44:43,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41475496] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 19:44:43,643 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 19:44:43,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 20, 22] total 66 [2021-12-06 19:44:43,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226319578] [2021-12-06 19:44:43,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 19:44:43,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2021-12-06 19:44:43,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 19:44:43,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2021-12-06 19:44:43,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=4010, Unknown=0, NotChecked=0, Total=4290 [2021-12-06 19:44:43,648 INFO L87 Difference]: Start difference. First operand 79 states and 124 transitions. Second operand has 66 states, 50 states have (on average 1.42) internal successors, (71), 44 states have internal predecessors, (71), 42 states have call successors, (104), 2 states have call predecessors, (104), 3 states have return successors, (105), 38 states have call predecessors, (105), 42 states have call successors, (105) [2021-12-06 19:44:53,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 19:44:53,648 INFO L93 Difference]: Finished difference Result 113 states and 163 transitions. [2021-12-06 19:44:53,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-12-06 19:44:53,649 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 50 states have (on average 1.42) internal successors, (71), 44 states have internal predecessors, (71), 42 states have call successors, (104), 2 states have call predecessors, (104), 3 states have return successors, (105), 38 states have call predecessors, (105), 42 states have call successors, (105) Word has length 214 [2021-12-06 19:44:53,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 19:44:53,651 INFO L225 Difference]: With dead ends: 113 [2021-12-06 19:44:53,651 INFO L226 Difference]: Without dead ends: 101 [2021-12-06 19:44:53,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 488 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2026 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=2165, Invalid=8965, Unknown=0, NotChecked=0, Total=11130 [2021-12-06 19:44:53,655 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 458 mSDsluCounter, 2068 mSDsCounter, 0 mSdLazyCounter, 2358 mSolverCounterSat, 606 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 2134 SdHoareTripleChecker+Invalid, 2964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 606 IncrementalHoareTripleChecker+Valid, 2358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-12-06 19:44:53,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [459 Valid, 2134 Invalid, 2964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [606 Valid, 2358 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-12-06 19:44:53,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-12-06 19:44:53,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 75. [2021-12-06 19:44:53,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2021-12-06 19:44:53,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 118 transitions. [2021-12-06 19:44:53,666 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 118 transitions. Word has length 214 [2021-12-06 19:44:53,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 19:44:53,667 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 118 transitions. [2021-12-06 19:44:53,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 50 states have (on average 1.42) internal successors, (71), 44 states have internal predecessors, (71), 42 states have call successors, (104), 2 states have call predecessors, (104), 3 states have return successors, (105), 38 states have call predecessors, (105), 42 states have call successors, (105) [2021-12-06 19:44:53,668 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 118 transitions. [2021-12-06 19:44:53,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2021-12-06 19:44:53,670 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 19:44:53,670 INFO L514 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 19:44:53,690 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57a0686b-58c0-4156-ab99-f152ed843bd5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-06 19:44:53,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57a0686b-58c0-4156-ab99-f152ed843bd5/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 19:44:53,872 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 19:44:53,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 19:44:53,873 INFO L85 PathProgramCache]: Analyzing trace with hash -191944716, now seen corresponding path program 1 times [2021-12-06 19:44:53,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 19:44:53,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167341491] [2021-12-06 19:44:53,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 19:44:53,875 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 19:44:53,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 19:44:53,945 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 19:44:53,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 19:44:54,020 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 19:44:54,021 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-06 19:44:54,021 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-06 19:44:54,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 19:44:54,025 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2021-12-06 19:44:54,028 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 19:44:54,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 07:44:54 BoogieIcfgContainer [2021-12-06 19:44:54,083 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 19:44:54,084 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 19:44:54,084 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 19:44:54,084 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 19:44:54,084 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:44:29" (3/4) ... [2021-12-06 19:44:54,086 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-06 19:44:54,150 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57a0686b-58c0-4156-ab99-f152ed843bd5/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-06 19:44:54,150 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 19:44:54,151 INFO L158 Benchmark]: Toolchain (without parser) took 25026.95ms. Allocated memory was 96.5MB in the beginning and 142.6MB in the end (delta: 46.1MB). Free memory was 59.3MB in the beginning and 62.7MB in the end (delta: -3.4MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. [2021-12-06 19:44:54,151 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 96.5MB. Free memory is still 75.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 19:44:54,151 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.41ms. Allocated memory is still 96.5MB. Free memory was 59.2MB in the beginning and 71.7MB in the end (delta: -12.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-06 19:44:54,152 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.72ms. Allocated memory is still 96.5MB. Free memory was 71.7MB in the beginning and 70.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 19:44:54,152 INFO L158 Benchmark]: Boogie Preprocessor took 20.23ms. Allocated memory is still 96.5MB. Free memory was 70.1MB in the beginning and 69.1MB in the end (delta: 988.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 19:44:54,152 INFO L158 Benchmark]: RCFGBuilder took 253.88ms. Allocated memory is still 96.5MB. Free memory was 68.6MB in the beginning and 57.0MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-06 19:44:54,153 INFO L158 Benchmark]: TraceAbstraction took 24443.98ms. Allocated memory was 96.5MB in the beginning and 142.6MB in the end (delta: 46.1MB). Free memory was 56.5MB in the beginning and 71.1MB in the end (delta: -14.6MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. [2021-12-06 19:44:54,153 INFO L158 Benchmark]: Witness Printer took 66.55ms. Allocated memory is still 142.6MB. Free memory was 71.1MB in the beginning and 62.7MB in the end (delta: 8.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-06 19:44:54,155 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.19ms. Allocated memory is still 96.5MB. Free memory is still 75.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 202.41ms. Allocated memory is still 96.5MB. Free memory was 59.2MB in the beginning and 71.7MB in the end (delta: -12.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.72ms. Allocated memory is still 96.5MB. Free memory was 71.7MB in the beginning and 70.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.23ms. Allocated memory is still 96.5MB. Free memory was 70.1MB in the beginning and 69.1MB in the end (delta: 988.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 253.88ms. Allocated memory is still 96.5MB. Free memory was 68.6MB in the beginning and 57.0MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 24443.98ms. Allocated memory was 96.5MB in the beginning and 142.6MB in the end (delta: 46.1MB). Free memory was 56.5MB in the beginning and 71.1MB in the end (delta: -14.6MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. * Witness Printer took 66.55ms. Allocated memory is still 142.6MB. Free memory was 71.1MB in the beginning and 62.7MB in the end (delta: 8.4MB). Peak memory consumption was 6.3MB. 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 - CounterExampleResult [Line: 93]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] int cond0; [L25] int dummy = 0; [L26] int N; [L27] int var0; [L28] var0 = __VERIFIER_nondet_int() [L29] CALL assume(var0 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L29] RET assume(var0 >= 0) VAL [dummy=0, var0=3] [L30] CALL assume(var0 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L30] RET assume(var0 <= 4) VAL [dummy=0, var0=3] [L31] int var1; [L32] var1 = __VERIFIER_nondet_int() [L33] CALL assume(var1 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L33] RET assume(var1 >= 0) VAL [dummy=0, var0=3, var1=2] [L34] CALL assume(var1 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L34] RET assume(var1 <= 4) VAL [dummy=0, var0=3, var1=2] [L35] int var2; [L36] var2 = __VERIFIER_nondet_int() [L37] CALL assume(var2 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L37] RET assume(var2 >= 0) VAL [dummy=0, var0=3, var1=2, var2=0] [L38] CALL assume(var2 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L38] RET assume(var2 <= 4) VAL [dummy=0, var0=3, var1=2, var2=0] [L39] int var3; [L40] var3 = __VERIFIER_nondet_int() [L41] CALL assume(var3 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L41] RET assume(var3 >= 0) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4] [L42] CALL assume(var3 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L42] RET assume(var3 <= 4) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4] [L43] int var4; [L44] var4 = __VERIFIER_nondet_int() [L45] CALL assume(var4 >= 0) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L45] RET assume(var4 >= 0) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1] [L46] CALL assume(var4 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L46] RET assume(var4 <= 4) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1] [L47] int var5; [L48] var5 = __VERIFIER_nondet_int() [L49] CALL assume(var5 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L49] RET assume(var5 >= 1) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1] [L50] CALL assume(var5 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L50] RET assume(var5 <= 4) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1] [L51] int var6; [L52] var6 = __VERIFIER_nondet_int() [L53] CALL assume(var6 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L53] RET assume(var6 >= 1) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2] [L54] CALL assume(var6 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L54] RET assume(var6 <= 4) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2] [L55] int var7; [L56] var7 = __VERIFIER_nondet_int() [L57] CALL assume(var7 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L57] RET assume(var7 >= 1) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4] [L58] CALL assume(var7 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L58] RET assume(var7 <= 4) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4] [L59] int var8; [L60] var8 = __VERIFIER_nondet_int() [L61] CALL assume(var8 >= 1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L61] RET assume(var8 >= 1) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L62] CALL assume(var8 <= 4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L62] RET assume(var8 <= 4) VAL [dummy=0, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L63] int myvar0 = 1; VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L64] CALL assume(var0 != var1) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L64] RET assume(var0 != var1) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L65] CALL assume(var0 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L65] RET assume(var0 != var2) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L66] CALL assume(var0 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L66] RET assume(var0 != var3) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L67] CALL assume(var0 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L67] RET assume(var0 != var4) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L68] CALL assume(var1 != var2) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L68] RET assume(var1 != var2) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L69] CALL assume(var1 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L69] RET assume(var1 != var3) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L70] CALL assume(var1 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L70] RET assume(var1 != var4) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L71] CALL assume(var2 != var3) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L71] RET assume(var2 != var3) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L72] CALL assume(var2 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L72] RET assume(var2 != var4) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L73] CALL assume(var3 != var4) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L73] RET assume(var3 != var4) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L74] CALL assume(var5 != var6) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L74] RET assume(var5 != var6) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L75] CALL assume(var5 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L75] RET assume(var5 != var7) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L76] CALL assume(var5 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L76] RET assume(var5 != var8) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L77] CALL assume(var6 != var7) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L77] RET assume(var6 != var7) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L78] CALL assume(var6 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L78] RET assume(var6 != var8) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L79] CALL assume(var7 != var8) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L79] RET assume(var7 != var8) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3] [L80] int var_for_abs; [L81] var_for_abs = var0 - var1 VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=1] [L82] EXPR (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [(var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1)=1, dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=1] [L82] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) [L83] CALL assume(var5 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L83] RET assume(var5 == var_for_abs) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=1] [L84] var_for_abs = var1 - var2 VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=2] [L85] EXPR (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [(var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1)=2, dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=2] [L85] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) [L86] CALL assume(var6 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L86] RET assume(var6 == var_for_abs) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=2] [L87] var_for_abs = var2 - var3 VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=-4] [L88] EXPR (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [(var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1)=4, dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=-4] [L88] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) [L89] CALL assume(var7 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L89] RET assume(var7 == var_for_abs) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=4] [L90] var_for_abs = var3 - var4 VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=3] [L91] EXPR (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) VAL [(var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1)=3, dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=3] [L91] var_for_abs = (var_for_abs >= 0) ? var_for_abs : var_for_abs * (-1) [L92] CALL assume(var8 == var_for_abs) VAL [\old(cond)=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L92] RET assume(var8 == var_for_abs) VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=3] [L93] reach_error() VAL [dummy=0, myvar0=1, var0=3, var1=2, var2=0, var3=4, var4=1, var5=1, var6=2, var7=4, var8=3, var_for_abs=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.3s, OverallIterations: 4, TraceHistogramMax: 38, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 895 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 889 mSDsluCounter, 4000 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3757 mSDsCounter, 1144 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4281 IncrementalHoareTripleChecker+Invalid, 5425 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1144 mSolverCounterUnsat, 243 mSDtfsCounter, 4281 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1273 GetRequests, 1082 SyntacticMatches, 1 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3197 ImplicationChecksByTransitivity, 14.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=2, InterpolantAutomatonStates: 85, 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, 3 MinimizatonAttempts, 56 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 1284 NumberOfCodeBlocks, 1284 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1491 ConstructedInterpolants, 0 QuantifiedInterpolants, 11400 SizeOfPredicates, 66 NumberOfNonLiveVariables, 868 ConjunctsInSsa, 134 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 17632/19684 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 proved your program to be incorrect! [2021-12-06 19:44:54,193 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57a0686b-58c0-4156-ab99-f152ed843bd5/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE