./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe033_tso.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/safe033_tso.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 6e851af8bb6026a5a222101251cef77aa771c86a .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:46:15,041 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 21:46:15,043 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 21:46:15,062 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 21:46:15,062 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 21:46:15,065 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 21:46:15,067 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 21:46:15,078 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 21:46:15,083 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 21:46:15,087 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 21:46:15,089 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 21:46:15,091 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 21:46:15,091 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 21:46:15,094 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 21:46:15,096 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 21:46:15,097 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 21:46:15,099 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 21:46:15,100 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 21:46:15,102 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 21:46:15,106 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 21:46:15,112 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 21:46:15,115 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 21:46:15,117 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 21:46:15,118 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 21:46:15,121 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 21:46:15,121 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 21:46:15,122 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 21:46:15,123 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 21:46:15,124 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 21:46:15,125 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 21:46:15,125 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 21:46:15,126 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 21:46:15,127 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 21:46:15,128 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 21:46:15,129 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 21:46:15,129 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 21:46:15,130 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 21:46:15,131 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 21:46:15,131 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 21:46:15,132 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 21:46:15,133 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 21:46:15,134 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:46:15,170 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 21:46:15,170 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 21:46:15,171 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 21:46:15,171 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 21:46:15,171 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 21:46:15,172 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 21:46:15,172 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 21:46:15,172 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 21:46:15,172 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 21:46:15,172 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 21:46:15,172 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 21:46:15,173 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 21:46:15,173 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 21:46:15,173 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 21:46:15,173 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 21:46:15,173 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 21:46:15,174 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 21:46:15,174 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 21:46:15,174 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 21:46:15,175 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 21:46:15,175 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 21:46:15,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 21:46:15,176 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 21:46:15,176 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 21:46:15,176 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 21:46:15,176 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 21:46:15,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 21:46:15,177 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 21:46:15,177 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 21:46:15,177 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 -> 6e851af8bb6026a5a222101251cef77aa771c86a [2020-07-28 21:46:15,493 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 21:46:15,504 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 21:46:15,508 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 21:46:15,509 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 21:46:15,510 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 21:46:15,510 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe033_tso.opt.i [2020-07-28 21:46:15,569 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/556c73bb2/c67b1803caea4cc78d5bb8a72451f737/FLAG87139dc24 [2020-07-28 21:46:16,048 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 21:46:16,049 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe033_tso.opt.i [2020-07-28 21:46:16,068 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/556c73bb2/c67b1803caea4cc78d5bb8a72451f737/FLAG87139dc24 [2020-07-28 21:46:16,587 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/556c73bb2/c67b1803caea4cc78d5bb8a72451f737 [2020-07-28 21:46:16,590 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 21:46:16,593 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 21:46:16,594 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 21:46:16,594 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 21:46:16,598 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 21:46:16,599 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 09:46:16" (1/1) ... [2020-07-28 21:46:16,602 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22230e99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:46:16, skipping insertion in model container [2020-07-28 21:46:16,602 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 09:46:16" (1/1) ... [2020-07-28 21:46:16,610 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 21:46:16,659 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 21:46:17,123 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 21:46:17,138 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 21:46:17,220 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 21:46:17,303 INFO L208 MainTranslator]: Completed translation [2020-07-28 21:46:17,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:46:17 WrapperNode [2020-07-28 21:46:17,305 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 21:46:17,307 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 21:46:17,307 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 21:46:17,307 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 21:46:17,316 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:46:17" (1/1) ... [2020-07-28 21:46:17,333 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:46:17" (1/1) ... [2020-07-28 21:46:17,356 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 21:46:17,357 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 21:46:17,357 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 21:46:17,357 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 21:46:17,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:46:17" (1/1) ... [2020-07-28 21:46:17,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:46:17" (1/1) ... [2020-07-28 21:46:17,368 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:46:17" (1/1) ... [2020-07-28 21:46:17,369 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:46:17" (1/1) ... [2020-07-28 21:46:17,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:46:17" (1/1) ... [2020-07-28 21:46:17,380 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:46:17" (1/1) ... [2020-07-28 21:46:17,382 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:46:17" (1/1) ... [2020-07-28 21:46:17,385 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 21:46:17,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 21:46:17,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 21:46:17,386 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 21:46:17,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:46:17" (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:46:17,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 21:46:17,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-07-28 21:46:17,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 21:46:17,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 21:46:17,456 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-07-28 21:46:17,456 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-07-28 21:46:17,456 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-07-28 21:46:17,457 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-07-28 21:46:17,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-07-28 21:46:17,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 21:46:17,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 21:46:17,460 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:46:17,858 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 21:46:17,859 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-28 21:46:17,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 09:46:17 BoogieIcfgContainer [2020-07-28 21:46:17,864 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 21:46:17,865 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 21:46:17,865 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 21:46:17,869 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 21:46:17,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 09:46:16" (1/3) ... [2020-07-28 21:46:17,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@795b455e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 09:46:17, skipping insertion in model container [2020-07-28 21:46:17,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:46:17" (2/3) ... [2020-07-28 21:46:17,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@795b455e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 09:46:17, skipping insertion in model container [2020-07-28 21:46:17,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 09:46:17" (3/3) ... [2020-07-28 21:46:17,874 INFO L109 eAbstractionObserver]: Analyzing ICFG safe033_tso.opt.i [2020-07-28 21:46:17,886 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-07-28 21:46:17,886 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 21:46:17,894 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 21:46:17,896 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-07-28 21:46:17,928 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:46:17,929 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:46:17,929 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:46:17,929 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:46:17,930 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:46:17,930 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:46:17,931 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:46:17,931 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:46:17,932 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:46:17,932 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:46:17,933 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:46:17,933 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:46:17,937 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:46:17,938 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:46:17,938 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:46:17,938 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:46:17,945 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:46:17,945 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:46:17,946 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:46:17,946 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:46:17,965 INFO L251 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-07-28 21:46:17,984 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 21:46:17,984 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 21:46:17,984 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 21:46:17,985 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 21:46:17,985 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 21:46:17,985 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 21:46:17,985 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 21:46:17,986 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 21:46:18,001 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 55 transitions, 120 flow [2020-07-28 21:46:18,003 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 60 places, 55 transitions, 120 flow [2020-07-28 21:46:18,051 INFO L129 PetriNetUnfolder]: 2/53 cut-off events. [2020-07-28 21:46:18,052 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-07-28 21:46:18,056 INFO L80 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 53 events. 2/53 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 32 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2020-07-28 21:46:18,059 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 60 places, 55 transitions, 120 flow [2020-07-28 21:46:18,078 INFO L129 PetriNetUnfolder]: 2/53 cut-off events. [2020-07-28 21:46:18,078 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-07-28 21:46:18,079 INFO L80 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 53 events. 2/53 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 32 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2020-07-28 21:46:18,081 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 672 [2020-07-28 21:46:18,082 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-07-28 21:46:20,031 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1209 [2020-07-28 21:46:20,032 INFO L214 etLargeBlockEncoding]: Total number of compositions: 47 [2020-07-28 21:46:20,036 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 22 places, 15 transitions, 40 flow [2020-07-28 21:46:20,050 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 74 states. [2020-07-28 21:46:20,052 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2020-07-28 21:46:20,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-28 21:46:20,061 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 21:46:20,062 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-28 21:46:20,063 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 21:46:20,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 21:46:20,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1785955775, now seen corresponding path program 1 times [2020-07-28 21:46:20,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 21:46:20,078 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392908460] [2020-07-28 21:46:20,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 21:46:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 21:46:20,306 INFO L280 TraceCheckUtils]: 0: Hoare triple {211#true} [177] ULTIMATE.startENTRY-->L750: Formula: (let ((.cse0 (store |v_#valid_43| 0 0))) (and (= 0 |v_#NULL.base_5|) (= 0 v_~__unbuffered_cnt~0_60) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2575~0.base_18|)) (= 0 |v_#NULL.offset_5|) (= 0 v_~__unbuffered_p0_EAX~0_37) (= |v_#valid_41| (store .cse0 |v_ULTIMATE.start_main_~#t2575~0.base_18| 1)) (= |v_ULTIMATE.start_main_~#t2575~0.offset_14| 0) (= 0 v_~y~0_44) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2575~0.base_18|) (< 0 |v_#StackHeapBarrier_12|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2575~0.base_18| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2575~0.base_18|) |v_ULTIMATE.start_main_~#t2575~0.offset_14| 0)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2575~0.base_18| 4)) (= 0 v_~x~0_23) (= 0 v_~main$tmp_guard0~0_28) (= 0 v_~main$tmp_guard1~0_32))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2575~0.base=|v_ULTIMATE.start_main_~#t2575~0.base_18|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_7|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_20|, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, ULTIMATE.start_main_~#t2576~0.offset=|v_ULTIMATE.start_main_~#t2576~0.offset_15|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t2576~0.base=|v_ULTIMATE.start_main_~#t2576~0.base_19|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_37, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_14|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t2575~0.offset=|v_ULTIMATE.start_main_~#t2575~0.offset_14|, #length=|v_#length_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, ~y~0=v_~y~0_44, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2575~0.base, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, #NULL.offset, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2576~0.offset, #NULL.base, ULTIMATE.start_main_~#t2576~0.base, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t2575~0.offset, #length, ~__unbuffered_cnt~0, ~y~0, ~x~0] {213#(= 0 ~y~0)} is VALID [2020-07-28 21:46:20,307 INFO L280 TraceCheckUtils]: 1: Hoare triple {213#(= 0 ~y~0)} [131] L750-->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] {213#(= 0 ~y~0)} is VALID [2020-07-28 21:46:20,307 INFO L280 TraceCheckUtils]: 2: Hoare triple {213#(= 0 ~y~0)} [166] L750-1-->L752: Formula: (and (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2576~0.base_13| 1) |v_#valid_27|) (= |v_ULTIMATE.start_main_~#t2576~0.offset_11| 0) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t2576~0.base_13| 4) |v_#length_11|) (not (= 0 |v_ULTIMATE.start_main_~#t2576~0.base_13|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2576~0.base_13|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2576~0.base_13|) 0) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2576~0.base_13| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2576~0.base_13|) |v_ULTIMATE.start_main_~#t2576~0.offset_11| 1)) |v_#memory_int_7|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_8|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t2576~0.base=|v_ULTIMATE.start_main_~#t2576~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~#t2576~0.offset=|v_ULTIMATE.start_main_~#t2576~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2576~0.base, ULTIMATE.start_main_#t~nondet2, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2576~0.offset] {213#(= 0 ~y~0)} is VALID [2020-07-28 21:46:20,308 INFO L280 TraceCheckUtils]: 3: Hoare triple {213#(= 0 ~y~0)} [133] L752-->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] {213#(= 0 ~y~0)} is VALID [2020-07-28 21:46:20,309 INFO L280 TraceCheckUtils]: 4: Hoare triple {213#(= 0 ~y~0)} [165] L752-1-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond_7| (mod v_~main$tmp_guard0~0_20 256)) (let ((.cse0 (= 2 v_~__unbuffered_cnt~0_38))) (or (and (not .cse0) (= 0 v_~main$tmp_guard0~0_20)) (and .cse0 (= 1 v_~main$tmp_guard0~0_20))))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_7|, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_14, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20} 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] {213#(= 0 ~y~0)} is VALID [2020-07-28 21:46:20,309 INFO L280 TraceCheckUtils]: 5: Hoare triple {213#(= 0 ~y~0)} [178] L2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= 0 v_ULTIMATE.start_assume_abort_if_not_~cond_29)) (= v_ULTIMATE.start_assume_abort_if_not_~cond_29 |v_ULTIMATE.start_assume_abort_if_not_#in~cond_18|) (= 2 v_~y~0_47) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= 0 v_~__unbuffered_p0_EAX~0_41) (= 0 v_ULTIMATE.start___VERIFIER_assert_~expression_16) (= 0 v_~main$tmp_guard1~0_35)) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_18|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ~y~0=v_~y~0_47} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_18|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_29, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_35, ~y~0=v_~y~0_47, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_assume_abort_if_not_~cond, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] {212#false} is VALID [2020-07-28 21:46:20,311 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:46:20,312 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392908460] [2020-07-28 21:46:20,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 21:46:20,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-07-28 21:46:20,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395955092] [2020-07-28 21:46:20,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-28 21:46:20,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 21:46:20,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 21:46:20,341 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:46:20,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 21:46:20,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 21:46:20,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 21:46:20,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 21:46:20,352 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 3 states. [2020-07-28 21:46:20,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:46:20,428 INFO L93 Difference]: Finished difference Result 72 states and 154 transitions. [2020-07-28 21:46:20,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 21:46:20,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-28 21:46:20,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 21:46:20,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 21:46:20,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2020-07-28 21:46:20,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 21:46:20,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2020-07-28 21:46:20,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 21 transitions. [2020-07-28 21:46:20,464 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:46:20,477 INFO L225 Difference]: With dead ends: 72 [2020-07-28 21:46:20,478 INFO L226 Difference]: Without dead ends: 56 [2020-07-28 21:46:20,479 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 21:46:20,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-07-28 21:46:20,506 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,508 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,508 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,509 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,509 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,509 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,510 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,510 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,510 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,510 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,511 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,511 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,511 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,511 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,512 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,512 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,512 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,513 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,513 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,513 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,513 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,514 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,514 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,514 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,515 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,515 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,515 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,515 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,516 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,516 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,516 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,516 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,517 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,517 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,517 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,517 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,518 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,518 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,518 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,518 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,519 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,519 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,519 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,519 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,520 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,520 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,520 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,520 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,521 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,521 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,521 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,522 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,522 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,522 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,523 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,523 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-07-28 21:46:20,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 21:46:20,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 56 states. [2020-07-28 21:46:20,525 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2020-07-28 21:46:20,525 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2020-07-28 21:46:20,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:46:20,532 INFO L93 Difference]: Finished difference Result 56 states and 114 transitions. [2020-07-28 21:46:20,532 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 114 transitions. [2020-07-28 21:46:20,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:46:20,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:46:20,533 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2020-07-28 21:46:20,534 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2020-07-28 21:46:20,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:46:20,540 INFO L93 Difference]: Finished difference Result 56 states and 114 transitions. [2020-07-28 21:46:20,540 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 114 transitions. [2020-07-28 21:46:20,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:46:20,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:46:20,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 21:46:20,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 21:46:20,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-28 21:46:20,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 114 transitions. [2020-07-28 21:46:20,548 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 114 transitions. Word has length 6 [2020-07-28 21:46:20,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 21:46:20,549 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 114 transitions. [2020-07-28 21:46:20,549 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 21:46:20,549 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 114 transitions. [2020-07-28 21:46:20,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-28 21:46:20,550 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 21:46:20,550 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-28 21:46:20,550 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 21:46:20,550 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 21:46:20,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 21:46:20,551 INFO L82 PathProgramCache]: Analyzing trace with hash -469946389, now seen corresponding path program 1 times [2020-07-28 21:46:20,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 21:46:20,551 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672902036] [2020-07-28 21:46:20,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 21:46:20,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 21:46:20,679 INFO L280 TraceCheckUtils]: 0: Hoare triple {512#true} [177] ULTIMATE.startENTRY-->L750: Formula: (let ((.cse0 (store |v_#valid_43| 0 0))) (and (= 0 |v_#NULL.base_5|) (= 0 v_~__unbuffered_cnt~0_60) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2575~0.base_18|)) (= 0 |v_#NULL.offset_5|) (= 0 v_~__unbuffered_p0_EAX~0_37) (= |v_#valid_41| (store .cse0 |v_ULTIMATE.start_main_~#t2575~0.base_18| 1)) (= |v_ULTIMATE.start_main_~#t2575~0.offset_14| 0) (= 0 v_~y~0_44) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2575~0.base_18|) (< 0 |v_#StackHeapBarrier_12|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2575~0.base_18| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2575~0.base_18|) |v_ULTIMATE.start_main_~#t2575~0.offset_14| 0)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2575~0.base_18| 4)) (= 0 v_~x~0_23) (= 0 v_~main$tmp_guard0~0_28) (= 0 v_~main$tmp_guard1~0_32))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2575~0.base=|v_ULTIMATE.start_main_~#t2575~0.base_18|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_7|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_20|, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, ULTIMATE.start_main_~#t2576~0.offset=|v_ULTIMATE.start_main_~#t2576~0.offset_15|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t2576~0.base=|v_ULTIMATE.start_main_~#t2576~0.base_19|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_37, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_14|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t2575~0.offset=|v_ULTIMATE.start_main_~#t2575~0.offset_14|, #length=|v_#length_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, ~y~0=v_~y~0_44, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2575~0.base, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, #NULL.offset, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2576~0.offset, #NULL.base, ULTIMATE.start_main_~#t2576~0.base, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t2575~0.offset, #length, ~__unbuffered_cnt~0, ~y~0, ~x~0] {514#(= 0 ~__unbuffered_cnt~0)} is VALID [2020-07-28 21:46:20,680 INFO L280 TraceCheckUtils]: 1: Hoare triple {514#(= 0 ~__unbuffered_cnt~0)} [131] L750-->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] {514#(= 0 ~__unbuffered_cnt~0)} is VALID [2020-07-28 21:46:20,681 INFO L280 TraceCheckUtils]: 2: Hoare triple {514#(= 0 ~__unbuffered_cnt~0)} [166] L750-1-->L752: Formula: (and (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2576~0.base_13| 1) |v_#valid_27|) (= |v_ULTIMATE.start_main_~#t2576~0.offset_11| 0) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t2576~0.base_13| 4) |v_#length_11|) (not (= 0 |v_ULTIMATE.start_main_~#t2576~0.base_13|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2576~0.base_13|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2576~0.base_13|) 0) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2576~0.base_13| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2576~0.base_13|) |v_ULTIMATE.start_main_~#t2576~0.offset_11| 1)) |v_#memory_int_7|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_8|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t2576~0.base=|v_ULTIMATE.start_main_~#t2576~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~#t2576~0.offset=|v_ULTIMATE.start_main_~#t2576~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2576~0.base, ULTIMATE.start_main_#t~nondet2, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2576~0.offset] {514#(= 0 ~__unbuffered_cnt~0)} is VALID [2020-07-28 21:46:20,681 INFO L280 TraceCheckUtils]: 3: Hoare triple {514#(= 0 ~__unbuffered_cnt~0)} [133] L752-->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] {514#(= 0 ~__unbuffered_cnt~0)} is VALID [2020-07-28 21:46:20,682 INFO L280 TraceCheckUtils]: 4: Hoare triple {514#(= 0 ~__unbuffered_cnt~0)} [165] L752-1-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond_7| (mod v_~main$tmp_guard0~0_20 256)) (let ((.cse0 (= 2 v_~__unbuffered_cnt~0_38))) (or (and (not .cse0) (= 0 v_~main$tmp_guard0~0_20)) (and .cse0 (= 1 v_~main$tmp_guard0~0_20))))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_7|, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_14, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20} 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] {515#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|))} is VALID [2020-07-28 21:46:20,683 INFO L280 TraceCheckUtils]: 5: Hoare triple {515#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|))} [154] P0ENTRY-->L710: Formula: (and (= 2 v_~y~0_16) (= 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_16, 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] {515#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|))} is VALID [2020-07-28 21:46:20,684 INFO L280 TraceCheckUtils]: 6: Hoare triple {515#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|))} [178] L2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= 0 v_ULTIMATE.start_assume_abort_if_not_~cond_29)) (= v_ULTIMATE.start_assume_abort_if_not_~cond_29 |v_ULTIMATE.start_assume_abort_if_not_#in~cond_18|) (= 2 v_~y~0_47) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= 0 v_~__unbuffered_p0_EAX~0_41) (= 0 v_ULTIMATE.start___VERIFIER_assert_~expression_16) (= 0 v_~main$tmp_guard1~0_35)) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_18|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ~y~0=v_~y~0_47} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_18|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_29, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_35, ~y~0=v_~y~0_47, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_assume_abort_if_not_~cond, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] {513#false} is VALID [2020-07-28 21:46:20,685 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:46:20,686 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672902036] [2020-07-28 21:46:20,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 21:46:20,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 21:46:20,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410810990] [2020-07-28 21:46:20,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-28 21:46:20,688 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 21:46:20,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 21:46:20,700 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:46:20,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 21:46:20,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 21:46:20,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 21:46:20,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 21:46:20,701 INFO L87 Difference]: Start difference. First operand 56 states and 114 transitions. Second operand 4 states. [2020-07-28 21:46:20,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:46:20,796 INFO L93 Difference]: Finished difference Result 56 states and 99 transitions. [2020-07-28 21:46:20,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 21:46:20,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-28 21:46:20,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 21:46:20,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 21:46:20,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2020-07-28 21:46:20,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 21:46:20,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2020-07-28 21:46:20,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2020-07-28 21:46:20,849 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:46:20,850 INFO L225 Difference]: With dead ends: 56 [2020-07-28 21:46:20,851 INFO L226 Difference]: Without dead ends: 40 [2020-07-28 21:46:20,852 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:46:20,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-28 21:46:20,855 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,855 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,855 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,856 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,856 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,856 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,856 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,857 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,857 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,857 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,857 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,858 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,858 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,858 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,858 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,859 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,859 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,859 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,859 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,860 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,860 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,860 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,860 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,860 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,861 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,861 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,861 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,862 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,862 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,862 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,862 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,862 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,863 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,863 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,863 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,863 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,864 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,864 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,864 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,865 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:20,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-28 21:46:20,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 21:46:20,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2020-07-28 21:46:20,865 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-28 21:46:20,865 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-28 21:46:20,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:46:20,868 INFO L93 Difference]: Finished difference Result 40 states and 66 transitions. [2020-07-28 21:46:20,868 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 66 transitions. [2020-07-28 21:46:20,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:46:20,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:46:20,869 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-28 21:46:20,869 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-28 21:46:20,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:46:20,872 INFO L93 Difference]: Finished difference Result 40 states and 66 transitions. [2020-07-28 21:46:20,873 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 66 transitions. [2020-07-28 21:46:20,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:46:20,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:46:20,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 21:46:20,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 21:46:20,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-28 21:46:20,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 66 transitions. [2020-07-28 21:46:20,876 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 66 transitions. Word has length 7 [2020-07-28 21:46:20,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 21:46:20,876 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 66 transitions. [2020-07-28 21:46:20,877 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 21:46:20,877 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 66 transitions. [2020-07-28 21:46:20,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-28 21:46:20,877 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 21:46:20,878 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 21:46:20,878 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 21:46:20,878 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 21:46:20,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 21:46:20,878 INFO L82 PathProgramCache]: Analyzing trace with hash -658099301, now seen corresponding path program 1 times [2020-07-28 21:46:20,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 21:46:20,879 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015873766] [2020-07-28 21:46:20,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 21:46:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 21:46:21,002 INFO L280 TraceCheckUtils]: 0: Hoare triple {736#true} [177] ULTIMATE.startENTRY-->L750: Formula: (let ((.cse0 (store |v_#valid_43| 0 0))) (and (= 0 |v_#NULL.base_5|) (= 0 v_~__unbuffered_cnt~0_60) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2575~0.base_18|)) (= 0 |v_#NULL.offset_5|) (= 0 v_~__unbuffered_p0_EAX~0_37) (= |v_#valid_41| (store .cse0 |v_ULTIMATE.start_main_~#t2575~0.base_18| 1)) (= |v_ULTIMATE.start_main_~#t2575~0.offset_14| 0) (= 0 v_~y~0_44) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2575~0.base_18|) (< 0 |v_#StackHeapBarrier_12|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2575~0.base_18| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2575~0.base_18|) |v_ULTIMATE.start_main_~#t2575~0.offset_14| 0)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2575~0.base_18| 4)) (= 0 v_~x~0_23) (= 0 v_~main$tmp_guard0~0_28) (= 0 v_~main$tmp_guard1~0_32))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2575~0.base=|v_ULTIMATE.start_main_~#t2575~0.base_18|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_7|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_20|, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, ULTIMATE.start_main_~#t2576~0.offset=|v_ULTIMATE.start_main_~#t2576~0.offset_15|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t2576~0.base=|v_ULTIMATE.start_main_~#t2576~0.base_19|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_37, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_14|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t2575~0.offset=|v_ULTIMATE.start_main_~#t2575~0.offset_14|, #length=|v_#length_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, ~y~0=v_~y~0_44, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2575~0.base, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, #NULL.offset, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2576~0.offset, #NULL.base, ULTIMATE.start_main_~#t2576~0.base, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t2575~0.offset, #length, ~__unbuffered_cnt~0, ~y~0, ~x~0] {738#(= 0 ~__unbuffered_cnt~0)} is VALID [2020-07-28 21:46:21,004 INFO L280 TraceCheckUtils]: 1: Hoare triple {738#(= 0 ~__unbuffered_cnt~0)} [131] L750-->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] {738#(= 0 ~__unbuffered_cnt~0)} is VALID [2020-07-28 21:46:21,004 INFO L280 TraceCheckUtils]: 2: Hoare triple {738#(= 0 ~__unbuffered_cnt~0)} [166] L750-1-->L752: Formula: (and (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2576~0.base_13| 1) |v_#valid_27|) (= |v_ULTIMATE.start_main_~#t2576~0.offset_11| 0) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t2576~0.base_13| 4) |v_#length_11|) (not (= 0 |v_ULTIMATE.start_main_~#t2576~0.base_13|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2576~0.base_13|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2576~0.base_13|) 0) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2576~0.base_13| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2576~0.base_13|) |v_ULTIMATE.start_main_~#t2576~0.offset_11| 1)) |v_#memory_int_7|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_8|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t2576~0.base=|v_ULTIMATE.start_main_~#t2576~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~#t2576~0.offset=|v_ULTIMATE.start_main_~#t2576~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2576~0.base, ULTIMATE.start_main_#t~nondet2, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2576~0.offset] {738#(= 0 ~__unbuffered_cnt~0)} is VALID [2020-07-28 21:46:21,006 INFO L280 TraceCheckUtils]: 3: Hoare triple {738#(= 0 ~__unbuffered_cnt~0)} [133] L752-->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] {738#(= 0 ~__unbuffered_cnt~0)} is VALID [2020-07-28 21:46:21,007 INFO L280 TraceCheckUtils]: 4: Hoare triple {738#(= 0 ~__unbuffered_cnt~0)} [154] P0ENTRY-->L710: Formula: (and (= 2 v_~y~0_16) (= 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_16, 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] {738#(= 0 ~__unbuffered_cnt~0)} is VALID [2020-07-28 21:46:21,009 INFO L280 TraceCheckUtils]: 5: Hoare triple {738#(= 0 ~__unbuffered_cnt~0)} [120] L710-->L715: 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] {738#(= 0 ~__unbuffered_cnt~0)} is VALID [2020-07-28 21:46:21,012 INFO L280 TraceCheckUtils]: 6: Hoare triple {738#(= 0 ~__unbuffered_cnt~0)} [158] L715-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_27 (+ v_~__unbuffered_cnt~0_28 1)) (= 0 |v_P0Thread1of1ForFork0_#res.offset_7|) (= 0 |v_P0Thread1of1ForFork0_#res.base_7|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] {739#(<= ~__unbuffered_cnt~0 1)} is VALID [2020-07-28 21:46:21,014 INFO L280 TraceCheckUtils]: 7: Hoare triple {739#(<= ~__unbuffered_cnt~0 1)} [165] L752-1-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond_7| (mod v_~main$tmp_guard0~0_20 256)) (let ((.cse0 (= 2 v_~__unbuffered_cnt~0_38))) (or (and (not .cse0) (= 0 v_~main$tmp_guard0~0_20)) (and .cse0 (= 1 v_~main$tmp_guard0~0_20))))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_7|, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_14, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20} 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] {740#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|))} is VALID [2020-07-28 21:46:21,017 INFO L280 TraceCheckUtils]: 8: Hoare triple {740#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|))} [178] L2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= 0 v_ULTIMATE.start_assume_abort_if_not_~cond_29)) (= v_ULTIMATE.start_assume_abort_if_not_~cond_29 |v_ULTIMATE.start_assume_abort_if_not_#in~cond_18|) (= 2 v_~y~0_47) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= 0 v_~__unbuffered_p0_EAX~0_41) (= 0 v_ULTIMATE.start___VERIFIER_assert_~expression_16) (= 0 v_~main$tmp_guard1~0_35)) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_18|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ~y~0=v_~y~0_47} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_18|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_29, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_35, ~y~0=v_~y~0_47, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_assume_abort_if_not_~cond, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] {737#false} is VALID [2020-07-28 21:46:21,018 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:46:21,018 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015873766] [2020-07-28 21:46:21,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 21:46:21,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 21:46:21,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035167284] [2020-07-28 21:46:21,019 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-07-28 21:46:21,019 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 21:46:21,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 21:46:21,055 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:46:21,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 21:46:21,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 21:46:21,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 21:46:21,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-28 21:46:21,057 INFO L87 Difference]: Start difference. First operand 40 states and 66 transitions. Second operand 5 states. [2020-07-28 21:46:21,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:46:21,162 INFO L93 Difference]: Finished difference Result 35 states and 54 transitions. [2020-07-28 21:46:21,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 21:46:21,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-07-28 21:46:21,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 21:46:21,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 21:46:21,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2020-07-28 21:46:21,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 21:46:21,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2020-07-28 21:46:21,165 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 29 transitions. [2020-07-28 21:46:21,203 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:46:21,205 INFO L225 Difference]: With dead ends: 35 [2020-07-28 21:46:21,205 INFO L226 Difference]: Without dead ends: 28 [2020-07-28 21:46:21,206 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:46:21,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-28 21:46:21,207 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,208 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,208 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,208 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,208 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,209 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,209 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,209 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,210 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,210 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,210 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,210 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,210 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,211 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,211 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,211 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,212 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,212 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,212 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,212 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,213 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,213 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,213 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,213 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,214 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,214 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,214 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,214 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-28 21:46:21,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 21:46:21,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-28 21:46:21,215 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-28 21:46:21,215 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-28 21:46:21,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:46:21,217 INFO L93 Difference]: Finished difference Result 28 states and 42 transitions. [2020-07-28 21:46:21,217 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 42 transitions. [2020-07-28 21:46:21,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:46:21,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:46:21,218 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-28 21:46:21,218 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-28 21:46:21,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:46:21,220 INFO L93 Difference]: Finished difference Result 28 states and 42 transitions. [2020-07-28 21:46:21,220 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 42 transitions. [2020-07-28 21:46:21,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:46:21,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:46:21,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 21:46:21,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 21:46:21,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-28 21:46:21,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2020-07-28 21:46:21,223 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 42 transitions. Word has length 9 [2020-07-28 21:46:21,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 21:46:21,223 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 42 transitions. [2020-07-28 21:46:21,223 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 21:46:21,223 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 42 transitions. [2020-07-28 21:46:21,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-28 21:46:21,224 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 21:46:21,224 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 21:46:21,224 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-28 21:46:21,224 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 21:46:21,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 21:46:21,225 INFO L82 PathProgramCache]: Analyzing trace with hash 967414389, now seen corresponding path program 1 times [2020-07-28 21:46:21,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 21:46:21,225 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598713143] [2020-07-28 21:46:21,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 21:46:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 21:46:21,275 INFO L280 TraceCheckUtils]: 0: Hoare triple {892#true} [177] ULTIMATE.startENTRY-->L750: Formula: (let ((.cse0 (store |v_#valid_43| 0 0))) (and (= 0 |v_#NULL.base_5|) (= 0 v_~__unbuffered_cnt~0_60) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2575~0.base_18|)) (= 0 |v_#NULL.offset_5|) (= 0 v_~__unbuffered_p0_EAX~0_37) (= |v_#valid_41| (store .cse0 |v_ULTIMATE.start_main_~#t2575~0.base_18| 1)) (= |v_ULTIMATE.start_main_~#t2575~0.offset_14| 0) (= 0 v_~y~0_44) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2575~0.base_18|) (< 0 |v_#StackHeapBarrier_12|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2575~0.base_18| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2575~0.base_18|) |v_ULTIMATE.start_main_~#t2575~0.offset_14| 0)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2575~0.base_18| 4)) (= 0 v_~x~0_23) (= 0 v_~main$tmp_guard0~0_28) (= 0 v_~main$tmp_guard1~0_32))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2575~0.base=|v_ULTIMATE.start_main_~#t2575~0.base_18|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_7|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_20|, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, ULTIMATE.start_main_~#t2576~0.offset=|v_ULTIMATE.start_main_~#t2576~0.offset_15|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t2576~0.base=|v_ULTIMATE.start_main_~#t2576~0.base_19|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_37, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_14|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t2575~0.offset=|v_ULTIMATE.start_main_~#t2575~0.offset_14|, #length=|v_#length_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, ~y~0=v_~y~0_44, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2575~0.base, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, #NULL.offset, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2576~0.offset, #NULL.base, ULTIMATE.start_main_~#t2576~0.base, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t2575~0.offset, #length, ~__unbuffered_cnt~0, ~y~0, ~x~0] {892#true} is VALID [2020-07-28 21:46:21,275 INFO L280 TraceCheckUtils]: 1: Hoare triple {892#true} [131] L750-->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] {892#true} is VALID [2020-07-28 21:46:21,276 INFO L280 TraceCheckUtils]: 2: Hoare triple {892#true} [166] L750-1-->L752: Formula: (and (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2576~0.base_13| 1) |v_#valid_27|) (= |v_ULTIMATE.start_main_~#t2576~0.offset_11| 0) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t2576~0.base_13| 4) |v_#length_11|) (not (= 0 |v_ULTIMATE.start_main_~#t2576~0.base_13|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2576~0.base_13|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2576~0.base_13|) 0) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2576~0.base_13| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2576~0.base_13|) |v_ULTIMATE.start_main_~#t2576~0.offset_11| 1)) |v_#memory_int_7|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_8|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t2576~0.base=|v_ULTIMATE.start_main_~#t2576~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~#t2576~0.offset=|v_ULTIMATE.start_main_~#t2576~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2576~0.base, ULTIMATE.start_main_#t~nondet2, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2576~0.offset] {892#true} is VALID [2020-07-28 21:46:21,276 INFO L280 TraceCheckUtils]: 3: Hoare triple {892#true} [133] L752-->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] {892#true} is VALID [2020-07-28 21:46:21,276 INFO L280 TraceCheckUtils]: 4: Hoare triple {892#true} [154] P0ENTRY-->L710: Formula: (and (= 2 v_~y~0_16) (= 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_16, 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] {892#true} is VALID [2020-07-28 21:46:21,277 INFO L280 TraceCheckUtils]: 5: Hoare triple {892#true} [120] L710-->L715: 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] {892#true} is VALID [2020-07-28 21:46:21,277 INFO L280 TraceCheckUtils]: 6: Hoare triple {892#true} [155] P1ENTRY-->L727: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|) (= 1 v_~x~0_10)) 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_10} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_~arg.base, ~x~0] {892#true} is VALID [2020-07-28 21:46:21,278 INFO L280 TraceCheckUtils]: 7: Hoare triple {892#true} [126] L727-->L730: Formula: (= v_~y~0_2 1) InVars {} OutVars{~y~0=v_~y~0_2} AuxVars[] AssignedVars[~y~0] {894#(= 1 ~y~0)} is VALID [2020-07-28 21:46:21,281 INFO L280 TraceCheckUtils]: 8: Hoare triple {894#(= 1 ~y~0)} [169] L730-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_43 (+ v_~__unbuffered_cnt~0_44 1)) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= 0 |v_P1Thread1of1ForFork1_#res.offset_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] {894#(= 1 ~y~0)} is VALID [2020-07-28 21:46:21,282 INFO L280 TraceCheckUtils]: 9: Hoare triple {894#(= 1 ~y~0)} [158] L715-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_27 (+ v_~__unbuffered_cnt~0_28 1)) (= 0 |v_P0Thread1of1ForFork0_#res.offset_7|) (= 0 |v_P0Thread1of1ForFork0_#res.base_7|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] {894#(= 1 ~y~0)} is VALID [2020-07-28 21:46:21,282 INFO L280 TraceCheckUtils]: 10: Hoare triple {894#(= 1 ~y~0)} [165] L752-1-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond_7| (mod v_~main$tmp_guard0~0_20 256)) (let ((.cse0 (= 2 v_~__unbuffered_cnt~0_38))) (or (and (not .cse0) (= 0 v_~main$tmp_guard0~0_20)) (and .cse0 (= 1 v_~main$tmp_guard0~0_20))))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_7|, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_14, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20} 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] {894#(= 1 ~y~0)} is VALID [2020-07-28 21:46:21,284 INFO L280 TraceCheckUtils]: 11: Hoare triple {894#(= 1 ~y~0)} [178] L2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= 0 v_ULTIMATE.start_assume_abort_if_not_~cond_29)) (= v_ULTIMATE.start_assume_abort_if_not_~cond_29 |v_ULTIMATE.start_assume_abort_if_not_#in~cond_18|) (= 2 v_~y~0_47) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= 0 v_~__unbuffered_p0_EAX~0_41) (= 0 v_ULTIMATE.start___VERIFIER_assert_~expression_16) (= 0 v_~main$tmp_guard1~0_35)) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_18|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ~y~0=v_~y~0_47} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_18|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_29, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_35, ~y~0=v_~y~0_47, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_assume_abort_if_not_~cond, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] {893#false} is VALID [2020-07-28 21:46:21,284 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:46:21,285 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598713143] [2020-07-28 21:46:21,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 21:46:21,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 21:46:21,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315459813] [2020-07-28 21:46:21,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-28 21:46:21,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 21:46:21,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 21:46:21,301 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:46:21,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 21:46:21,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 21:46:21,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 21:46:21,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 21:46:21,302 INFO L87 Difference]: Start difference. First operand 28 states and 42 transitions. Second operand 3 states. [2020-07-28 21:46:21,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:46:21,343 INFO L93 Difference]: Finished difference Result 35 states and 50 transitions. [2020-07-28 21:46:21,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 21:46:21,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-07-28 21:46:21,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 21:46:21,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 21:46:21,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2020-07-28 21:46:21,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 21:46:21,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2020-07-28 21:46:21,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 18 transitions. [2020-07-28 21:46:21,372 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:46:21,373 INFO L225 Difference]: With dead ends: 35 [2020-07-28 21:46:21,373 INFO L226 Difference]: Without dead ends: 16 [2020-07-28 21:46:21,373 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 21:46:21,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-28 21:46:21,375 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,375 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,375 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,376 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,376 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,376 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,376 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,376 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,377 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,377 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,377 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,377 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,378 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,378 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,378 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,378 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:46:21,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-28 21:46:21,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 21:46:21,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2020-07-28 21:46:21,379 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 21:46:21,379 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 21:46:21,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:46:21,380 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2020-07-28 21:46:21,380 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2020-07-28 21:46:21,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:46:21,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:46:21,381 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 21:46:21,381 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 21:46:21,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:46:21,382 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2020-07-28 21:46:21,382 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2020-07-28 21:46:21,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:46:21,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:46:21,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 21:46:21,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 21:46:21,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-28 21:46:21,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2020-07-28 21:46:21,384 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2020-07-28 21:46:21,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 21:46:21,384 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-07-28 21:46:21,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 21:46:21,385 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2020-07-28 21:46:21,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-28 21:46:21,385 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 21:46:21,385 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 21:46:21,385 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-28 21:46:21,386 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 21:46:21,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 21:46:21,386 INFO L82 PathProgramCache]: Analyzing trace with hash -129480839, now seen corresponding path program 2 times [2020-07-28 21:46:21,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 21:46:21,387 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409548962] [2020-07-28 21:46:21,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 21:46:21,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 21:46:21,438 INFO L280 TraceCheckUtils]: 0: Hoare triple {996#true} [177] ULTIMATE.startENTRY-->L750: Formula: (let ((.cse0 (store |v_#valid_43| 0 0))) (and (= 0 |v_#NULL.base_5|) (= 0 v_~__unbuffered_cnt~0_60) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2575~0.base_18|)) (= 0 |v_#NULL.offset_5|) (= 0 v_~__unbuffered_p0_EAX~0_37) (= |v_#valid_41| (store .cse0 |v_ULTIMATE.start_main_~#t2575~0.base_18| 1)) (= |v_ULTIMATE.start_main_~#t2575~0.offset_14| 0) (= 0 v_~y~0_44) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2575~0.base_18|) (< 0 |v_#StackHeapBarrier_12|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2575~0.base_18| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2575~0.base_18|) |v_ULTIMATE.start_main_~#t2575~0.offset_14| 0)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2575~0.base_18| 4)) (= 0 v_~x~0_23) (= 0 v_~main$tmp_guard0~0_28) (= 0 v_~main$tmp_guard1~0_32))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2575~0.base=|v_ULTIMATE.start_main_~#t2575~0.base_18|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_7|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_20|, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, ULTIMATE.start_main_~#t2576~0.offset=|v_ULTIMATE.start_main_~#t2576~0.offset_15|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t2576~0.base=|v_ULTIMATE.start_main_~#t2576~0.base_19|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_37, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_14|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t2575~0.offset=|v_ULTIMATE.start_main_~#t2575~0.offset_14|, #length=|v_#length_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, ~y~0=v_~y~0_44, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2575~0.base, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_#t~nondet3, #NULL.offset, ~main$tmp_guard1~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2576~0.offset, #NULL.base, ULTIMATE.start_main_~#t2576~0.base, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t2575~0.offset, #length, ~__unbuffered_cnt~0, ~y~0, ~x~0] {996#true} is VALID [2020-07-28 21:46:21,438 INFO L280 TraceCheckUtils]: 1: Hoare triple {996#true} [131] L750-->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] {996#true} is VALID [2020-07-28 21:46:21,438 INFO L280 TraceCheckUtils]: 2: Hoare triple {996#true} [166] L750-1-->L752: Formula: (and (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2576~0.base_13| 1) |v_#valid_27|) (= |v_ULTIMATE.start_main_~#t2576~0.offset_11| 0) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t2576~0.base_13| 4) |v_#length_11|) (not (= 0 |v_ULTIMATE.start_main_~#t2576~0.base_13|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2576~0.base_13|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2576~0.base_13|) 0) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2576~0.base_13| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2576~0.base_13|) |v_ULTIMATE.start_main_~#t2576~0.offset_11| 1)) |v_#memory_int_7|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_8|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t2576~0.base=|v_ULTIMATE.start_main_~#t2576~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_7|, #length=|v_#length_11|, ULTIMATE.start_main_~#t2576~0.offset=|v_ULTIMATE.start_main_~#t2576~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2576~0.base, ULTIMATE.start_main_#t~nondet2, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2576~0.offset] {996#true} is VALID [2020-07-28 21:46:21,439 INFO L280 TraceCheckUtils]: 3: Hoare triple {996#true} [133] L752-->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] {996#true} is VALID [2020-07-28 21:46:21,440 INFO L280 TraceCheckUtils]: 4: Hoare triple {996#true} [155] P1ENTRY-->L727: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|) (= 1 v_~x~0_10)) 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_10} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_~arg.base, ~x~0] {998#(= 1 ~x~0)} is VALID [2020-07-28 21:46:21,440 INFO L280 TraceCheckUtils]: 5: Hoare triple {998#(= 1 ~x~0)} [126] L727-->L730: Formula: (= v_~y~0_2 1) InVars {} OutVars{~y~0=v_~y~0_2} AuxVars[] AssignedVars[~y~0] {998#(= 1 ~x~0)} is VALID [2020-07-28 21:46:21,441 INFO L280 TraceCheckUtils]: 6: Hoare triple {998#(= 1 ~x~0)} [169] L730-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_43 (+ v_~__unbuffered_cnt~0_44 1)) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= 0 |v_P1Thread1of1ForFork1_#res.offset_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] {998#(= 1 ~x~0)} is VALID [2020-07-28 21:46:21,442 INFO L280 TraceCheckUtils]: 7: Hoare triple {998#(= 1 ~x~0)} [154] P0ENTRY-->L710: Formula: (and (= 2 v_~y~0_16) (= 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_16, 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] {998#(= 1 ~x~0)} is VALID [2020-07-28 21:46:21,442 INFO L280 TraceCheckUtils]: 8: Hoare triple {998#(= 1 ~x~0)} [120] L710-->L715: 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] {999#(= 1 ~__unbuffered_p0_EAX~0)} is VALID [2020-07-28 21:46:21,443 INFO L280 TraceCheckUtils]: 9: Hoare triple {999#(= 1 ~__unbuffered_p0_EAX~0)} [158] L715-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_27 (+ v_~__unbuffered_cnt~0_28 1)) (= 0 |v_P0Thread1of1ForFork0_#res.offset_7|) (= 0 |v_P0Thread1of1ForFork0_#res.base_7|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] {999#(= 1 ~__unbuffered_p0_EAX~0)} is VALID [2020-07-28 21:46:21,444 INFO L280 TraceCheckUtils]: 10: Hoare triple {999#(= 1 ~__unbuffered_p0_EAX~0)} [165] L752-1-->L2: Formula: (and (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond_7| (mod v_~main$tmp_guard0~0_20 256)) (let ((.cse0 (= 2 v_~__unbuffered_cnt~0_38))) (or (and (not .cse0) (= 0 v_~main$tmp_guard0~0_20)) (and .cse0 (= 1 v_~main$tmp_guard0~0_20))))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_7|, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_14, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20} 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] {999#(= 1 ~__unbuffered_p0_EAX~0)} is VALID [2020-07-28 21:46:21,444 INFO L280 TraceCheckUtils]: 11: Hoare triple {999#(= 1 ~__unbuffered_p0_EAX~0)} [178] L2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (not (= 0 v_ULTIMATE.start_assume_abort_if_not_~cond_29)) (= v_ULTIMATE.start_assume_abort_if_not_~cond_29 |v_ULTIMATE.start_assume_abort_if_not_#in~cond_18|) (= 2 v_~y~0_47) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= 0 v_~__unbuffered_p0_EAX~0_41) (= 0 v_ULTIMATE.start___VERIFIER_assert_~expression_16) (= 0 v_~main$tmp_guard1~0_35)) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_18|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ~y~0=v_~y~0_47} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_18|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_29, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_35, ~y~0=v_~y~0_47, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_assume_abort_if_not_~cond, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] {997#false} is VALID [2020-07-28 21:46:21,445 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:46:21,445 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409548962] [2020-07-28 21:46:21,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 21:46:21,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 21:46:21,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281675163] [2020-07-28 21:46:21,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-28 21:46:21,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 21:46:21,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 21:46:21,461 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:46:21,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 21:46:21,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 21:46:21,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 21:46:21,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 21:46:21,462 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 4 states. [2020-07-28 21:46:21,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:46:21,499 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2020-07-28 21:46:21,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 21:46:21,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-28 21:46:21,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 21:46:21,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 21:46:21,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2020-07-28 21:46:21,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 21:46:21,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2020-07-28 21:46:21,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 13 transitions. [2020-07-28 21:46:21,517 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:46:21,517 INFO L225 Difference]: With dead ends: 15 [2020-07-28 21:46:21,517 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 21:46:21,518 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:46:21,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 21:46:21,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 21:46:21,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 21:46:21,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 21:46:21,519 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 21:46:21,519 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 21:46:21,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:46:21,519 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 21:46:21,519 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 21:46:21,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:46:21,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:46:21,520 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 21:46:21,520 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 21:46:21,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:46:21,520 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 21:46:21,520 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 21:46:21,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:46:21,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:46:21,521 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 21:46:21,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 21:46:21,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 21:46:21,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 21:46:21,521 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2020-07-28 21:46:21,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 21:46:21,522 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 21:46:21,522 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 21:46:21,522 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 21:46:21,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:46:21,522 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-28 21:46:21,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 09:46:21 BasicIcfg [2020-07-28 21:46:21,526 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 21:46:21,527 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 21:46:21,527 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 21:46:21,527 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 21:46:21,528 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 09:46:17" (3/4) ... [2020-07-28 21:46:21,531 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 21:46:21,537 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P0 [2020-07-28 21:46:21,537 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P1 [2020-07-28 21:46:21,542 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2020-07-28 21:46:21,543 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2020-07-28 21:46:21,543 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-07-28 21:46:21,584 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 21:46:21,584 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 21:46:21,588 INFO L168 Benchmark]: Toolchain (without parser) took 4995.16 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 224.9 MB). Free memory was 952.2 MB in the beginning and 1.0 GB in the end (delta: -88.1 MB). Peak memory consumption was 136.9 MB. Max. memory is 11.5 GB. [2020-07-28 21:46:21,588 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 21:46:21,589 INFO L168 Benchmark]: CACSL2BoogieTranslator took 711.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -158.1 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2020-07-28 21:46:21,589 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.79 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:46:21,590 INFO L168 Benchmark]: Boogie Preprocessor took 29.01 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:46:21,590 INFO L168 Benchmark]: RCFGBuilder took 477.81 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: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. [2020-07-28 21:46:21,591 INFO L168 Benchmark]: TraceAbstraction took 3661.18 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 81.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 37.6 MB). Peak memory consumption was 118.9 MB. Max. memory is 11.5 GB. [2020-07-28 21:46:21,592 INFO L168 Benchmark]: Witness Printer took 57.91 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 21:46:21,595 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.31 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 711.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -158.1 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.79 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 29.01 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. * RCFGBuilder took 477.81 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: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3661.18 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 81.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 37.6 MB). Peak memory consumption was 118.9 MB. Max. memory is 11.5 GB. * Witness Printer took 57.91 ms. Allocated memory is still 1.3 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: 2.0s, 60 ProgramPointsBefore, 22 ProgramPointsAfterwards, 55 TransitionsBefore, 15 TransitionsAfterwards, 672 CoEnabledTransitionPairs, 6 FixpointIterations, 12 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 364 VarBasedMoverChecksPositive, 21 VarBasedMoverChecksNegative, 1 SemBasedMoverChecksPositive, 29 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.5s, 0 MoverChecksTotal, 1209 CheckedPairsTotal, 47 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, 54 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.5s, OverallIterations: 5, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.0s, HoareTripleCheckerStatistics: 64 SDtfs, 38 SDslu, 64 SDs, 0 SdLazy, 45 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 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.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 46 NumberOfCodeBlocks, 46 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 41 ConstructedInterpolants, 0 QuantifiedInterpolants, 939 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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...