./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe036_tso.oepc.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe036_tso.oepc.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 ff81f41a897b40f7bc26605f2e6d95846d6020bd ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 21:47:49,172 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 21:47:49,175 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 21:47:49,187 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 21:47:49,187 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 21:47:49,189 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 21:47:49,190 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 21:47:49,192 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 21:47:49,194 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 21:47:49,195 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 21:47:49,196 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 21:47:49,197 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 21:47:49,198 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 21:47:49,199 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 21:47:49,200 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 21:47:49,201 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 21:47:49,202 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 21:47:49,204 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 21:47:49,205 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 21:47:49,208 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 21:47:49,209 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 21:47:49,211 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 21:47:49,212 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 21:47:49,213 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 21:47:49,216 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 21:47:49,216 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 21:47:49,217 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 21:47:49,218 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 21:47:49,218 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 21:47:49,219 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 21:47:49,220 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 21:47:49,221 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 21:47:49,222 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 21:47:49,222 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 21:47:49,224 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 21:47:49,224 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 21:47:49,225 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 21:47:49,225 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 21:47:49,225 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 21:47:49,226 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 21:47:49,227 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 21:47:49,228 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 21:47:49,244 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 21:47:49,244 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 21:47:49,246 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 21:47:49,246 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 21:47:49,246 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 21:47:49,247 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 21:47:49,247 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 21:47:49,247 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 21:47:49,247 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 21:47:49,248 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 21:47:49,248 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 21:47:49,248 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 21:47:49,248 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 21:47:49,249 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 21:47:49,249 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 21:47:49,249 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 21:47:49,250 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 21:47:49,250 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 21:47:49,250 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 21:47:49,251 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 21:47:49,251 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 21:47:49,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 21:47:49,251 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 21:47:49,252 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 21:47:49,252 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 21:47:49,252 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 21:47:49,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 21:47:49,253 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 21:47:49,253 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 21:47:49,253 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 -> ff81f41a897b40f7bc26605f2e6d95846d6020bd [2020-07-28 21:47:49,535 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 21:47:49,547 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 21:47:49,551 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 21:47:49,553 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 21:47:49,553 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 21:47:49,554 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe036_tso.oepc.i [2020-07-28 21:47:49,623 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dc5e8391/16b7ea7641e546c78dcd26e3e9582e3f/FLAG0a04ee1f1 [2020-07-28 21:47:50,210 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 21:47:50,211 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe036_tso.oepc.i [2020-07-28 21:47:50,235 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dc5e8391/16b7ea7641e546c78dcd26e3e9582e3f/FLAG0a04ee1f1 [2020-07-28 21:47:50,516 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dc5e8391/16b7ea7641e546c78dcd26e3e9582e3f [2020-07-28 21:47:50,519 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 21:47:50,523 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 21:47:50,524 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 21:47:50,524 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 21:47:50,528 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 21:47:50,529 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 09:47:50" (1/1) ... [2020-07-28 21:47:50,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67c8d55e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:47:50, skipping insertion in model container [2020-07-28 21:47:50,533 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 09:47:50" (1/1) ... [2020-07-28 21:47:50,540 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 21:47:50,583 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 21:47:51,058 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 21:47:51,077 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 21:47:51,124 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 21:47:51,199 INFO L208 MainTranslator]: Completed translation [2020-07-28 21:47:51,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:47:51 WrapperNode [2020-07-28 21:47:51,200 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 21:47:51,201 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 21:47:51,201 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 21:47:51,201 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 21:47:51,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:47:51" (1/1) ... [2020-07-28 21:47:51,228 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:47:51" (1/1) ... [2020-07-28 21:47:51,255 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 21:47:51,256 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 21:47:51,256 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 21:47:51,256 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 21:47:51,266 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:47:51" (1/1) ... [2020-07-28 21:47:51,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:47:51" (1/1) ... [2020-07-28 21:47:51,269 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:47:51" (1/1) ... [2020-07-28 21:47:51,270 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:47:51" (1/1) ... [2020-07-28 21:47:51,278 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:47:51" (1/1) ... [2020-07-28 21:47:51,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:47:51" (1/1) ... [2020-07-28 21:47:51,283 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:47:51" (1/1) ... [2020-07-28 21:47:51,286 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 21:47:51,290 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 21:47:51,290 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 21:47:51,291 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 21:47:51,292 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:47:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 21:47:51,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 21:47:51,349 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-07-28 21:47:51,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 21:47:51,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 21:47:51,349 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-07-28 21:47:51,349 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-07-28 21:47:51,350 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-07-28 21:47:51,350 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-07-28 21:47:51,350 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-07-28 21:47:51,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 21:47:51,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 21:47:51,352 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-07-28 21:47:51,764 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 21:47:51,765 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-28 21:47:51,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 09:47:51 BoogieIcfgContainer [2020-07-28 21:47:51,770 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 21:47:51,772 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 21:47:51,772 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 21:47:51,775 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 21:47:51,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 09:47:50" (1/3) ... [2020-07-28 21:47:51,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d4ef8bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 09:47:51, skipping insertion in model container [2020-07-28 21:47:51,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 09:47:51" (2/3) ... [2020-07-28 21:47:51,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d4ef8bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 09:47:51, skipping insertion in model container [2020-07-28 21:47:51,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 09:47:51" (3/3) ... [2020-07-28 21:47:51,780 INFO L109 eAbstractionObserver]: Analyzing ICFG safe036_tso.oepc.i [2020-07-28 21:47:51,790 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-07-28 21:47:51,791 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 21:47:51,799 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 21:47:51,800 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-07-28 21:47:51,830 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:47:51,830 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:47:51,830 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:47:51,831 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:47:51,832 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:47:51,832 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:47:51,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:47:51,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:47:51,833 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:47:51,834 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:47:51,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:47:51,835 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:47:51,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:47:51,839 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:47:51,840 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:47:51,840 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:47:51,849 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:47:51,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:47:51,850 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:47:51,850 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-07-28 21:47:51,864 INFO L251 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-07-28 21:47:51,883 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 21:47:51,884 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 21:47:51,884 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 21:47:51,884 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 21:47:51,884 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 21:47:51,884 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 21:47:51,885 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 21:47:51,885 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 21:47:51,900 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 56 transitions, 122 flow [2020-07-28 21:47:51,902 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 61 places, 56 transitions, 122 flow [2020-07-28 21:47:51,942 INFO L129 PetriNetUnfolder]: 2/54 cut-off events. [2020-07-28 21:47:51,943 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-07-28 21:47:51,947 INFO L80 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 54 events. 2/54 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 34 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2020-07-28 21:47:51,949 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 61 places, 56 transitions, 122 flow [2020-07-28 21:47:51,968 INFO L129 PetriNetUnfolder]: 2/54 cut-off events. [2020-07-28 21:47:51,968 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-07-28 21:47:51,969 INFO L80 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 54 events. 2/54 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 34 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2020-07-28 21:47:51,971 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 672 [2020-07-28 21:47:51,972 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-07-28 21:47:53,889 INFO L206 etLargeBlockEncoding]: Checked pairs total: 1294 [2020-07-28 21:47:53,890 INFO L214 etLargeBlockEncoding]: Total number of compositions: 49 [2020-07-28 21:47:53,894 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 22 places, 15 transitions, 40 flow [2020-07-28 21:47:53,904 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 74 states. [2020-07-28 21:47:53,906 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2020-07-28 21:47:53,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-28 21:47:53,912 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 21:47:53,913 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-28 21:47:53,914 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 21:47:53,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 21:47:53,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1873752150, now seen corresponding path program 1 times [2020-07-28 21:47:53,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 21:47:53,928 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366379200] [2020-07-28 21:47:53,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 21:47:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 21:47:54,196 INFO L280 TraceCheckUtils]: 0: Hoare triple {212#true} [180] ULTIMATE.startENTRY-->L754: Formula: (let ((.cse0 (store |v_#valid_43| 0 0))) (and (= 0 |v_#NULL.base_5|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2637~0.base_19|) 0) (= 0 v_~main$tmp_guard1~0_22) (= 0 |v_ULTIMATE.start_main_~#t2637~0.offset_15|) (= 0 |v_#NULL.offset_5|) (= 0 v_~__unbuffered_cnt~0_61) (= 0 v_~main$tmp_guard0~0_26) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2637~0.base_19| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2637~0.base_19|) |v_ULTIMATE.start_main_~#t2637~0.offset_15| 0)) |v_#memory_int_13|) (= 0 v_~__unbuffered_p1_EAX~0_29) (= |v_#valid_41| (store .cse0 |v_ULTIMATE.start_main_~#t2637~0.base_19| 1)) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~__unbuffered_p0_EAX~0_26) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2637~0.base_19|) (= 0 v_~x~0_18) (= 0 v_~y~0_23) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2637~0.base_19| 4)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2637~0.base=|v_ULTIMATE.start_main_~#t2637~0.base_19|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_8|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_7|, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_~#t2637~0.offset=|v_ULTIMATE.start_main_~#t2637~0.offset_15|, #NULL.base=|v_#NULL.base_5|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2638~0.base=|v_ULTIMATE.start_main_~#t2638~0.base_19|, #length=|v_#length_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~y~0=v_~y~0_23, ~x~0=v_~x~0_18, ULTIMATE.start_main_~#t2638~0.offset=|v_ULTIMATE.start_main_~#t2638~0.offset_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2637~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_~#t2637~0.offset, #NULL.base, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t2638~0.base, #length, ~__unbuffered_cnt~0, ~y~0, ~x~0, ULTIMATE.start_main_~#t2638~0.offset] {214#(= 0 ~__unbuffered_cnt~0)} is VALID [2020-07-28 21:47:54,197 INFO L280 TraceCheckUtils]: 1: Hoare triple {214#(= 0 ~__unbuffered_cnt~0)} [133] L754-->P0ENTRY: Formula: (and (= 0 v_P0Thread1of1ForFork0_thidvar0_2) (= 0 |v_P0Thread1of1ForFork0_#in~arg.base_3|) (= 0 |v_P0Thread1of1ForFork0_#in~arg.offset_3|)) InVars {} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_3|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_thidvar0=v_P0Thread1of1ForFork0_thidvar0_2, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_3|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_3, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_3} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#in~arg.offset, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_thidvar0, P0Thread1of1ForFork0_#in~arg.base, P0Thread1of1ForFork0_#res.base, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] {214#(= 0 ~__unbuffered_cnt~0)} is VALID [2020-07-28 21:47:54,198 INFO L280 TraceCheckUtils]: 2: Hoare triple {214#(= 0 ~__unbuffered_cnt~0)} [168] L754-1-->L756: Formula: (and (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t2638~0.base_13|) 0) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2638~0.base_13| 4)) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t2638~0.base_13| 1) |v_#valid_29|) (= 0 |v_ULTIMATE.start_main_~#t2638~0.offset_11|) (not (= 0 |v_ULTIMATE.start_main_~#t2638~0.base_13|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2638~0.base_13|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2638~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2638~0.base_13|) |v_ULTIMATE.start_main_~#t2638~0.offset_11| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t2638~0.base=|v_ULTIMATE.start_main_~#t2638~0.base_13|, #length=|v_#length_11|, ULTIMATE.start_main_~#t2638~0.offset=|v_ULTIMATE.start_main_~#t2638~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #valid, #memory_int, ULTIMATE.start_main_~#t2638~0.base, #length, ULTIMATE.start_main_~#t2638~0.offset] {214#(= 0 ~__unbuffered_cnt~0)} is VALID [2020-07-28 21:47:54,199 INFO L280 TraceCheckUtils]: 3: Hoare triple {214#(= 0 ~__unbuffered_cnt~0)} [135] L756-->P1ENTRY: Formula: (and (= 1 v_P1Thread1of1ForFork1_thidvar0_2) (= 0 |v_P1Thread1of1ForFork1_#in~arg.base_3|) (= 0 |v_P1Thread1of1ForFork1_#in~arg.offset_3|)) InVars {} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_3, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_3, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_3|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_3|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_thidvar0=v_P1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1_#in~arg.base, P1Thread1of1ForFork1_#in~arg.offset, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_thidvar0] {214#(= 0 ~__unbuffered_cnt~0)} is VALID [2020-07-28 21:47:54,200 INFO L280 TraceCheckUtils]: 4: Hoare triple {214#(= 0 ~__unbuffered_cnt~0)} [177] L756-1-->L3: Formula: (and (let ((.cse0 (= 2 v_~__unbuffered_cnt~0_56))) (or (and (not .cse0) (= 0 v_~main$tmp_guard0~0_23)) (and .cse0 (= 1 v_~main$tmp_guard0~0_23)))) (= v_ULTIMATE.start_assume_abort_if_not_~cond_15 |v_ULTIMATE.start_assume_abort_if_not_#in~cond_16|) (= (mod v_~main$tmp_guard0~0_23 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond_16|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_16|, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_15, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~nondet3, ~main$tmp_guard0~0] {215#(and (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)))} is VALID [2020-07-28 21:47:54,201 INFO L280 TraceCheckUtils]: 5: Hoare triple {215#(and (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)))} [182] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~main$tmp_guard1~0_27) (not (= 0 v_ULTIMATE.start_assume_abort_if_not_~cond_26)) (= 0 v_~__unbuffered_p0_EAX~0_31) (= 0 v_~__unbuffered_p1_EAX~0_36) (= 0 v_ULTIMATE.start___VERIFIER_assert_~expression_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] {213#false} is VALID [2020-07-28 21:47:54,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 21:47:54,204 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366379200] [2020-07-28 21:47:54,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 21:47:54,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 21:47:54,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47192683] [2020-07-28 21:47:54,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-07-28 21:47:54,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 21:47:54,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 21:47:54,232 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:47:54,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 21:47:54,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 21:47:54,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 21:47:54,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 21:47:54,246 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 4 states. [2020-07-28 21:47:54,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:47:54,385 INFO L93 Difference]: Finished difference Result 63 states and 112 transitions. [2020-07-28 21:47:54,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 21:47:54,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-07-28 21:47:54,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 21:47:54,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 21:47:54,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2020-07-28 21:47:54,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 21:47:54,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2020-07-28 21:47:54,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2020-07-28 21:47:54,459 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:47:54,471 INFO L225 Difference]: With dead ends: 63 [2020-07-28 21:47:54,472 INFO L226 Difference]: Without dead ends: 40 [2020-07-28 21:47:54,473 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-28 21:47:54,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-28 21:47:54,509 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,510 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,511 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,511 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,512 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,512 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,513 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,513 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,513 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,514 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,514 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,514 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,515 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,515 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,516 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,516 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,516 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,517 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,517 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,517 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,518 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,518 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,519 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,519 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,520 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,520 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,521 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,521 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,521 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,522 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,522 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,523 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,523 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,524 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,524 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,524 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,525 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,525 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,526 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,526 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-07-28 21:47:54,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 21:47:54,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2020-07-28 21:47:54,528 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-28 21:47:54,528 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-28 21:47:54,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:47:54,533 INFO L93 Difference]: Finished difference Result 40 states and 66 transitions. [2020-07-28 21:47:54,533 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 66 transitions. [2020-07-28 21:47:54,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:47:54,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:47:54,535 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2020-07-28 21:47:54,535 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2020-07-28 21:47:54,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:47:54,540 INFO L93 Difference]: Finished difference Result 40 states and 66 transitions. [2020-07-28 21:47:54,540 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 66 transitions. [2020-07-28 21:47:54,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:47:54,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:47:54,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 21:47:54,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 21:47:54,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-28 21:47:54,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 66 transitions. [2020-07-28 21:47:54,547 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 66 transitions. Word has length 6 [2020-07-28 21:47:54,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 21:47:54,547 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 66 transitions. [2020-07-28 21:47:54,548 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 21:47:54,548 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 66 transitions. [2020-07-28 21:47:54,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-28 21:47:54,549 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 21:47:54,549 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 21:47:54,550 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 21:47:54,550 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 21:47:54,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 21:47:54,551 INFO L82 PathProgramCache]: Analyzing trace with hash -771561330, now seen corresponding path program 1 times [2020-07-28 21:47:54,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 21:47:54,551 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682267201] [2020-07-28 21:47:54,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 21:47:54,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 21:47:54,683 INFO L280 TraceCheckUtils]: 0: Hoare triple {443#true} [180] ULTIMATE.startENTRY-->L754: Formula: (let ((.cse0 (store |v_#valid_43| 0 0))) (and (= 0 |v_#NULL.base_5|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2637~0.base_19|) 0) (= 0 v_~main$tmp_guard1~0_22) (= 0 |v_ULTIMATE.start_main_~#t2637~0.offset_15|) (= 0 |v_#NULL.offset_5|) (= 0 v_~__unbuffered_cnt~0_61) (= 0 v_~main$tmp_guard0~0_26) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2637~0.base_19| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2637~0.base_19|) |v_ULTIMATE.start_main_~#t2637~0.offset_15| 0)) |v_#memory_int_13|) (= 0 v_~__unbuffered_p1_EAX~0_29) (= |v_#valid_41| (store .cse0 |v_ULTIMATE.start_main_~#t2637~0.base_19| 1)) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~__unbuffered_p0_EAX~0_26) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2637~0.base_19|) (= 0 v_~x~0_18) (= 0 v_~y~0_23) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2637~0.base_19| 4)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2637~0.base=|v_ULTIMATE.start_main_~#t2637~0.base_19|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_8|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_7|, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_~#t2637~0.offset=|v_ULTIMATE.start_main_~#t2637~0.offset_15|, #NULL.base=|v_#NULL.base_5|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2638~0.base=|v_ULTIMATE.start_main_~#t2638~0.base_19|, #length=|v_#length_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~y~0=v_~y~0_23, ~x~0=v_~x~0_18, ULTIMATE.start_main_~#t2638~0.offset=|v_ULTIMATE.start_main_~#t2638~0.offset_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2637~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_~#t2637~0.offset, #NULL.base, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t2638~0.base, #length, ~__unbuffered_cnt~0, ~y~0, ~x~0, ULTIMATE.start_main_~#t2638~0.offset] {445#(= 0 ~__unbuffered_cnt~0)} is VALID [2020-07-28 21:47:54,684 INFO L280 TraceCheckUtils]: 1: Hoare triple {445#(= 0 ~__unbuffered_cnt~0)} [133] L754-->P0ENTRY: Formula: (and (= 0 v_P0Thread1of1ForFork0_thidvar0_2) (= 0 |v_P0Thread1of1ForFork0_#in~arg.base_3|) (= 0 |v_P0Thread1of1ForFork0_#in~arg.offset_3|)) InVars {} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_3|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_thidvar0=v_P0Thread1of1ForFork0_thidvar0_2, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_3|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_3, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_3} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#in~arg.offset, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_thidvar0, P0Thread1of1ForFork0_#in~arg.base, P0Thread1of1ForFork0_#res.base, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] {445#(= 0 ~__unbuffered_cnt~0)} is VALID [2020-07-28 21:47:54,685 INFO L280 TraceCheckUtils]: 2: Hoare triple {445#(= 0 ~__unbuffered_cnt~0)} [168] L754-1-->L756: Formula: (and (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t2638~0.base_13|) 0) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2638~0.base_13| 4)) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t2638~0.base_13| 1) |v_#valid_29|) (= 0 |v_ULTIMATE.start_main_~#t2638~0.offset_11|) (not (= 0 |v_ULTIMATE.start_main_~#t2638~0.base_13|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2638~0.base_13|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2638~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2638~0.base_13|) |v_ULTIMATE.start_main_~#t2638~0.offset_11| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t2638~0.base=|v_ULTIMATE.start_main_~#t2638~0.base_13|, #length=|v_#length_11|, ULTIMATE.start_main_~#t2638~0.offset=|v_ULTIMATE.start_main_~#t2638~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #valid, #memory_int, ULTIMATE.start_main_~#t2638~0.base, #length, ULTIMATE.start_main_~#t2638~0.offset] {445#(= 0 ~__unbuffered_cnt~0)} is VALID [2020-07-28 21:47:54,686 INFO L280 TraceCheckUtils]: 3: Hoare triple {445#(= 0 ~__unbuffered_cnt~0)} [135] L756-->P1ENTRY: Formula: (and (= 1 v_P1Thread1of1ForFork1_thidvar0_2) (= 0 |v_P1Thread1of1ForFork1_#in~arg.base_3|) (= 0 |v_P1Thread1of1ForFork1_#in~arg.offset_3|)) InVars {} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_3, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_3, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_3|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_3|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_thidvar0=v_P1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1_#in~arg.base, P1Thread1of1ForFork1_#in~arg.offset, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_thidvar0] {445#(= 0 ~__unbuffered_cnt~0)} is VALID [2020-07-28 21:47:54,687 INFO L280 TraceCheckUtils]: 4: Hoare triple {445#(= 0 ~__unbuffered_cnt~0)} [144] P1ENTRY-->L729: Formula: (and (= 1 v_~x~0_4) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_~arg.base, ~x~0] {445#(= 0 ~__unbuffered_cnt~0)} is VALID [2020-07-28 21:47:54,687 INFO L280 TraceCheckUtils]: 5: Hoare triple {445#(= 0 ~__unbuffered_cnt~0)} [128] L729-->L734: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_2) InVars {~y~0=v_~y~0_2} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_2} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] {445#(= 0 ~__unbuffered_cnt~0)} is VALID [2020-07-28 21:47:54,689 INFO L280 TraceCheckUtils]: 6: Hoare triple {445#(= 0 ~__unbuffered_cnt~0)} [170] L734-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= 0 |v_P1Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_50 1) v_~__unbuffered_cnt~0_49)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] {446#(<= ~__unbuffered_cnt~0 1)} is VALID [2020-07-28 21:47:54,690 INFO L280 TraceCheckUtils]: 7: Hoare triple {446#(<= ~__unbuffered_cnt~0 1)} [177] L756-1-->L3: Formula: (and (let ((.cse0 (= 2 v_~__unbuffered_cnt~0_56))) (or (and (not .cse0) (= 0 v_~main$tmp_guard0~0_23)) (and .cse0 (= 1 v_~main$tmp_guard0~0_23)))) (= v_ULTIMATE.start_assume_abort_if_not_~cond_15 |v_ULTIMATE.start_assume_abort_if_not_#in~cond_16|) (= (mod v_~main$tmp_guard0~0_23 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond_16|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_16|, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_15, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~nondet3, ~main$tmp_guard0~0] {447#(and (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)))} is VALID [2020-07-28 21:47:54,692 INFO L280 TraceCheckUtils]: 8: Hoare triple {447#(and (<= ULTIMATE.start_assume_abort_if_not_~cond 0) (< 0 (+ ULTIMATE.start_assume_abort_if_not_~cond 1)))} [182] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~main$tmp_guard1~0_27) (not (= 0 v_ULTIMATE.start_assume_abort_if_not_~cond_26)) (= 0 v_~__unbuffered_p0_EAX~0_31) (= 0 v_~__unbuffered_p1_EAX~0_36) (= 0 v_ULTIMATE.start___VERIFIER_assert_~expression_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] {444#false} is VALID [2020-07-28 21:47:54,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 21:47:54,694 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682267201] [2020-07-28 21:47:54,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 21:47:54,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 21:47:54,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326367802] [2020-07-28 21:47:54,703 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-07-28 21:47:54,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 21:47:54,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 21:47:54,721 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:47:54,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 21:47:54,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 21:47:54,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 21:47:54,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-28 21:47:54,723 INFO L87 Difference]: Start difference. First operand 40 states and 66 transitions. Second operand 5 states. [2020-07-28 21:47:54,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:47:54,861 INFO L93 Difference]: Finished difference Result 35 states and 54 transitions. [2020-07-28 21:47:54,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 21:47:54,861 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-07-28 21:47:54,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 21:47:54,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 21:47:54,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2020-07-28 21:47:54,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 21:47:54,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2020-07-28 21:47:54,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 29 transitions. [2020-07-28 21:47:54,902 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:47:54,904 INFO L225 Difference]: With dead ends: 35 [2020-07-28 21:47:54,904 INFO L226 Difference]: Without dead ends: 28 [2020-07-28 21:47:54,905 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-28 21:47:54,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-28 21:47:54,907 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,908 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,908 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,908 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,908 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,909 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,909 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,909 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,910 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,910 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,910 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,911 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,911 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,911 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,912 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,912 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,912 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,913 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,913 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,913 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,914 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,914 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,914 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,915 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,915 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,915 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,916 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,916 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:54,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-28 21:47:54,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 21:47:54,917 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-28 21:47:54,917 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-28 21:47:54,917 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-28 21:47:54,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:47:54,920 INFO L93 Difference]: Finished difference Result 28 states and 42 transitions. [2020-07-28 21:47:54,920 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 42 transitions. [2020-07-28 21:47:54,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:47:54,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:47:54,921 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-28 21:47:54,921 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-28 21:47:54,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:47:54,924 INFO L93 Difference]: Finished difference Result 28 states and 42 transitions. [2020-07-28 21:47:54,924 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 42 transitions. [2020-07-28 21:47:54,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:47:54,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:47:54,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 21:47:54,926 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 21:47:54,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-28 21:47:54,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2020-07-28 21:47:54,928 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 42 transitions. Word has length 9 [2020-07-28 21:47:54,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 21:47:54,929 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 42 transitions. [2020-07-28 21:47:54,929 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 21:47:54,929 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 42 transitions. [2020-07-28 21:47:54,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-28 21:47:54,930 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 21:47:54,930 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 21:47:54,930 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 21:47:54,931 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 21:47:54,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 21:47:54,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1059449318, now seen corresponding path program 1 times [2020-07-28 21:47:54,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 21:47:54,932 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422454775] [2020-07-28 21:47:54,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 21:47:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 21:47:55,007 INFO L280 TraceCheckUtils]: 0: Hoare triple {599#true} [180] ULTIMATE.startENTRY-->L754: Formula: (let ((.cse0 (store |v_#valid_43| 0 0))) (and (= 0 |v_#NULL.base_5|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2637~0.base_19|) 0) (= 0 v_~main$tmp_guard1~0_22) (= 0 |v_ULTIMATE.start_main_~#t2637~0.offset_15|) (= 0 |v_#NULL.offset_5|) (= 0 v_~__unbuffered_cnt~0_61) (= 0 v_~main$tmp_guard0~0_26) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2637~0.base_19| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2637~0.base_19|) |v_ULTIMATE.start_main_~#t2637~0.offset_15| 0)) |v_#memory_int_13|) (= 0 v_~__unbuffered_p1_EAX~0_29) (= |v_#valid_41| (store .cse0 |v_ULTIMATE.start_main_~#t2637~0.base_19| 1)) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~__unbuffered_p0_EAX~0_26) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2637~0.base_19|) (= 0 v_~x~0_18) (= 0 v_~y~0_23) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2637~0.base_19| 4)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2637~0.base=|v_ULTIMATE.start_main_~#t2637~0.base_19|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_8|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_7|, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_~#t2637~0.offset=|v_ULTIMATE.start_main_~#t2637~0.offset_15|, #NULL.base=|v_#NULL.base_5|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2638~0.base=|v_ULTIMATE.start_main_~#t2638~0.base_19|, #length=|v_#length_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~y~0=v_~y~0_23, ~x~0=v_~x~0_18, ULTIMATE.start_main_~#t2638~0.offset=|v_ULTIMATE.start_main_~#t2638~0.offset_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2637~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_~#t2637~0.offset, #NULL.base, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t2638~0.base, #length, ~__unbuffered_cnt~0, ~y~0, ~x~0, ULTIMATE.start_main_~#t2638~0.offset] {599#true} is VALID [2020-07-28 21:47:55,008 INFO L280 TraceCheckUtils]: 1: Hoare triple {599#true} [133] L754-->P0ENTRY: Formula: (and (= 0 v_P0Thread1of1ForFork0_thidvar0_2) (= 0 |v_P0Thread1of1ForFork0_#in~arg.base_3|) (= 0 |v_P0Thread1of1ForFork0_#in~arg.offset_3|)) InVars {} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_3|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_thidvar0=v_P0Thread1of1ForFork0_thidvar0_2, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_3|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_3, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_3} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#in~arg.offset, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_thidvar0, P0Thread1of1ForFork0_#in~arg.base, P0Thread1of1ForFork0_#res.base, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] {599#true} is VALID [2020-07-28 21:47:55,008 INFO L280 TraceCheckUtils]: 2: Hoare triple {599#true} [168] L754-1-->L756: Formula: (and (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t2638~0.base_13|) 0) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2638~0.base_13| 4)) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t2638~0.base_13| 1) |v_#valid_29|) (= 0 |v_ULTIMATE.start_main_~#t2638~0.offset_11|) (not (= 0 |v_ULTIMATE.start_main_~#t2638~0.base_13|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2638~0.base_13|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2638~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2638~0.base_13|) |v_ULTIMATE.start_main_~#t2638~0.offset_11| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t2638~0.base=|v_ULTIMATE.start_main_~#t2638~0.base_13|, #length=|v_#length_11|, ULTIMATE.start_main_~#t2638~0.offset=|v_ULTIMATE.start_main_~#t2638~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #valid, #memory_int, ULTIMATE.start_main_~#t2638~0.base, #length, ULTIMATE.start_main_~#t2638~0.offset] {599#true} is VALID [2020-07-28 21:47:55,008 INFO L280 TraceCheckUtils]: 3: Hoare triple {599#true} [135] L756-->P1ENTRY: Formula: (and (= 1 v_P1Thread1of1ForFork1_thidvar0_2) (= 0 |v_P1Thread1of1ForFork1_#in~arg.base_3|) (= 0 |v_P1Thread1of1ForFork1_#in~arg.offset_3|)) InVars {} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_3, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_3, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_3|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_3|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_thidvar0=v_P1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1_#in~arg.base, P1Thread1of1ForFork1_#in~arg.offset, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_thidvar0] {599#true} is VALID [2020-07-28 21:47:55,010 INFO L280 TraceCheckUtils]: 4: Hoare triple {599#true} [144] P1ENTRY-->L729: Formula: (and (= 1 v_~x~0_4) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_~arg.base, ~x~0] {601#(= 1 ~x~0)} is VALID [2020-07-28 21:47:55,010 INFO L280 TraceCheckUtils]: 5: Hoare triple {601#(= 1 ~x~0)} [128] L729-->L734: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_2) InVars {~y~0=v_~y~0_2} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_2} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] {601#(= 1 ~x~0)} is VALID [2020-07-28 21:47:55,011 INFO L280 TraceCheckUtils]: 6: Hoare triple {601#(= 1 ~x~0)} [170] L734-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= 0 |v_P1Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_50 1) v_~__unbuffered_cnt~0_49)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] {601#(= 1 ~x~0)} is VALID [2020-07-28 21:47:55,015 INFO L280 TraceCheckUtils]: 7: Hoare triple {601#(= 1 ~x~0)} [155] P0ENTRY-->L712: Formula: (and (= 1 v_~y~0_8) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, ~y~0=v_~y~0_8, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4} AuxVars[] AssignedVars[~y~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] {601#(= 1 ~x~0)} is VALID [2020-07-28 21:47:55,016 INFO L280 TraceCheckUtils]: 8: Hoare triple {601#(= 1 ~x~0)} [122] L712-->L717: Formula: (= v_~__unbuffered_p0_EAX~0_1 v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0] {602#(= 1 ~__unbuffered_p0_EAX~0)} is VALID [2020-07-28 21:47:55,017 INFO L280 TraceCheckUtils]: 9: Hoare triple {602#(= 1 ~__unbuffered_p0_EAX~0)} [169] L717-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_43 (+ v_~__unbuffered_cnt~0_44 1)) (= 0 |v_P0Thread1of1ForFork0_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] {602#(= 1 ~__unbuffered_p0_EAX~0)} is VALID [2020-07-28 21:47:55,018 INFO L280 TraceCheckUtils]: 10: Hoare triple {602#(= 1 ~__unbuffered_p0_EAX~0)} [177] L756-1-->L3: Formula: (and (let ((.cse0 (= 2 v_~__unbuffered_cnt~0_56))) (or (and (not .cse0) (= 0 v_~main$tmp_guard0~0_23)) (and .cse0 (= 1 v_~main$tmp_guard0~0_23)))) (= v_ULTIMATE.start_assume_abort_if_not_~cond_15 |v_ULTIMATE.start_assume_abort_if_not_#in~cond_16|) (= (mod v_~main$tmp_guard0~0_23 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond_16|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_16|, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_15, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~nondet3, ~main$tmp_guard0~0] {602#(= 1 ~__unbuffered_p0_EAX~0)} is VALID [2020-07-28 21:47:55,019 INFO L280 TraceCheckUtils]: 11: Hoare triple {602#(= 1 ~__unbuffered_p0_EAX~0)} [182] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~main$tmp_guard1~0_27) (not (= 0 v_ULTIMATE.start_assume_abort_if_not_~cond_26)) (= 0 v_~__unbuffered_p0_EAX~0_31) (= 0 v_~__unbuffered_p1_EAX~0_36) (= 0 v_ULTIMATE.start___VERIFIER_assert_~expression_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] {600#false} is VALID [2020-07-28 21:47:55,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 21:47:55,020 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422454775] [2020-07-28 21:47:55,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 21:47:55,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 21:47:55,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117009255] [2020-07-28 21:47:55,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-28 21:47:55,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 21:47:55,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 21:47:55,037 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:47:55,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 21:47:55,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 21:47:55,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 21:47:55,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 21:47:55,038 INFO L87 Difference]: Start difference. First operand 28 states and 42 transitions. Second operand 4 states. [2020-07-28 21:47:55,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:47:55,103 INFO L93 Difference]: Finished difference Result 35 states and 50 transitions. [2020-07-28 21:47:55,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 21:47:55,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-28 21:47:55,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 21:47:55,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 21:47:55,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2020-07-28 21:47:55,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 21:47:55,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2020-07-28 21:47:55,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 20 transitions. [2020-07-28 21:47:55,137 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:47:55,139 INFO L225 Difference]: With dead ends: 35 [2020-07-28 21:47:55,139 INFO L226 Difference]: Without dead ends: 22 [2020-07-28 21:47:55,139 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-28 21:47:55,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-28 21:47:55,141 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:55,143 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:55,144 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:55,144 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:55,144 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:55,145 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:55,145 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:55,145 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:55,146 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:55,146 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:55,146 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:55,146 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:55,147 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:55,148 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:55,148 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:55,148 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:55,148 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:55,149 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:55,149 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:55,149 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:55,150 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:55,150 WARN L146 ateFactoryRefinement]: Check not implemented [2020-07-28 21:47:55,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-28 21:47:55,151 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 21:47:55,151 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2020-07-28 21:47:55,151 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-28 21:47:55,152 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-28 21:47:55,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:47:55,159 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2020-07-28 21:47:55,159 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2020-07-28 21:47:55,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:47:55,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:47:55,162 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-28 21:47:55,162 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-28 21:47:55,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:47:55,167 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2020-07-28 21:47:55,167 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2020-07-28 21:47:55,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:47:55,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:47:55,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 21:47:55,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 21:47:55,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-28 21:47:55,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2020-07-28 21:47:55,173 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 12 [2020-07-28 21:47:55,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 21:47:55,175 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2020-07-28 21:47:55,175 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 21:47:55,175 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2020-07-28 21:47:55,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-28 21:47:55,178 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 21:47:55,178 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 21:47:55,179 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-28 21:47:55,181 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 21:47:55,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 21:47:55,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1252547174, now seen corresponding path program 2 times [2020-07-28 21:47:55,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 21:47:55,183 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576987147] [2020-07-28 21:47:55,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 21:47:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 21:47:55,287 INFO L280 TraceCheckUtils]: 0: Hoare triple {730#true} [180] ULTIMATE.startENTRY-->L754: Formula: (let ((.cse0 (store |v_#valid_43| 0 0))) (and (= 0 |v_#NULL.base_5|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2637~0.base_19|) 0) (= 0 v_~main$tmp_guard1~0_22) (= 0 |v_ULTIMATE.start_main_~#t2637~0.offset_15|) (= 0 |v_#NULL.offset_5|) (= 0 v_~__unbuffered_cnt~0_61) (= 0 v_~main$tmp_guard0~0_26) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2637~0.base_19| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2637~0.base_19|) |v_ULTIMATE.start_main_~#t2637~0.offset_15| 0)) |v_#memory_int_13|) (= 0 v_~__unbuffered_p1_EAX~0_29) (= |v_#valid_41| (store .cse0 |v_ULTIMATE.start_main_~#t2637~0.base_19| 1)) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~__unbuffered_p0_EAX~0_26) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2637~0.base_19|) (= 0 v_~x~0_18) (= 0 v_~y~0_23) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2637~0.base_19| 4)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2637~0.base=|v_ULTIMATE.start_main_~#t2637~0.base_19|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_8|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_7|, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_~#t2637~0.offset=|v_ULTIMATE.start_main_~#t2637~0.offset_15|, #NULL.base=|v_#NULL.base_5|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_29, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2638~0.base=|v_ULTIMATE.start_main_~#t2638~0.base_19|, #length=|v_#length_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~y~0=v_~y~0_23, ~x~0=v_~x~0_18, ULTIMATE.start_main_~#t2638~0.offset=|v_ULTIMATE.start_main_~#t2638~0.offset_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2637~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_~#t2637~0.offset, #NULL.base, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t2638~0.base, #length, ~__unbuffered_cnt~0, ~y~0, ~x~0, ULTIMATE.start_main_~#t2638~0.offset] {730#true} is VALID [2020-07-28 21:47:55,288 INFO L280 TraceCheckUtils]: 1: Hoare triple {730#true} [133] L754-->P0ENTRY: Formula: (and (= 0 v_P0Thread1of1ForFork0_thidvar0_2) (= 0 |v_P0Thread1of1ForFork0_#in~arg.base_3|) (= 0 |v_P0Thread1of1ForFork0_#in~arg.offset_3|)) InVars {} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_3|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_thidvar0=v_P0Thread1of1ForFork0_thidvar0_2, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_3|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_3, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_3} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#in~arg.offset, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_thidvar0, P0Thread1of1ForFork0_#in~arg.base, P0Thread1of1ForFork0_#res.base, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] {730#true} is VALID [2020-07-28 21:47:55,288 INFO L280 TraceCheckUtils]: 2: Hoare triple {730#true} [168] L754-1-->L756: Formula: (and (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t2638~0.base_13|) 0) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2638~0.base_13| 4)) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t2638~0.base_13| 1) |v_#valid_29|) (= 0 |v_ULTIMATE.start_main_~#t2638~0.offset_11|) (not (= 0 |v_ULTIMATE.start_main_~#t2638~0.base_13|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2638~0.base_13|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2638~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2638~0.base_13|) |v_ULTIMATE.start_main_~#t2638~0.offset_11| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_6|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t2638~0.base=|v_ULTIMATE.start_main_~#t2638~0.base_13|, #length=|v_#length_11|, ULTIMATE.start_main_~#t2638~0.offset=|v_ULTIMATE.start_main_~#t2638~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #valid, #memory_int, ULTIMATE.start_main_~#t2638~0.base, #length, ULTIMATE.start_main_~#t2638~0.offset] {730#true} is VALID [2020-07-28 21:47:55,289 INFO L280 TraceCheckUtils]: 3: Hoare triple {730#true} [135] L756-->P1ENTRY: Formula: (and (= 1 v_P1Thread1of1ForFork1_thidvar0_2) (= 0 |v_P1Thread1of1ForFork1_#in~arg.base_3|) (= 0 |v_P1Thread1of1ForFork1_#in~arg.offset_3|)) InVars {} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_3, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_3, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_3|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_3|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_thidvar0=v_P1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1_#in~arg.base, P1Thread1of1ForFork1_#in~arg.offset, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_thidvar0] {730#true} is VALID [2020-07-28 21:47:55,290 INFO L280 TraceCheckUtils]: 4: Hoare triple {730#true} [155] P0ENTRY-->L712: Formula: (and (= 1 v_~y~0_8) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, ~y~0=v_~y~0_8, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4} AuxVars[] AssignedVars[~y~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] {732#(= 1 ~y~0)} is VALID [2020-07-28 21:47:55,290 INFO L280 TraceCheckUtils]: 5: Hoare triple {732#(= 1 ~y~0)} [122] L712-->L717: Formula: (= v_~__unbuffered_p0_EAX~0_1 v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{~x~0=v_~x~0_1, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_1} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0] {732#(= 1 ~y~0)} is VALID [2020-07-28 21:47:55,291 INFO L280 TraceCheckUtils]: 6: Hoare triple {732#(= 1 ~y~0)} [144] P1ENTRY-->L729: Formula: (and (= 1 v_~x~0_4) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_~arg.base, ~x~0] {732#(= 1 ~y~0)} is VALID [2020-07-28 21:47:55,292 INFO L280 TraceCheckUtils]: 7: Hoare triple {732#(= 1 ~y~0)} [128] L729-->L734: Formula: (= v_~__unbuffered_p1_EAX~0_1 v_~y~0_2) InVars {~y~0=v_~y~0_2} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_1, ~y~0=v_~y~0_2} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0] {733#(= 1 ~__unbuffered_p1_EAX~0)} is VALID [2020-07-28 21:47:55,293 INFO L280 TraceCheckUtils]: 8: Hoare triple {733#(= 1 ~__unbuffered_p1_EAX~0)} [169] L717-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_43 (+ v_~__unbuffered_cnt~0_44 1)) (= 0 |v_P0Thread1of1ForFork0_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] {733#(= 1 ~__unbuffered_p1_EAX~0)} is VALID [2020-07-28 21:47:55,293 INFO L280 TraceCheckUtils]: 9: Hoare triple {733#(= 1 ~__unbuffered_p1_EAX~0)} [170] L734-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= 0 |v_P1Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_50 1) v_~__unbuffered_cnt~0_49)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] {733#(= 1 ~__unbuffered_p1_EAX~0)} is VALID [2020-07-28 21:47:55,294 INFO L280 TraceCheckUtils]: 10: Hoare triple {733#(= 1 ~__unbuffered_p1_EAX~0)} [177] L756-1-->L3: Formula: (and (let ((.cse0 (= 2 v_~__unbuffered_cnt~0_56))) (or (and (not .cse0) (= 0 v_~main$tmp_guard0~0_23)) (and .cse0 (= 1 v_~main$tmp_guard0~0_23)))) (= v_ULTIMATE.start_assume_abort_if_not_~cond_15 |v_ULTIMATE.start_assume_abort_if_not_#in~cond_16|) (= (mod v_~main$tmp_guard0~0_23 256) |v_ULTIMATE.start_assume_abort_if_not_#in~cond_16|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond=|v_ULTIMATE.start_assume_abort_if_not_#in~cond_16|, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_15, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~nondet3, ~main$tmp_guard0~0] {733#(= 1 ~__unbuffered_p1_EAX~0)} is VALID [2020-07-28 21:47:55,295 INFO L280 TraceCheckUtils]: 11: Hoare triple {733#(= 1 ~__unbuffered_p1_EAX~0)} [182] L3-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~main$tmp_guard1~0_27) (not (= 0 v_ULTIMATE.start_assume_abort_if_not_~cond_26)) (= 0 v_~__unbuffered_p0_EAX~0_31) (= 0 v_~__unbuffered_p1_EAX~0_36) (= 0 v_ULTIMATE.start___VERIFIER_assert_~expression_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ULTIMATE.start_assume_abort_if_not_~cond=v_ULTIMATE.start_assume_abort_if_not_~cond_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] {731#false} is VALID [2020-07-28 21:47:55,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 21:47:55,296 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576987147] [2020-07-28 21:47:55,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 21:47:55,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 21:47:55,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963535204] [2020-07-28 21:47:55,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-28 21:47:55,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 21:47:55,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 21:47:55,313 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:47:55,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 21:47:55,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 21:47:55,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 21:47:55,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 21:47:55,314 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand 4 states. [2020-07-28 21:47:55,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:47:55,360 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2020-07-28 21:47:55,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 21:47:55,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-28 21:47:55,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 21:47:55,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 21:47:55,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-07-28 21:47:55,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 21:47:55,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-07-28 21:47:55,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 15 transitions. [2020-07-28 21:47:55,380 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 21:47:55,381 INFO L225 Difference]: With dead ends: 21 [2020-07-28 21:47:55,381 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 21:47:55,381 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-28 21:47:55,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 21:47:55,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 21:47:55,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 21:47:55,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 21:47:55,382 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 21:47:55,382 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 21:47:55,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:47:55,382 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 21:47:55,383 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 21:47:55,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:47:55,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:47:55,383 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 21:47:55,383 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 21:47:55,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 21:47:55,384 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 21:47:55,384 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 21:47:55,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:47:55,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 21:47:55,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 21:47:55,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 21:47:55,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 21:47:55,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 21:47:55,385 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2020-07-28 21:47:55,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 21:47:55,385 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 21:47:55,385 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 21:47:55,385 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 21:47:55,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 21:47:55,386 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-28 21:47:55,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 09:47:55 BasicIcfg [2020-07-28 21:47:55,390 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 21:47:55,390 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 21:47:55,390 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 21:47:55,390 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 21:47:55,391 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 09:47:51" (3/4) ... [2020-07-28 21:47:55,395 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 21:47:55,401 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P0 [2020-07-28 21:47:55,401 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P1 [2020-07-28 21:47:55,406 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2020-07-28 21:47:55,407 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2020-07-28 21:47:55,407 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-07-28 21:47:55,450 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 21:47:55,450 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 21:47:55,453 INFO L168 Benchmark]: Toolchain (without parser) took 4931.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 216.5 MB). Free memory was 950.8 MB in the beginning and 1.0 GB in the end (delta: -76.1 MB). Peak memory consumption was 140.4 MB. Max. memory is 11.5 GB. [2020-07-28 21:47:55,454 INFO L168 Benchmark]: CDTParser took 0.30 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:47:55,455 INFO L168 Benchmark]: CACSL2BoogieTranslator took 676.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -158.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2020-07-28 21:47:55,455 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 21:47:55,456 INFO L168 Benchmark]: Boogie Preprocessor took 31.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-28 21:47:55,456 INFO L168 Benchmark]: RCFGBuilder took 480.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2020-07-28 21:47:55,457 INFO L168 Benchmark]: TraceAbstraction took 3618.16 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.1 MB). Peak memory consumption was 120.3 MB. Max. memory is 11.5 GB. [2020-07-28 21:47:55,457 INFO L168 Benchmark]: Witness Printer took 60.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 21:47:55,461 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.30 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 676.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -158.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.75 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 31.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 480.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3618.16 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 51.1 MB). Peak memory consumption was 120.3 MB. Max. memory is 11.5 GB. * Witness Printer took 60.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.9s, 61 ProgramPointsBefore, 22 ProgramPointsAfterwards, 56 TransitionsBefore, 15 TransitionsAfterwards, 672 CoEnabledTransitionPairs, 6 FixpointIterations, 13 TrivialSequentialCompositions, 28 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 357 VarBasedMoverChecksPositive, 20 VarBasedMoverChecksNegative, 4 SemBasedMoverChecksPositive, 26 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.4s, 0 MoverChecksTotal, 1294 CheckedPairsTotal, 49 TotalNumberOfCompositions - PositiveResult [Line: 7]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.5s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.0s, HoareTripleCheckerStatistics: 56 SDtfs, 47 SDslu, 68 SDs, 0 SdLazy, 43 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 895 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...