./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/thin002_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_43533814-27b8-444a-a4a4-fbfeb6880f6f/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_43533814-27b8-444a-a4a4-fbfeb6880f6f/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_43533814-27b8-444a-a4a4-fbfeb6880f6f/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_43533814-27b8-444a-a4a4-fbfeb6880f6f/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/thin002_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_43533814-27b8-444a-a4a4-fbfeb6880f6f/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_43533814-27b8-444a-a4a4-fbfeb6880f6f/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 62eab7c7adc1c6127f2b486315a22ea7b9450bc8 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 21:56:44,305 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 21:56:44,306 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 21:56:44,313 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 21:56:44,313 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 21:56:44,314 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 21:56:44,315 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 21:56:44,316 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 21:56:44,317 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 21:56:44,318 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 21:56:44,318 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 21:56:44,319 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 21:56:44,319 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 21:56:44,320 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 21:56:44,321 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 21:56:44,321 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 21:56:44,322 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 21:56:44,322 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 21:56:44,324 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 21:56:44,325 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 21:56:44,326 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 21:56:44,327 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 21:56:44,328 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 21:56:44,328 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 21:56:44,330 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 21:56:44,330 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 21:56:44,330 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 21:56:44,330 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 21:56:44,331 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 21:56:44,331 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 21:56:44,331 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 21:56:44,332 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 21:56:44,332 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 21:56:44,333 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 21:56:44,333 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 21:56:44,333 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 21:56:44,334 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 21:56:44,334 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 21:56:44,334 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 21:56:44,334 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 21:56:44,335 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 21:56:44,335 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_43533814-27b8-444a-a4a4-fbfeb6880f6f/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 21:56:44,346 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 21:56:44,346 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 21:56:44,346 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 21:56:44,346 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 21:56:44,347 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 21:56:44,347 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 21:56:44,347 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 21:56:44,347 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 21:56:44,347 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 21:56:44,347 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 21:56:44,347 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 21:56:44,347 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 21:56:44,348 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 21:56:44,348 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 21:56:44,348 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 21:56:44,348 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 21:56:44,348 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 21:56:44,348 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 21:56:44,349 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 21:56:44,349 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 21:56:44,349 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 21:56:44,349 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 21:56:44,349 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 21:56:44,349 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 21:56:44,349 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 21:56:44,349 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 21:56:44,350 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 21:56:44,350 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 21:56:44,350 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 21:56:44,350 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 21:56:44,350 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 21:56:44,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:56:44,350 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 21:56:44,350 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 21:56:44,350 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 21:56:44,350 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 21:56:44,351 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 21:56:44,351 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 21:56:44,351 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 21:56:44,351 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 21:56:44,351 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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-vcloud-master/worker/run_dir_43533814-27b8-444a-a4a4-fbfeb6880f6f/bin/utaipan 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(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 62eab7c7adc1c6127f2b486315a22ea7b9450bc8 [2019-12-07 21:56:44,449 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 21:56:44,457 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 21:56:44,459 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 21:56:44,460 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 21:56:44,460 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 21:56:44,461 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_43533814-27b8-444a-a4a4-fbfeb6880f6f/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/thin002_pso.opt.i [2019-12-07 21:56:44,498 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_43533814-27b8-444a-a4a4-fbfeb6880f6f/bin/utaipan/data/db812c46e/2a5b82f761f1451ea9e3d06de4f9ce76/FLAG94cf4a4d1 [2019-12-07 21:56:44,963 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 21:56:44,963 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_43533814-27b8-444a-a4a4-fbfeb6880f6f/sv-benchmarks/c/pthread-wmm/thin002_pso.opt.i [2019-12-07 21:56:44,973 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_43533814-27b8-444a-a4a4-fbfeb6880f6f/bin/utaipan/data/db812c46e/2a5b82f761f1451ea9e3d06de4f9ce76/FLAG94cf4a4d1 [2019-12-07 21:56:44,983 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_43533814-27b8-444a-a4a4-fbfeb6880f6f/bin/utaipan/data/db812c46e/2a5b82f761f1451ea9e3d06de4f9ce76 [2019-12-07 21:56:44,985 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 21:56:44,986 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 21:56:44,987 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 21:56:44,987 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 21:56:44,989 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 21:56:44,990 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:56:44" (1/1) ... [2019-12-07 21:56:44,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69c40132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:56:44, skipping insertion in model container [2019-12-07 21:56:44,991 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:56:44" (1/1) ... [2019-12-07 21:56:44,996 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 21:56:45,032 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 21:56:45,272 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:56:45,280 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 21:56:45,314 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:56:45,360 INFO L208 MainTranslator]: Completed translation [2019-12-07 21:56:45,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:56:45 WrapperNode [2019-12-07 21:56:45,360 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 21:56:45,361 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 21:56:45,361 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 21:56:45,361 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 21:56:45,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:56:45" (1/1) ... [2019-12-07 21:56:45,377 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:56:45" (1/1) ... [2019-12-07 21:56:45,392 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 21:56:45,392 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 21:56:45,392 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 21:56:45,393 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 21:56:45,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:56:45" (1/1) ... [2019-12-07 21:56:45,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:56:45" (1/1) ... [2019-12-07 21:56:45,401 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:56:45" (1/1) ... [2019-12-07 21:56:45,401 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:56:45" (1/1) ... [2019-12-07 21:56:45,406 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:56:45" (1/1) ... [2019-12-07 21:56:45,407 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:56:45" (1/1) ... [2019-12-07 21:56:45,409 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:56:45" (1/1) ... [2019-12-07 21:56:45,411 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 21:56:45,412 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 21:56:45,412 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 21:56:45,412 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 21:56:45,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:56:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_43533814-27b8-444a-a4a4-fbfeb6880f6f/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:56:45,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 21:56:45,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 21:56:45,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 21:56:45,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 21:56:45,462 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 21:56:45,462 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 21:56:45,462 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 21:56:45,462 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 21:56:45,462 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 21:56:45,462 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 21:56:45,462 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 21:56:45,462 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 21:56:45,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 21:56:45,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 21:56:45,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 21:56:45,463 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 21:56:45,654 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 21:56:45,654 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-07 21:56:45,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:56:45 BoogieIcfgContainer [2019-12-07 21:56:45,655 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 21:56:45,656 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 21:56:45,656 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 21:56:45,659 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 21:56:45,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 09:56:44" (1/3) ... [2019-12-07 21:56:45,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19faf789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:56:45, skipping insertion in model container [2019-12-07 21:56:45,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:56:45" (2/3) ... [2019-12-07 21:56:45,660 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19faf789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:56:45, skipping insertion in model container [2019-12-07 21:56:45,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:56:45" (3/3) ... [2019-12-07 21:56:45,662 INFO L109 eAbstractionObserver]: Analyzing ICFG thin002_pso.opt.i [2019-12-07 21:56:45,668 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 21:56:45,668 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 21:56:45,673 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 21:56:45,673 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 21:56:45,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:45,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:45,692 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:45,692 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:45,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:45,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:45,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:45,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:45,693 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:45,693 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:45,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:45,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:45,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:45,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:45,693 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:45,694 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:45,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:45,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:45,694 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:45,694 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:45,695 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:45,695 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:45,695 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:45,695 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:56:45,710 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 21:56:45,722 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 21:56:45,723 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 21:56:45,723 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 21:56:45,723 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 21:56:45,723 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 21:56:45,723 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 21:56:45,723 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 21:56:45,723 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 21:56:45,732 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 67 transitions [2019-12-07 21:56:45,733 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 79 places, 67 transitions [2019-12-07 21:56:45,761 INFO L134 PetriNetUnfolder]: 1/63 cut-off events. [2019-12-07 21:56:45,762 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 21:56:45,766 INFO L76 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 63 events. 1/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs. 12/73 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2019-12-07 21:56:45,768 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 79 places, 67 transitions [2019-12-07 21:56:45,780 INFO L134 PetriNetUnfolder]: 1/63 cut-off events. [2019-12-07 21:56:45,781 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 21:56:45,782 INFO L76 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 63 events. 1/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs. 12/73 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2019-12-07 21:56:45,783 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 732 [2019-12-07 21:56:45,784 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 21:56:46,664 INFO L206 etLargeBlockEncoding]: Checked pairs total: 723 [2019-12-07 21:56:46,664 INFO L214 etLargeBlockEncoding]: Total number of compositions: 56 [2019-12-07 21:56:46,666 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 28 places, 21 transitions [2019-12-07 21:56:46,686 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 110 states. [2019-12-07 21:56:46,687 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2019-12-07 21:56:46,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 21:56:46,692 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:56:46,693 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:56:46,693 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:56:46,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:56:46,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1014881653, now seen corresponding path program 1 times [2019-12-07 21:56:46,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:56:46,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672958648] [2019-12-07 21:56:46,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:56:46,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:56:46,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:56:46,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672958648] [2019-12-07 21:56:46,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:56:46,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 21:56:46,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099137500] [2019-12-07 21:56:46,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:56:46,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:56:46,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:56:46,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:56:46,888 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 3 states. [2019-12-07 21:56:46,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:56:46,915 INFO L93 Difference]: Finished difference Result 139 states and 354 transitions. [2019-12-07 21:56:46,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:56:46,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-07 21:56:46,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:56:46,924 INFO L225 Difference]: With dead ends: 139 [2019-12-07 21:56:46,924 INFO L226 Difference]: Without dead ends: 77 [2019-12-07 21:56:46,925 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:56:46,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-12-07 21:56:46,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-12-07 21:56:46,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-12-07 21:56:46,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 187 transitions. [2019-12-07 21:56:46,953 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 187 transitions. Word has length 10 [2019-12-07 21:56:46,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:56:46,953 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 187 transitions. [2019-12-07 21:56:46,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:56:46,954 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 187 transitions. [2019-12-07 21:56:46,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 21:56:46,954 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:56:46,954 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:56:46,955 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:56:46,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:56:46,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1386680118, now seen corresponding path program 1 times [2019-12-07 21:56:46,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:56:46,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453232287] [2019-12-07 21:56:46,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:56:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:56:47,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:56:47,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453232287] [2019-12-07 21:56:47,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:56:47,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:56:47,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574274221] [2019-12-07 21:56:47,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:56:47,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:56:47,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:56:47,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:56:47,018 INFO L87 Difference]: Start difference. First operand 77 states and 187 transitions. Second operand 4 states. [2019-12-07 21:56:47,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:56:47,032 INFO L93 Difference]: Finished difference Result 70 states and 164 transitions. [2019-12-07 21:56:47,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:56:47,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 21:56:47,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:56:47,034 INFO L225 Difference]: With dead ends: 70 [2019-12-07 21:56:47,034 INFO L226 Difference]: Without dead ends: 70 [2019-12-07 21:56:47,034 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:56:47,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-12-07 21:56:47,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-12-07 21:56:47,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-12-07 21:56:47,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 164 transitions. [2019-12-07 21:56:47,041 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 164 transitions. Word has length 11 [2019-12-07 21:56:47,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:56:47,041 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 164 transitions. [2019-12-07 21:56:47,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:56:47,041 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 164 transitions. [2019-12-07 21:56:47,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 21:56:47,042 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:56:47,042 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:56:47,042 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:56:47,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:56:47,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1396559818, now seen corresponding path program 1 times [2019-12-07 21:56:47,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:56:47,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689557707] [2019-12-07 21:56:47,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:56:47,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:56:47,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:56:47,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689557707] [2019-12-07 21:56:47,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:56:47,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:56:47,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106090643] [2019-12-07 21:56:47,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:56:47,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:56:47,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:56:47,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:56:47,102 INFO L87 Difference]: Start difference. First operand 70 states and 164 transitions. Second operand 4 states. [2019-12-07 21:56:47,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:56:47,124 INFO L93 Difference]: Finished difference Result 75 states and 173 transitions. [2019-12-07 21:56:47,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:56:47,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 21:56:47,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:56:47,125 INFO L225 Difference]: With dead ends: 75 [2019-12-07 21:56:47,125 INFO L226 Difference]: Without dead ends: 75 [2019-12-07 21:56:47,125 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:56:47,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-12-07 21:56:47,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-12-07 21:56:47,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-12-07 21:56:47,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 173 transitions. [2019-12-07 21:56:47,132 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 173 transitions. Word has length 11 [2019-12-07 21:56:47,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:56:47,132 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 173 transitions. [2019-12-07 21:56:47,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:56:47,132 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 173 transitions. [2019-12-07 21:56:47,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 21:56:47,133 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:56:47,133 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:56:47,133 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:56:47,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:56:47,133 INFO L82 PathProgramCache]: Analyzing trace with hash 37410345, now seen corresponding path program 1 times [2019-12-07 21:56:47,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:56:47,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046561847] [2019-12-07 21:56:47,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:56:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:56:47,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:56:47,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046561847] [2019-12-07 21:56:47,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:56:47,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:56:47,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728776127] [2019-12-07 21:56:47,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:56:47,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:56:47,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:56:47,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:56:47,185 INFO L87 Difference]: Start difference. First operand 75 states and 173 transitions. Second operand 4 states. [2019-12-07 21:56:47,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:56:47,195 INFO L93 Difference]: Finished difference Result 72 states and 165 transitions. [2019-12-07 21:56:47,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:56:47,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 21:56:47,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:56:47,196 INFO L225 Difference]: With dead ends: 72 [2019-12-07 21:56:47,196 INFO L226 Difference]: Without dead ends: 72 [2019-12-07 21:56:47,197 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:56:47,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-12-07 21:56:47,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-12-07 21:56:47,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-12-07 21:56:47,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 160 transitions. [2019-12-07 21:56:47,201 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 160 transitions. Word has length 12 [2019-12-07 21:56:47,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:56:47,202 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 160 transitions. [2019-12-07 21:56:47,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:56:47,202 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 160 transitions. [2019-12-07 21:56:47,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 21:56:47,202 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:56:47,202 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:56:47,202 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:56:47,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:56:47,203 INFO L82 PathProgramCache]: Analyzing trace with hash 343681169, now seen corresponding path program 1 times [2019-12-07 21:56:47,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:56:47,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543099516] [2019-12-07 21:56:47,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:56:47,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:56:47,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:56:47,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543099516] [2019-12-07 21:56:47,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:56:47,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:56:47,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669313716] [2019-12-07 21:56:47,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:56:47,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:56:47,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:56:47,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:56:47,245 INFO L87 Difference]: Start difference. First operand 70 states and 160 transitions. Second operand 5 states. [2019-12-07 21:56:47,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:56:47,261 INFO L93 Difference]: Finished difference Result 76 states and 167 transitions. [2019-12-07 21:56:47,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:56:47,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-12-07 21:56:47,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:56:47,263 INFO L225 Difference]: With dead ends: 76 [2019-12-07 21:56:47,263 INFO L226 Difference]: Without dead ends: 56 [2019-12-07 21:56:47,263 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:56:47,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-12-07 21:56:47,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-12-07 21:56:47,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-07 21:56:47,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 119 transitions. [2019-12-07 21:56:47,268 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 119 transitions. Word has length 12 [2019-12-07 21:56:47,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:56:47,268 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 119 transitions. [2019-12-07 21:56:47,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:56:47,268 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 119 transitions. [2019-12-07 21:56:47,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 21:56:47,269 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:56:47,269 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:56:47,269 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:56:47,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:56:47,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1159720466, now seen corresponding path program 1 times [2019-12-07 21:56:47,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:56:47,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525123668] [2019-12-07 21:56:47,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:56:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:56:47,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:56:47,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525123668] [2019-12-07 21:56:47,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:56:47,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:56:47,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501111210] [2019-12-07 21:56:47,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:56:47,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:56:47,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:56:47,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:56:47,343 INFO L87 Difference]: Start difference. First operand 56 states and 119 transitions. Second operand 6 states. [2019-12-07 21:56:47,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:56:47,387 INFO L93 Difference]: Finished difference Result 60 states and 122 transitions. [2019-12-07 21:56:47,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:56:47,387 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-12-07 21:56:47,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:56:47,388 INFO L225 Difference]: With dead ends: 60 [2019-12-07 21:56:47,388 INFO L226 Difference]: Without dead ends: 48 [2019-12-07 21:56:47,388 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-07 21:56:47,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-12-07 21:56:47,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-12-07 21:56:47,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-07 21:56:47,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 94 transitions. [2019-12-07 21:56:47,391 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 94 transitions. Word has length 13 [2019-12-07 21:56:47,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:56:47,391 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 94 transitions. [2019-12-07 21:56:47,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:56:47,392 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 94 transitions. [2019-12-07 21:56:47,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 21:56:47,392 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:56:47,392 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:56:47,393 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:56:47,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:56:47,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1163087066, now seen corresponding path program 2 times [2019-12-07 21:56:47,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:56:47,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492165459] [2019-12-07 21:56:47,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:56:47,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:56:47,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:56:47,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492165459] [2019-12-07 21:56:47,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:56:47,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:56:47,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770912315] [2019-12-07 21:56:47,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:56:47,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:56:47,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:56:47,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:56:47,450 INFO L87 Difference]: Start difference. First operand 48 states and 94 transitions. Second operand 7 states. [2019-12-07 21:56:47,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:56:47,513 INFO L93 Difference]: Finished difference Result 48 states and 92 transitions. [2019-12-07 21:56:47,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 21:56:47,514 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2019-12-07 21:56:47,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:56:47,514 INFO L225 Difference]: With dead ends: 48 [2019-12-07 21:56:47,514 INFO L226 Difference]: Without dead ends: 44 [2019-12-07 21:56:47,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-07 21:56:47,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-07 21:56:47,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-12-07 21:56:47,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-07 21:56:47,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 86 transitions. [2019-12-07 21:56:47,517 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 86 transitions. Word has length 13 [2019-12-07 21:56:47,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:56:47,517 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 86 transitions. [2019-12-07 21:56:47,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:56:47,517 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 86 transitions. [2019-12-07 21:56:47,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 21:56:47,518 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:56:47,518 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:56:47,518 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:56:47,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:56:47,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1696039468, now seen corresponding path program 1 times [2019-12-07 21:56:47,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:56:47,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129972295] [2019-12-07 21:56:47,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:56:47,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:56:47,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:56:47,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129972295] [2019-12-07 21:56:47,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:56:47,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:56:47,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975410870] [2019-12-07 21:56:47,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:56:47,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:56:47,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:56:47,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:56:47,559 INFO L87 Difference]: Start difference. First operand 44 states and 86 transitions. Second operand 5 states. [2019-12-07 21:56:47,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:56:47,575 INFO L93 Difference]: Finished difference Result 53 states and 97 transitions. [2019-12-07 21:56:47,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:56:47,575 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 21:56:47,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:56:47,575 INFO L225 Difference]: With dead ends: 53 [2019-12-07 21:56:47,576 INFO L226 Difference]: Without dead ends: 36 [2019-12-07 21:56:47,576 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:56:47,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-07 21:56:47,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-12-07 21:56:47,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-07 21:56:47,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 62 transitions. [2019-12-07 21:56:47,578 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 62 transitions. Word has length 14 [2019-12-07 21:56:47,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:56:47,578 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 62 transitions. [2019-12-07 21:56:47,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:56:47,578 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 62 transitions. [2019-12-07 21:56:47,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 21:56:47,579 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:56:47,579 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:56:47,579 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:56:47,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:56:47,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1405601952, now seen corresponding path program 2 times [2019-12-07 21:56:47,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:56:47,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131349261] [2019-12-07 21:56:47,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:56:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:56:47,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:56:47,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131349261] [2019-12-07 21:56:47,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:56:47,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:56:47,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632203416] [2019-12-07 21:56:47,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:56:47,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:56:47,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:56:47,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:56:47,618 INFO L87 Difference]: Start difference. First operand 36 states and 62 transitions. Second operand 5 states. [2019-12-07 21:56:47,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:56:47,631 INFO L93 Difference]: Finished difference Result 38 states and 63 transitions. [2019-12-07 21:56:47,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:56:47,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 21:56:47,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:56:47,631 INFO L225 Difference]: With dead ends: 38 [2019-12-07 21:56:47,631 INFO L226 Difference]: Without dead ends: 21 [2019-12-07 21:56:47,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:56:47,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-12-07 21:56:47,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-12-07 21:56:47,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-12-07 21:56:47,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2019-12-07 21:56:47,633 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 14 [2019-12-07 21:56:47,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:56:47,633 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-12-07 21:56:47,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:56:47,633 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2019-12-07 21:56:47,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 21:56:47,633 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:56:47,633 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:56:47,634 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:56:47,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:56:47,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1389601302, now seen corresponding path program 3 times [2019-12-07 21:56:47,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:56:47,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804433593] [2019-12-07 21:56:47,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:56:47,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:56:47,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:56:47,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804433593] [2019-12-07 21:56:47,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:56:47,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:56:47,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035761590] [2019-12-07 21:56:47,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:56:47,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:56:47,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:56:47,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:56:47,672 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand 5 states. [2019-12-07 21:56:47,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:56:47,681 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2019-12-07 21:56:47,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:56:47,681 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 21:56:47,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:56:47,681 INFO L225 Difference]: With dead ends: 20 [2019-12-07 21:56:47,681 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 21:56:47,682 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:56:47,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 21:56:47,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 21:56:47,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 21:56:47,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 21:56:47,682 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2019-12-07 21:56:47,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:56:47,683 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 21:56:47,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:56:47,683 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 21:56:47,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 21:56:47,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 09:56:47 BasicIcfg [2019-12-07 21:56:47,686 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 21:56:47,686 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 21:56:47,687 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 21:56:47,687 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 21:56:47,687 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:56:45" (3/4) ... [2019-12-07 21:56:47,690 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 21:56:47,696 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P0 [2019-12-07 21:56:47,696 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P1 [2019-12-07 21:56:47,696 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P2 [2019-12-07 21:56:47,696 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P3 [2019-12-07 21:56:47,700 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-12-07 21:56:47,700 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-07 21:56:47,700 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 21:56:47,738 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_43533814-27b8-444a-a4a4-fbfeb6880f6f/bin/utaipan/witness.graphml [2019-12-07 21:56:47,738 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 21:56:47,741 INFO L168 Benchmark]: Toolchain (without parser) took 2753.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 939.8 MB in the beginning and 917.4 MB in the end (delta: 22.3 MB). Peak memory consumption was 122.0 MB. Max. memory is 11.5 GB. [2019-12-07 21:56:47,741 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:56:47,742 INFO L168 Benchmark]: CACSL2BoogieTranslator took 373.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -130.3 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 21:56:47,742 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.65 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:56:47,742 INFO L168 Benchmark]: Boogie Preprocessor took 18.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 21:56:47,743 INFO L168 Benchmark]: RCFGBuilder took 243.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2019-12-07 21:56:47,743 INFO L168 Benchmark]: TraceAbstraction took 2029.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 919.2 MB in the end (delta: 117.2 MB). Peak memory consumption was 117.2 MB. Max. memory is 11.5 GB. [2019-12-07 21:56:47,743 INFO L168 Benchmark]: Witness Printer took 52.09 ms. Allocated memory is still 1.1 GB. Free memory was 919.2 MB in the beginning and 917.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-12-07 21:56:47,746 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 373.54 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.6 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -130.3 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.65 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 243.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2029.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 919.2 MB in the end (delta: 117.2 MB). Peak memory consumption was 117.2 MB. Max. memory is 11.5 GB. * Witness Printer took 52.09 ms. Allocated memory is still 1.1 GB. Free memory was 919.2 MB in the beginning and 917.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.9s, 79 ProgramPointsBefore, 28 ProgramPointsAfterwards, 67 TransitionsBefore, 21 TransitionsAfterwards, 732 CoEnabledTransitionPairs, 7 FixpointIterations, 17 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 358 VarBasedMoverChecksPositive, 12 VarBasedMoverChecksNegative, 2 SemBasedMoverChecksPositive, 14 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 723 CheckedPairsTotal, 56 TotalNumberOfCompositions - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 67 locations, 1 error locations. Result: SAFE, OverallTime: 1.9s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 126 SDtfs, 173 SDslu, 106 SDs, 0 SdLazy, 105 SolverSat, 62 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 124 NumberOfCodeBlocks, 124 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 7536 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...