./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe036_pso.opt.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe036_pso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ebf82f2b1a2bbf606d21bef0efcefdc05c9f5b4 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 21:47:45,466 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 21:47:45,468 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 21:47:45,480 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 21:47:45,480 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 21:47:45,482 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 21:47:45,483 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 21:47:45,485 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 21:47:45,487 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 21:47:45,488 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 21:47:45,489 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 21:47:45,490 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 21:47:45,490 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 21:47:45,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 21:47:45,493 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 21:47:45,494 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 21:47:45,495 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 21:47:45,496 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 21:47:45,497 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 21:47:45,499 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 21:47:45,501 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 21:47:45,502 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 21:47:45,503 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 21:47:45,504 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 21:47:45,506 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 21:47:45,507 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 21:47:45,507 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 21:47:45,508 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 21:47:45,508 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 21:47:45,509 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 21:47:45,510 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 21:47:45,510 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 21:47:45,511 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 21:47:45,512 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 21:47:45,513 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 21:47:45,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 21:47:45,514 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 21:47:45,515 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 21:47:45,515 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 21:47:45,516 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 21:47:45,517 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 21:47:45,517 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 21:47:45,532 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 21:47:45,532 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 21:47:45,533 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 21:47:45,534 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 21:47:45,534 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 21:47:45,534 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 21:47:45,534 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 21:47:45,535 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 21:47:45,535 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 21:47:45,535 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 21:47:45,536 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 21:47:45,536 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 21:47:45,536 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 21:47:45,536 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 21:47:45,537 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 21:47:45,537 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 21:47:45,537 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 21:47:45,537 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 21:47:45,538 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 21:47:45,538 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 21:47:45,538 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 21:47:45,538 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 21:47:45,539 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 21:47:45,539 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 21:47:45,539 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 21:47:45,540 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 21:47:45,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 21:47:45,540 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 21:47:45,540 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 21:47:45,541 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 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 -> 4ebf82f2b1a2bbf606d21bef0efcefdc05c9f5b4 [2020-07-28 21:47:45,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 21:47:45,871 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 21:47:45,875 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 21:47:45,876 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 21:47:45,878 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 21:47:45,879 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe036_pso.opt.i [2020-07-28 21:47:45,959 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a53788e1a/a7a1f4da7b194b828062b27c0545ade5/FLAG668640c6b [2020-07-28 21:47:46,509 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 21:47:46,510 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe036_pso.opt.i [2020-07-28 21:47:46,523 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a53788e1a/a7a1f4da7b194b828062b27c0545ade5/FLAG668640c6b [2020-07-28 21:47:46,803 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a53788e1a/a7a1f4da7b194b828062b27c0545ade5 [2020-07-28 21:47:46,806 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 21:47:46,809 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 21:47:46,811 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 21:47:46,811 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 21:47:46,815 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 21:47:46,816 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 09:47:46" (1/1) ... [2020-07-28 21:47:46,819 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fde7000 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:47:46, skipping insertion in model container [2020-07-28 21:47:46,820 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 09:47:46" (1/1) ... [2020-07-28 21:47:46,827 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 21:47:46,866 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 21:47:47,296 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 21:47:47,309 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 21:47:47,355 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 21:47:47,459 INFO L208 MainTranslator]: Completed translation [2020-07-28 21:47:47,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:47:47 WrapperNode [2020-07-28 21:47:47,460 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 21:47:47,462 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 21:47:47,463 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 21:47:47,463 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 21:47:47,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:47:47" (1/1) ... [2020-07-28 21:47:47,500 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:47:47" (1/1) ... [2020-07-28 21:47:47,522 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 21:47:47,523 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 21:47:47,523 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 21:47:47,523 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 21:47:47,531 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:47:47" (1/1) ... [2020-07-28 21:47:47,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:47:47" (1/1) ... [2020-07-28 21:47:47,534 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:47:47" (1/1) ... [2020-07-28 21:47:47,535 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:47:47" (1/1) ... [2020-07-28 21:47:47,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:47:47" (1/1) ... [2020-07-28 21:47:47,545 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:47:47" (1/1) ... [2020-07-28 21:47:47,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:47:47" (1/1) ... [2020-07-28 21:47:47,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 21:47:47,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 21:47:47,551 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 21:47:47,551 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 21:47:47,552 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:47:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-28 21:47:47,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 21:47:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-07-28 21:47:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 21:47:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 21:47:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-07-28 21:47:47,616 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-07-28 21:47:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-07-28 21:47:47,616 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-07-28 21:47:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-07-28 21:47:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 21:47:47,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 21:47:47,618 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-07-28 21:47:48,030 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 21:47:48,030 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-28 21:47:48,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 09:47:48 BoogieIcfgContainer [2020-07-28 21:47:48,034 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 21:47:48,035 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 21:47:48,035 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 21:47:48,038 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 21:47:48,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 09:47:46" (1/3) ... [2020-07-28 21:47:48,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5539aca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 09:47:48, skipping insertion in model container [2020-07-28 21:47:48,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:47:47" (2/3) ... [2020-07-28 21:47:48,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5539aca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 09:47:48, skipping insertion in model container [2020-07-28 21:47:48,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 09:47:48" (3/3) ... [2020-07-28 21:47:48,041 INFO L109 eAbstractionObserver]: Analyzing ICFG safe036_pso.opt.i [2020-07-28 21:47:48,050 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-07-28 21:47:48,050 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 21:47:48,057 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 21:47:48,058 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-07-28 21:47:48,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:47:48,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:47:48,089 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:47:48,091 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:47:48,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:47:48,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:47:48,092 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:47:48,092 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:47:48,093 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:47:48,093 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:47:48,093 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:47:48,093 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:47:48,097 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:47:48,097 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:47:48,098 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:47:48,098 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:47:48,108 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:47:48,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:47:48,109 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:47:48,109 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:47:48,122 INFO L251 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-07-28 21:47:48,141 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 21:47:48,141 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 21:47:48,141 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 21:47:48,141 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 21:47:48,142 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 21:47:48,142 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 21:47:48,142 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 21:47:48,142 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 21:47:48,155 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 56 transitions, 122 flow [2020-07-28 21:47:48,157 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 61 places, 56 transitions, 122 flow [2020-07-28 21:47:48,192 INFO L129 PetriNetUnfolder]: 2/54 cut-off events. [2020-07-28 21:47:48,192 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-07-28 21:47:48,197 INFO L80 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 54 events. 2/54 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 34 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2020-07-28 21:47:48,199 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 61 places, 56 transitions, 122 flow [2020-07-28 21:47:48,223 INFO L129 PetriNetUnfolder]: 2/54 cut-off events. [2020-07-28 21:47:48,223 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-07-28 21:47:48,224 INFO L80 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 54 events. 2/54 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 34 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2020-07-28 21:47:48,226 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 672 [2020-07-28 21:47:48,227 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-07-28 21:47:50,141 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1294 [2020-07-28 21:47:50,144 INFO L214 etLargeBlockEncoding]: Total number of compositions: 49 [2020-07-28 21:47:50,148 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 22 places, 15 transitions, 40 flow [2020-07-28 21:47:50,168 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 74 states. [2020-07-28 21:47:50,170 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2020-07-28 21:47:50,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-28 21:47:50,197 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 21:47:50,199 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-28 21:47:50,200 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 21:47:50,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 21:47:50,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1873752150, now seen corresponding path program 1 times [2020-07-28 21:47:50,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 21:47:50,222 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168558408] [2020-07-28 21:47:50,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 21:47:50,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 21:47:50,479 INFO L280 TraceCheckUtils]: 0: Hoare triple {212#true} [180] ULTIMATE.startENTRY-->L754: Formula: (let ((.cse0 (store |v_#valid_43| 0 0))) (and (= 0 |v_#NULL.base_5|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2631~0.base_19| 4) |v_#length_15|) (= 0 v_~main$tmp_guard1~0_22) (= 0 |v_#NULL.offset_5|) (= 0 |v_ULTIMATE.start_main_~#t2631~0.offset_15|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2631~0.base_19| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2631~0.base_19|) |v_ULTIMATE.start_main_~#t2631~0.offset_15| 0)) |v_#memory_int_13|) (= 0 v_~__unbuffered_cnt~0_61) (= (store .cse0 |v_ULTIMATE.start_main_~#t2631~0.base_19| 1) |v_#valid_41|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2631~0.base_19|)) (= 0 v_~main$tmp_guard0~0_26) (= 0 v_~__unbuffered_p1_EAX~0_29) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~__unbuffered_p0_EAX~0_26) (= 0 v_~x~0_18) (= 0 v_~y~0_23) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2631~0.base_19|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2631~0.base=|v_ULTIMATE.start_main_~#t2631~0.base_19|, ULTIMATE.start_main_~#t2631~0.offset=|v_ULTIMATE.start_main_~#t2631~0.offset_15|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_8|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_7|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t2632~0.base=|v_ULTIMATE.start_main_~#t2632~0.base_19|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_5|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ULTIMATE.start_main_~#t2632~0.offset=|v_ULTIMATE.start_main_~#t2632~0.offset_15|, ~y~0=v_~y~0_23, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2631~0.base, ULTIMATE.start_main_~#t2631~0.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, #NULL.offset, ULTIMATE.start_main_~#t2632~0.base, ~main$tmp_guard1~0, ~main$tmp_guard0~0, #NULL.base, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#res, #valid, #memory_int, #length, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2632~0.offset, ~y~0, ~x~0] {214#(= 0 ~__unbuffered_cnt~0)} is VALID [2020-07-28 21:47:50,480 INFO L280 TraceCheckUtils]: 1: Hoare triple {214#(= 0 ~__unbuffered_cnt~0)} [133] L754-->P0ENTRY: Formula: (and (= 0 v_P0Thread1of1ForFork0_thidvar0_2) (= 0 |v_P0Thread1of1ForFork0_#in~arg.base_3|) (= 0 |v_P0Thread1of1ForFork0_#in~arg.offset_3|)) InVars {} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_3|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_thidvar0=v_P0Thread1of1ForFork0_thidvar0_2, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_3|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_3, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_3} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#in~arg.offset, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_thidvar0, P0Thread1of1ForFork0_#in~arg.base, P0Thread1of1ForFork0_#res.base, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] {214#(= 0 ~__unbuffered_cnt~0)} is VALID [2020-07-28 21:47:50,481 INFO L280 TraceCheckUtils]: 2: Hoare triple {214#(= 0 ~__unbuffered_cnt~0)} [168] L754-1-->L756: Formula: (and (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t2632~0.base_13| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2632~0.base_13|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t2632~0.base_13|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2632~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2632~0.base_13|) |v_ULTIMATE.start_main_~#t2632~0.offset_11| 1))) (= 0 |v_ULTIMATE.start_main_~#t2632~0.offset_11|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2632~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t2632~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t2632~0.base=|v_ULTIMATE.start_main_~#t2632~0.base_13|, #length=|v_#length_11|, ULTIMATE.start_main_~#t2632~0.offset=|v_ULTIMATE.start_main_~#t2632~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #valid, #memory_int, ULTIMATE.start_main_~#t2632~0.base, #length, ULTIMATE.start_main_~#t2632~0.offset] {214#(= 0 ~__unbuffered_cnt~0)} is VALID [2020-07-28 21:47:50,482 INFO L280 TraceCheckUtils]: 3: Hoare triple {214#(= 0 ~__unbuffered_cnt~0)} [135] L756-->P1ENTRY: Formula: (and (= 1 v_P1Thread1of1ForFork1_thidvar0_2) (= 0 |v_P1Thread1of1ForFork1_#in~arg.base_3|) (= 0 |v_P1Thread1of1ForFork1_#in~arg.offset_3|)) InVars {} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_3, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_3, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_3|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_3|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_thidvar0=v_P1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1_#in~arg.base, P1Thread1of1ForFork1_#in~arg.offset, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_thidvar0] {214#(= 0 ~__unbuffered_cnt~0)} is VALID [2020-07-28 21:47:50,483 INFO L280 TraceCheckUtils]: 4: Hoare triple {214#(= 0 ~__unbuffered_cnt~0)} [177] L756-1-->L3: Formula: (and (let ((.cse0 (= 2 v_~__unbuffered_cnt~0_56))) (or (and (not .cse0) (= 0 v_~main$tmp_guard0~0_23)) (and .cse0 (= 1 v_~main$tmp_guard0~0_23)))) (= v_ULTIMATE.start_assume_abort_if_not_~cond_15 |v_ULTIMATE.start_assume_abort_if_not_#in~cond_16|) (= (mod v_~main$tmp_guard0~0_23 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond_16|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_16|, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_15, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~nondet3, ~main$tmp_guard0~0] {215#(and (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)))} is VALID [2020-07-28 21:47:50,485 INFO L280 TraceCheckUtils]: 5: Hoare triple {215#(and (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)))} [182] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~main$tmp_guard1~0_27) (not (= 0 v_ULTIMATE.start_assume_abort_if_not_~cond_26)) (= 0 v_~__unbuffered_p0_EAX~0_31) (= 0 v_~__unbuffered_p1_EAX~0_36) (= 0 v_ULTIMATE.start___VERIFIER_assert_~expression_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] {213#false} is VALID [2020-07-28 21:47:50,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 21:47:50,488 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168558408] [2020-07-28 21:47:50,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 21:47:50,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 21:47:50,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993401920] [2020-07-28 21:47:50,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-07-28 21:47:50,497 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 21:47:50,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 21:47:50,517 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:47:50,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 21:47:50,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 21:47:50,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 21:47:50,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 21:47:50,530 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 4 states. [2020-07-28 21:47:50,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:47:50,660 INFO L93 Difference]: Finished difference Result 63 states and 112 transitions. [2020-07-28 21:47:50,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 21:47:50,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-07-28 21:47:50,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 21:47:50,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 21:47:50,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2020-07-28 21:47:50,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 21:47:50,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2020-07-28 21:47:50,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2020-07-28 21:47:50,728 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:47:50,740 INFO L225 Difference]: With dead ends: 63 [2020-07-28 21:47:50,740 INFO L226 Difference]: Without dead ends: 40 [2020-07-28 21:47:50,742 INFO L675 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 [2020-07-28 21:47:50,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-28 21:47:50,772 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:50,774 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:50,774 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:50,775 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:50,775 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:50,775 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:50,776 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:50,776 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:50,776 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:50,777 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:50,777 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:50,777 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:50,778 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:50,778 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:50,778 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:50,779 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:50,779 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:50,779 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:50,780 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:50,780 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:50,780 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:50,781 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:50,781 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:50,781 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:50,782 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:50,782 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:50,783 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:50,783 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:50,784 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:50,784 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:50,785 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:50,785 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:50,786 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:50,786 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:50,787 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:50,787 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:50,788 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:50,788 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:50,788 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:50,789 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:50,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-28 21:47:50,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 21:47:50,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2020-07-28 21:47:50,791 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-28 21:47:50,791 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-28 21:47:50,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:47:50,796 INFO L93 Difference]: Finished difference Result 40 states and 66 transitions. [2020-07-28 21:47:50,796 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 66 transitions. [2020-07-28 21:47:50,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:47:50,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:47:50,798 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-28 21:47:50,798 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-28 21:47:50,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:47:50,802 INFO L93 Difference]: Finished difference Result 40 states and 66 transitions. [2020-07-28 21:47:50,802 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 66 transitions. [2020-07-28 21:47:50,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:47:50,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:47:50,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 21:47:50,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 21:47:50,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-28 21:47:50,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 66 transitions. [2020-07-28 21:47:50,809 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 66 transitions. Word has length 6 [2020-07-28 21:47:50,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 21:47:50,810 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 66 transitions. [2020-07-28 21:47:50,810 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 21:47:50,811 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 66 transitions. [2020-07-28 21:47:50,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-28 21:47:50,812 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 21:47:50,812 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 21:47:50,813 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 21:47:50,813 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 21:47:50,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 21:47:50,813 INFO L82 PathProgramCache]: Analyzing trace with hash -771561330, now seen corresponding path program 1 times [2020-07-28 21:47:50,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 21:47:50,814 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591645526] [2020-07-28 21:47:50,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 21:47:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 21:47:50,953 INFO L280 TraceCheckUtils]: 0: Hoare triple {443#true} [180] ULTIMATE.startENTRY-->L754: Formula: (let ((.cse0 (store |v_#valid_43| 0 0))) (and (= 0 |v_#NULL.base_5|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2631~0.base_19| 4) |v_#length_15|) (= 0 v_~main$tmp_guard1~0_22) (= 0 |v_#NULL.offset_5|) (= 0 |v_ULTIMATE.start_main_~#t2631~0.offset_15|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2631~0.base_19| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2631~0.base_19|) |v_ULTIMATE.start_main_~#t2631~0.offset_15| 0)) |v_#memory_int_13|) (= 0 v_~__unbuffered_cnt~0_61) (= (store .cse0 |v_ULTIMATE.start_main_~#t2631~0.base_19| 1) |v_#valid_41|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2631~0.base_19|)) (= 0 v_~main$tmp_guard0~0_26) (= 0 v_~__unbuffered_p1_EAX~0_29) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~__unbuffered_p0_EAX~0_26) (= 0 v_~x~0_18) (= 0 v_~y~0_23) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2631~0.base_19|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2631~0.base=|v_ULTIMATE.start_main_~#t2631~0.base_19|, ULTIMATE.start_main_~#t2631~0.offset=|v_ULTIMATE.start_main_~#t2631~0.offset_15|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_8|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_7|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t2632~0.base=|v_ULTIMATE.start_main_~#t2632~0.base_19|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_5|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ULTIMATE.start_main_~#t2632~0.offset=|v_ULTIMATE.start_main_~#t2632~0.offset_15|, ~y~0=v_~y~0_23, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2631~0.base, ULTIMATE.start_main_~#t2631~0.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, #NULL.offset, ULTIMATE.start_main_~#t2632~0.base, ~main$tmp_guard1~0, ~main$tmp_guard0~0, #NULL.base, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#res, #valid, #memory_int, #length, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2632~0.offset, ~y~0, ~x~0] {445#(= 0 ~__unbuffered_cnt~0)} is VALID [2020-07-28 21:47:50,954 INFO L280 TraceCheckUtils]: 1: Hoare triple {445#(= 0 ~__unbuffered_cnt~0)} [133] L754-->P0ENTRY: Formula: (and (= 0 v_P0Thread1of1ForFork0_thidvar0_2) (= 0 |v_P0Thread1of1ForFork0_#in~arg.base_3|) (= 0 |v_P0Thread1of1ForFork0_#in~arg.offset_3|)) InVars {} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_3|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_thidvar0=v_P0Thread1of1ForFork0_thidvar0_2, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_3|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_3, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_3} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#in~arg.offset, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_thidvar0, P0Thread1of1ForFork0_#in~arg.base, P0Thread1of1ForFork0_#res.base, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] {445#(= 0 ~__unbuffered_cnt~0)} is VALID [2020-07-28 21:47:50,955 INFO L280 TraceCheckUtils]: 2: Hoare triple {445#(= 0 ~__unbuffered_cnt~0)} [168] L754-1-->L756: Formula: (and (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t2632~0.base_13| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2632~0.base_13|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t2632~0.base_13|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2632~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2632~0.base_13|) |v_ULTIMATE.start_main_~#t2632~0.offset_11| 1))) (= 0 |v_ULTIMATE.start_main_~#t2632~0.offset_11|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2632~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t2632~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t2632~0.base=|v_ULTIMATE.start_main_~#t2632~0.base_13|, #length=|v_#length_11|, ULTIMATE.start_main_~#t2632~0.offset=|v_ULTIMATE.start_main_~#t2632~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #valid, #memory_int, ULTIMATE.start_main_~#t2632~0.base, #length, ULTIMATE.start_main_~#t2632~0.offset] {445#(= 0 ~__unbuffered_cnt~0)} is VALID [2020-07-28 21:47:50,956 INFO L280 TraceCheckUtils]: 3: Hoare triple {445#(= 0 ~__unbuffered_cnt~0)} [135] L756-->P1ENTRY: Formula: (and (= 1 v_P1Thread1of1ForFork1_thidvar0_2) (= 0 |v_P1Thread1of1ForFork1_#in~arg.base_3|) (= 0 |v_P1Thread1of1ForFork1_#in~arg.offset_3|)) InVars {} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_3, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_3, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_3|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_3|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_thidvar0=v_P1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1_#in~arg.base, P1Thread1of1ForFork1_#in~arg.offset, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_thidvar0] {445#(= 0 ~__unbuffered_cnt~0)} is VALID [2020-07-28 21:47:50,956 INFO L280 TraceCheckUtils]: 4: Hoare triple {445#(= 0 ~__unbuffered_cnt~0)} [144] P1ENTRY-->L729: Formula: (and (= 1 v_~x~0_4) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_~arg.base, ~x~0] {445#(= 0 ~__unbuffered_cnt~0)} is VALID [2020-07-28 21:47:50,957 INFO L280 TraceCheckUtils]: 5: Hoare triple {445#(= 0 ~__unbuffered_cnt~0)} [128] L729-->L734: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_2) InVars {~y~0=v_~y~0_2} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_2} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] {445#(= 0 ~__unbuffered_cnt~0)} is VALID [2020-07-28 21:47:50,958 INFO L280 TraceCheckUtils]: 6: Hoare triple {445#(= 0 ~__unbuffered_cnt~0)} [170] L734-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= 0 |v_P1Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_50 1) v_~__unbuffered_cnt~0_49)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] {446#(<= ~__unbuffered_cnt~0 1)} is VALID [2020-07-28 21:47:50,960 INFO L280 TraceCheckUtils]: 7: Hoare triple {446#(<= ~__unbuffered_cnt~0 1)} [177] L756-1-->L3: Formula: (and (let ((.cse0 (= 2 v_~__unbuffered_cnt~0_56))) (or (and (not .cse0) (= 0 v_~main$tmp_guard0~0_23)) (and .cse0 (= 1 v_~main$tmp_guard0~0_23)))) (= v_ULTIMATE.start_assume_abort_if_not_~cond_15 |v_ULTIMATE.start_assume_abort_if_not_#in~cond_16|) (= (mod v_~main$tmp_guard0~0_23 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond_16|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_16|, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_15, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~nondet3, ~main$tmp_guard0~0] {447#(and (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)))} is VALID [2020-07-28 21:47:50,961 INFO L280 TraceCheckUtils]: 8: Hoare triple {447#(and (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)))} [182] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~main$tmp_guard1~0_27) (not (= 0 v_ULTIMATE.start_assume_abort_if_not_~cond_26)) (= 0 v_~__unbuffered_p0_EAX~0_31) (= 0 v_~__unbuffered_p1_EAX~0_36) (= 0 v_ULTIMATE.start___VERIFIER_assert_~expression_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] {444#false} is VALID [2020-07-28 21:47:50,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 21:47:50,962 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591645526] [2020-07-28 21:47:50,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 21:47:50,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 21:47:50,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16891933] [2020-07-28 21:47:50,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-07-28 21:47:50,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 21:47:50,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 21:47:50,980 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:47:50,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 21:47:50,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 21:47:50,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 21:47:50,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-28 21:47:50,981 INFO L87 Difference]: Start difference. First operand 40 states and 66 transitions. Second operand 5 states. [2020-07-28 21:47:51,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:47:51,096 INFO L93 Difference]: Finished difference Result 35 states and 54 transitions. [2020-07-28 21:47:51,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 21:47:51,096 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-07-28 21:47:51,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 21:47:51,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 21:47:51,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2020-07-28 21:47:51,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 21:47:51,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2020-07-28 21:47:51,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 29 transitions. [2020-07-28 21:47:51,134 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:47:51,135 INFO L225 Difference]: With dead ends: 35 [2020-07-28 21:47:51,135 INFO L226 Difference]: Without dead ends: 28 [2020-07-28 21:47:51,136 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-28 21:47:51,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-28 21:47:51,138 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,138 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,139 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,139 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,139 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,139 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,140 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,140 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,140 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,140 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,141 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,141 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,141 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,141 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,142 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,142 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,142 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,143 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,143 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,143 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,143 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,144 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,144 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,144 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,144 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,145 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,145 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,146 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-28 21:47:51,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 21:47:51,146 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-28 21:47:51,147 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-28 21:47:51,147 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-28 21:47:51,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:47:51,149 INFO L93 Difference]: Finished difference Result 28 states and 42 transitions. [2020-07-28 21:47:51,150 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 42 transitions. [2020-07-28 21:47:51,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:47:51,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:47:51,151 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-28 21:47:51,151 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-28 21:47:51,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:47:51,153 INFO L93 Difference]: Finished difference Result 28 states and 42 transitions. [2020-07-28 21:47:51,153 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 42 transitions. [2020-07-28 21:47:51,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:47:51,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:47:51,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 21:47:51,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 21:47:51,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-28 21:47:51,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2020-07-28 21:47:51,157 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 42 transitions. Word has length 9 [2020-07-28 21:47:51,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 21:47:51,157 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 42 transitions. [2020-07-28 21:47:51,158 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 21:47:51,158 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 42 transitions. [2020-07-28 21:47:51,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-28 21:47:51,159 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 21:47:51,159 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 21:47:51,159 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 21:47:51,159 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 21:47:51,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 21:47:51,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1059449318, now seen corresponding path program 1 times [2020-07-28 21:47:51,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 21:47:51,161 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003945904] [2020-07-28 21:47:51,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 21:47:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 21:47:51,229 INFO L280 TraceCheckUtils]: 0: Hoare triple {599#true} [180] ULTIMATE.startENTRY-->L754: Formula: (let ((.cse0 (store |v_#valid_43| 0 0))) (and (= 0 |v_#NULL.base_5|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2631~0.base_19| 4) |v_#length_15|) (= 0 v_~main$tmp_guard1~0_22) (= 0 |v_#NULL.offset_5|) (= 0 |v_ULTIMATE.start_main_~#t2631~0.offset_15|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2631~0.base_19| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2631~0.base_19|) |v_ULTIMATE.start_main_~#t2631~0.offset_15| 0)) |v_#memory_int_13|) (= 0 v_~__unbuffered_cnt~0_61) (= (store .cse0 |v_ULTIMATE.start_main_~#t2631~0.base_19| 1) |v_#valid_41|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2631~0.base_19|)) (= 0 v_~main$tmp_guard0~0_26) (= 0 v_~__unbuffered_p1_EAX~0_29) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~__unbuffered_p0_EAX~0_26) (= 0 v_~x~0_18) (= 0 v_~y~0_23) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2631~0.base_19|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2631~0.base=|v_ULTIMATE.start_main_~#t2631~0.base_19|, ULTIMATE.start_main_~#t2631~0.offset=|v_ULTIMATE.start_main_~#t2631~0.offset_15|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_8|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_7|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t2632~0.base=|v_ULTIMATE.start_main_~#t2632~0.base_19|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_5|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ULTIMATE.start_main_~#t2632~0.offset=|v_ULTIMATE.start_main_~#t2632~0.offset_15|, ~y~0=v_~y~0_23, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2631~0.base, ULTIMATE.start_main_~#t2631~0.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, #NULL.offset, ULTIMATE.start_main_~#t2632~0.base, ~main$tmp_guard1~0, ~main$tmp_guard0~0, #NULL.base, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#res, #valid, #memory_int, #length, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2632~0.offset, ~y~0, ~x~0] {599#true} is VALID [2020-07-28 21:47:51,229 INFO L280 TraceCheckUtils]: 1: Hoare triple {599#true} [133] L754-->P0ENTRY: Formula: (and (= 0 v_P0Thread1of1ForFork0_thidvar0_2) (= 0 |v_P0Thread1of1ForFork0_#in~arg.base_3|) (= 0 |v_P0Thread1of1ForFork0_#in~arg.offset_3|)) InVars {} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_3|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_thidvar0=v_P0Thread1of1ForFork0_thidvar0_2, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_3|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_3, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_3} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#in~arg.offset, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_thidvar0, P0Thread1of1ForFork0_#in~arg.base, P0Thread1of1ForFork0_#res.base, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] {599#true} is VALID [2020-07-28 21:47:51,230 INFO L280 TraceCheckUtils]: 2: Hoare triple {599#true} [168] L754-1-->L756: Formula: (and (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t2632~0.base_13| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2632~0.base_13|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t2632~0.base_13|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2632~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2632~0.base_13|) |v_ULTIMATE.start_main_~#t2632~0.offset_11| 1))) (= 0 |v_ULTIMATE.start_main_~#t2632~0.offset_11|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2632~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t2632~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t2632~0.base=|v_ULTIMATE.start_main_~#t2632~0.base_13|, #length=|v_#length_11|, ULTIMATE.start_main_~#t2632~0.offset=|v_ULTIMATE.start_main_~#t2632~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #valid, #memory_int, ULTIMATE.start_main_~#t2632~0.base, #length, ULTIMATE.start_main_~#t2632~0.offset] {599#true} is VALID [2020-07-28 21:47:51,230 INFO L280 TraceCheckUtils]: 3: Hoare triple {599#true} [135] L756-->P1ENTRY: Formula: (and (= 1 v_P1Thread1of1ForFork1_thidvar0_2) (= 0 |v_P1Thread1of1ForFork1_#in~arg.base_3|) (= 0 |v_P1Thread1of1ForFork1_#in~arg.offset_3|)) InVars {} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_3, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_3, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_3|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_3|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_thidvar0=v_P1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1_#in~arg.base, P1Thread1of1ForFork1_#in~arg.offset, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_thidvar0] {599#true} is VALID [2020-07-28 21:47:51,231 INFO L280 TraceCheckUtils]: 4: Hoare triple {599#true} [144] P1ENTRY-->L729: Formula: (and (= 1 v_~x~0_4) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_~arg.base, ~x~0] {601#(= 1 ~x~0)} is VALID [2020-07-28 21:47:51,232 INFO L280 TraceCheckUtils]: 5: Hoare triple {601#(= 1 ~x~0)} [128] L729-->L734: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_2) InVars {~y~0=v_~y~0_2} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_2} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] {601#(= 1 ~x~0)} is VALID [2020-07-28 21:47:51,232 INFO L280 TraceCheckUtils]: 6: Hoare triple {601#(= 1 ~x~0)} [170] L734-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= 0 |v_P1Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_50 1) v_~__unbuffered_cnt~0_49)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] {601#(= 1 ~x~0)} is VALID [2020-07-28 21:47:51,233 INFO L280 TraceCheckUtils]: 7: Hoare triple {601#(= 1 ~x~0)} [155] P0ENTRY-->L712: Formula: (and (= 1 v_~y~0_8) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, ~y~0=v_~y~0_8, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4} AuxVars[] AssignedVars[~y~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] {601#(= 1 ~x~0)} is VALID [2020-07-28 21:47:51,234 INFO L280 TraceCheckUtils]: 8: Hoare triple {601#(= 1 ~x~0)} [122] L712-->L717: Formula: (= v_~__unbuffered_p0_EAX~0_1 v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0] {602#(= 1 ~__unbuffered_p0_EAX~0)} is VALID [2020-07-28 21:47:51,235 INFO L280 TraceCheckUtils]: 9: Hoare triple {602#(= 1 ~__unbuffered_p0_EAX~0)} [169] L717-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_43 (+ v_~__unbuffered_cnt~0_44 1)) (= 0 |v_P0Thread1of1ForFork0_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] {602#(= 1 ~__unbuffered_p0_EAX~0)} is VALID [2020-07-28 21:47:51,235 INFO L280 TraceCheckUtils]: 10: Hoare triple {602#(= 1 ~__unbuffered_p0_EAX~0)} [177] L756-1-->L3: Formula: (and (let ((.cse0 (= 2 v_~__unbuffered_cnt~0_56))) (or (and (not .cse0) (= 0 v_~main$tmp_guard0~0_23)) (and .cse0 (= 1 v_~main$tmp_guard0~0_23)))) (= v_ULTIMATE.start_assume_abort_if_not_~cond_15 |v_ULTIMATE.start_assume_abort_if_not_#in~cond_16|) (= (mod v_~main$tmp_guard0~0_23 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond_16|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_16|, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_15, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~nondet3, ~main$tmp_guard0~0] {602#(= 1 ~__unbuffered_p0_EAX~0)} is VALID [2020-07-28 21:47:51,236 INFO L280 TraceCheckUtils]: 11: Hoare triple {602#(= 1 ~__unbuffered_p0_EAX~0)} [182] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~main$tmp_guard1~0_27) (not (= 0 v_ULTIMATE.start_assume_abort_if_not_~cond_26)) (= 0 v_~__unbuffered_p0_EAX~0_31) (= 0 v_~__unbuffered_p1_EAX~0_36) (= 0 v_ULTIMATE.start___VERIFIER_assert_~expression_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] {600#false} is VALID [2020-07-28 21:47:51,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 21:47:51,238 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003945904] [2020-07-28 21:47:51,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 21:47:51,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 21:47:51,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800442793] [2020-07-28 21:47:51,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-28 21:47:51,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 21:47:51,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 21:47:51,254 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:47:51,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 21:47:51,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 21:47:51,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 21:47:51,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 21:47:51,255 INFO L87 Difference]: Start difference. First operand 28 states and 42 transitions. Second operand 4 states. [2020-07-28 21:47:51,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:47:51,300 INFO L93 Difference]: Finished difference Result 35 states and 50 transitions. [2020-07-28 21:47:51,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 21:47:51,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-28 21:47:51,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 21:47:51,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 21:47:51,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2020-07-28 21:47:51,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 21:47:51,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2020-07-28 21:47:51,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 20 transitions. [2020-07-28 21:47:51,326 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:47:51,327 INFO L225 Difference]: With dead ends: 35 [2020-07-28 21:47:51,327 INFO L226 Difference]: Without dead ends: 22 [2020-07-28 21:47:51,327 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-28 21:47:51,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-28 21:47:51,329 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,329 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,330 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,330 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,330 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,330 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,331 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,331 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,331 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,332 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,332 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,332 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,333 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,333 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,333 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,334 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,334 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,334 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,334 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,335 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,335 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,335 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:51,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-28 21:47:51,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 21:47:51,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2020-07-28 21:47:51,337 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-28 21:47:51,337 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-28 21:47:51,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:47:51,339 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2020-07-28 21:47:51,339 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2020-07-28 21:47:51,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:47:51,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:47:51,340 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-28 21:47:51,340 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-28 21:47:51,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:47:51,342 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2020-07-28 21:47:51,342 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2020-07-28 21:47:51,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:47:51,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:47:51,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 21:47:51,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 21:47:51,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-28 21:47:51,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2020-07-28 21:47:51,345 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 12 [2020-07-28 21:47:51,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 21:47:51,345 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2020-07-28 21:47:51,345 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 21:47:51,346 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2020-07-28 21:47:51,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-28 21:47:51,346 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 21:47:51,347 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 21:47:51,347 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-28 21:47:51,347 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 21:47:51,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 21:47:51,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1252547174, now seen corresponding path program 2 times [2020-07-28 21:47:51,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 21:47:51,348 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533898266] [2020-07-28 21:47:51,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 21:47:51,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 21:47:51,401 INFO L280 TraceCheckUtils]: 0: Hoare triple {730#true} [180] ULTIMATE.startENTRY-->L754: Formula: (let ((.cse0 (store |v_#valid_43| 0 0))) (and (= 0 |v_#NULL.base_5|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2631~0.base_19| 4) |v_#length_15|) (= 0 v_~main$tmp_guard1~0_22) (= 0 |v_#NULL.offset_5|) (= 0 |v_ULTIMATE.start_main_~#t2631~0.offset_15|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2631~0.base_19| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2631~0.base_19|) |v_ULTIMATE.start_main_~#t2631~0.offset_15| 0)) |v_#memory_int_13|) (= 0 v_~__unbuffered_cnt~0_61) (= (store .cse0 |v_ULTIMATE.start_main_~#t2631~0.base_19| 1) |v_#valid_41|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2631~0.base_19|)) (= 0 v_~main$tmp_guard0~0_26) (= 0 v_~__unbuffered_p1_EAX~0_29) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~__unbuffered_p0_EAX~0_26) (= 0 v_~x~0_18) (= 0 v_~y~0_23) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2631~0.base_19|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2631~0.base=|v_ULTIMATE.start_main_~#t2631~0.base_19|, ULTIMATE.start_main_~#t2631~0.offset=|v_ULTIMATE.start_main_~#t2631~0.offset_15|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_8|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_7|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_~#t2632~0.base=|v_ULTIMATE.start_main_~#t2632~0.base_19|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_5|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ULTIMATE.start_main_~#t2632~0.offset=|v_ULTIMATE.start_main_~#t2632~0.offset_15|, ~y~0=v_~y~0_23, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2631~0.base, ULTIMATE.start_main_~#t2631~0.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, #NULL.offset, ULTIMATE.start_main_~#t2632~0.base, ~main$tmp_guard1~0, ~main$tmp_guard0~0, #NULL.base, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#res, #valid, #memory_int, #length, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2632~0.offset, ~y~0, ~x~0] {730#true} is VALID [2020-07-28 21:47:51,402 INFO L280 TraceCheckUtils]: 1: Hoare triple {730#true} [133] L754-->P0ENTRY: Formula: (and (= 0 v_P0Thread1of1ForFork0_thidvar0_2) (= 0 |v_P0Thread1of1ForFork0_#in~arg.base_3|) (= 0 |v_P0Thread1of1ForFork0_#in~arg.offset_3|)) InVars {} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_3|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_thidvar0=v_P0Thread1of1ForFork0_thidvar0_2, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_3|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_3, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_3} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#in~arg.offset, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_thidvar0, P0Thread1of1ForFork0_#in~arg.base, P0Thread1of1ForFork0_#res.base, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] {730#true} is VALID [2020-07-28 21:47:51,402 INFO L280 TraceCheckUtils]: 2: Hoare triple {730#true} [168] L754-1-->L756: Formula: (and (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t2632~0.base_13| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2632~0.base_13|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t2632~0.base_13|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2632~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2632~0.base_13|) |v_ULTIMATE.start_main_~#t2632~0.offset_11| 1))) (= 0 |v_ULTIMATE.start_main_~#t2632~0.offset_11|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2632~0.base_13| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t2632~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t2632~0.base=|v_ULTIMATE.start_main_~#t2632~0.base_13|, #length=|v_#length_11|, ULTIMATE.start_main_~#t2632~0.offset=|v_ULTIMATE.start_main_~#t2632~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #valid, #memory_int, ULTIMATE.start_main_~#t2632~0.base, #length, ULTIMATE.start_main_~#t2632~0.offset] {730#true} is VALID [2020-07-28 21:47:51,402 INFO L280 TraceCheckUtils]: 3: Hoare triple {730#true} [135] L756-->P1ENTRY: Formula: (and (= 1 v_P1Thread1of1ForFork1_thidvar0_2) (= 0 |v_P1Thread1of1ForFork1_#in~arg.base_3|) (= 0 |v_P1Thread1of1ForFork1_#in~arg.offset_3|)) InVars {} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_3, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_3, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_3|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_3|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_thidvar0=v_P1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1_#in~arg.base, P1Thread1of1ForFork1_#in~arg.offset, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_thidvar0] {730#true} is VALID [2020-07-28 21:47:51,403 INFO L280 TraceCheckUtils]: 4: Hoare triple {730#true} [155] P0ENTRY-->L712: Formula: (and (= 1 v_~y~0_8) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, ~y~0=v_~y~0_8, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4} AuxVars[] AssignedVars[~y~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] {732#(= 1 ~y~0)} is VALID [2020-07-28 21:47:51,404 INFO L280 TraceCheckUtils]: 5: Hoare triple {732#(= 1 ~y~0)} [122] L712-->L717: Formula: (= v_~__unbuffered_p0_EAX~0_1 v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0] {732#(= 1 ~y~0)} is VALID [2020-07-28 21:47:51,405 INFO L280 TraceCheckUtils]: 6: Hoare triple {732#(= 1 ~y~0)} [144] P1ENTRY-->L729: Formula: (and (= 1 v_~x~0_4) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_~arg.base, ~x~0] {732#(= 1 ~y~0)} is VALID [2020-07-28 21:47:51,405 INFO L280 TraceCheckUtils]: 7: Hoare triple {732#(= 1 ~y~0)} [128] L729-->L734: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_2) InVars {~y~0=v_~y~0_2} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_2} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] {733#(= 1 ~__unbuffered_p1_EAX~0)} is VALID [2020-07-28 21:47:51,406 INFO L280 TraceCheckUtils]: 8: Hoare triple {733#(= 1 ~__unbuffered_p1_EAX~0)} [169] L717-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_43 (+ v_~__unbuffered_cnt~0_44 1)) (= 0 |v_P0Thread1of1ForFork0_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] {733#(= 1 ~__unbuffered_p1_EAX~0)} is VALID [2020-07-28 21:47:51,407 INFO L280 TraceCheckUtils]: 9: Hoare triple {733#(= 1 ~__unbuffered_p1_EAX~0)} [170] L734-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= 0 |v_P1Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_50 1) v_~__unbuffered_cnt~0_49)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] {733#(= 1 ~__unbuffered_p1_EAX~0)} is VALID [2020-07-28 21:47:51,407 INFO L280 TraceCheckUtils]: 10: Hoare triple {733#(= 1 ~__unbuffered_p1_EAX~0)} [177] L756-1-->L3: Formula: (and (let ((.cse0 (= 2 v_~__unbuffered_cnt~0_56))) (or (and (not .cse0) (= 0 v_~main$tmp_guard0~0_23)) (and .cse0 (= 1 v_~main$tmp_guard0~0_23)))) (= v_ULTIMATE.start_assume_abort_if_not_~cond_15 |v_ULTIMATE.start_assume_abort_if_not_#in~cond_16|) (= (mod v_~main$tmp_guard0~0_23 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond_16|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_16|, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_15, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~nondet3, ~main$tmp_guard0~0] {733#(= 1 ~__unbuffered_p1_EAX~0)} is VALID [2020-07-28 21:47:51,408 INFO L280 TraceCheckUtils]: 11: Hoare triple {733#(= 1 ~__unbuffered_p1_EAX~0)} [182] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~main$tmp_guard1~0_27) (not (= 0 v_ULTIMATE.start_assume_abort_if_not_~cond_26)) (= 0 v_~__unbuffered_p0_EAX~0_31) (= 0 v_~__unbuffered_p1_EAX~0_36) (= 0 v_ULTIMATE.start___VERIFIER_assert_~expression_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] {731#false} is VALID [2020-07-28 21:47:51,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 21:47:51,409 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533898266] [2020-07-28 21:47:51,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 21:47:51,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 21:47:51,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074138495] [2020-07-28 21:47:51,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-28 21:47:51,411 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 21:47:51,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 21:47:51,425 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:47:51,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 21:47:51,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 21:47:51,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 21:47:51,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 21:47:51,426 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand 4 states. [2020-07-28 21:47:51,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:47:51,467 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2020-07-28 21:47:51,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 21:47:51,467 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-28 21:47:51,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 21:47:51,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 21:47:51,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-07-28 21:47:51,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 21:47:51,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-07-28 21:47:51,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 15 transitions. [2020-07-28 21:47:51,498 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:47:51,498 INFO L225 Difference]: With dead ends: 21 [2020-07-28 21:47:51,498 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 21:47:51,499 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-28 21:47:51,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 21:47:51,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 21:47:51,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 21:47:51,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 21:47:51,500 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 21:47:51,500 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 21:47:51,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:47:51,500 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 21:47:51,501 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 21:47:51,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:47:51,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:47:51,501 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 21:47:51,501 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 21:47:51,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:47:51,501 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 21:47:51,501 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 21:47:51,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:47:51,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:47:51,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 21:47:51,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 21:47:51,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 21:47:51,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 21:47:51,503 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2020-07-28 21:47:51,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 21:47:51,503 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 21:47:51,503 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 21:47:51,504 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 21:47:51,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:47:51,504 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-28 21:47:51,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 09:47:51 BasicIcfg [2020-07-28 21:47:51,508 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 21:47:51,509 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 21:47:51,509 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 21:47:51,509 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 21:47:51,510 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 09:47:48" (3/4) ... [2020-07-28 21:47:51,513 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 21:47:51,519 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P0 [2020-07-28 21:47:51,519 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P1 [2020-07-28 21:47:51,523 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2020-07-28 21:47:51,524 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2020-07-28 21:47:51,524 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-07-28 21:47:51,568 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 21:47:51,568 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 21:47:51,571 INFO L168 Benchmark]: Toolchain (without parser) took 4762.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 220.2 MB). Free memory was 957.5 MB in the beginning and 1.0 GB in the end (delta: -61.2 MB). Peak memory consumption was 159.0 MB. Max. memory is 11.5 GB. [2020-07-28 21:47:51,571 INFO L168 Benchmark]: CDTParser took 0.76 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 21:47:51,572 INFO L168 Benchmark]: CACSL2BoogieTranslator took 650.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -149.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2020-07-28 21:47:51,572 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 21:47:51,573 INFO L168 Benchmark]: Boogie Preprocessor took 27.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2020-07-28 21:47:51,574 INFO L168 Benchmark]: RCFGBuilder took 483.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2020-07-28 21:47:51,574 INFO L168 Benchmark]: TraceAbstraction took 3473.28 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.6 MB). Peak memory consumption was 120.8 MB. Max. memory is 11.5 GB. [2020-07-28 21:47:51,575 INFO L168 Benchmark]: Witness Printer took 59.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 21:47:51,578 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.76 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 650.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -149.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 483.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3473.28 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.6 MB). Peak memory consumption was 120.8 MB. Max. memory is 11.5 GB. * Witness Printer took 59.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.9s, 61 ProgramPointsBefore, 22 ProgramPointsAfterwards, 56 TransitionsBefore, 15 TransitionsAfterwards, 672 CoEnabledTransitionPairs, 6 FixpointIterations, 13 TrivialSequentialCompositions, 28 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 357 VarBasedMoverChecksPositive, 20 VarBasedMoverChecksNegative, 4 SemBasedMoverChecksPositive, 26 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.4s, 0 MoverChecksTotal, 1294 CheckedPairsTotal, 49 TotalNumberOfCompositions - PositiveResult [Line: 7]: 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 3 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.3s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.0s, HoareTripleCheckerStatistics: 56 SDtfs, 47 SDslu, 68 SDs, 0 SdLazy, 43 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred 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, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 895 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 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 correct! Received shutdown request...