./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-atomic/lamport_true-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 /storage/repos/svcomp/c/pthread-atomic/lamport_true-unreach-call.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 66ad1ff9e8f4055d6bc44dc751cea83862f50a74 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 17:29:32,880 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 17:29:32,882 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 17:29:32,894 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 17:29:32,894 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 17:29:32,896 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 17:29:32,897 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 17:29:32,899 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 17:29:32,901 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 17:29:32,902 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 17:29:32,903 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 17:29:32,904 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 17:29:32,905 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 17:29:32,906 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 17:29:32,907 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 17:29:32,908 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 17:29:32,909 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 17:29:32,912 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 17:29:32,914 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 17:29:32,916 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 17:29:32,917 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 17:29:32,919 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 17:29:32,922 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 17:29:32,922 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 17:29:32,922 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 17:29:32,923 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 17:29:32,925 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 17:29:32,926 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 17:29:32,926 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 17:29:32,928 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 17:29:32,928 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 17:29:32,929 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 17:29:32,929 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 17:29:32,929 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 17:29:32,930 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 17:29:32,931 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 17:29:32,931 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 17:29:32,947 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 17:29:32,948 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 17:29:32,949 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 17:29:32,949 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 17:29:32,949 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 17:29:32,950 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 17:29:32,950 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 17:29:32,950 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 17:29:32,950 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 17:29:32,950 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 17:29:32,950 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 17:29:32,951 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 17:29:32,951 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 17:29:32,951 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 17:29:32,951 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 17:29:32,951 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 17:29:32,951 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 17:29:32,952 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 17:29:32,952 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 17:29:32,952 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 17:29:32,952 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 17:29:32,952 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 17:29:32,953 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 17:29:32,953 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 17:29:32,953 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 17:29:32,953 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 17:29:32,953 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 17:29:32,953 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 17:29:32,954 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> 66ad1ff9e8f4055d6bc44dc751cea83862f50a74 [2018-12-31 17:29:33,004 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 17:29:33,021 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 17:29:33,025 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 17:29:33,027 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 17:29:33,027 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 17:29:33,028 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-atomic/lamport_true-unreach-call.i [2018-12-31 17:29:33,092 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc1194e36/0569319350324f61967b5f0243f41a4b/FLAG1ae69e0d4 [2018-12-31 17:29:33,638 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 17:29:33,638 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-atomic/lamport_true-unreach-call.i [2018-12-31 17:29:33,650 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc1194e36/0569319350324f61967b5f0243f41a4b/FLAG1ae69e0d4 [2018-12-31 17:29:33,888 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc1194e36/0569319350324f61967b5f0243f41a4b [2018-12-31 17:29:33,891 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 17:29:33,892 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 17:29:33,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 17:29:33,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 17:29:33,898 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 17:29:33,900 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 05:29:33" (1/1) ... [2018-12-31 17:29:33,905 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d186fbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:29:33, skipping insertion in model container [2018-12-31 17:29:33,906 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 05:29:33" (1/1) ... [2018-12-31 17:29:33,916 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 17:29:33,959 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 17:29:34,380 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 17:29:34,394 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 17:29:34,548 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 17:29:34,627 INFO L195 MainTranslator]: Completed translation [2018-12-31 17:29:34,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:29:34 WrapperNode [2018-12-31 17:29:34,628 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 17:29:34,629 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 17:29:34,629 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 17:29:34,629 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 17:29:34,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:29:34" (1/1) ... [2018-12-31 17:29:34,652 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:29:34" (1/1) ... [2018-12-31 17:29:34,676 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 17:29:34,676 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 17:29:34,676 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 17:29:34,676 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 17:29:34,687 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:29:34" (1/1) ... [2018-12-31 17:29:34,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:29:34" (1/1) ... [2018-12-31 17:29:34,690 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:29:34" (1/1) ... [2018-12-31 17:29:34,691 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:29:34" (1/1) ... [2018-12-31 17:29:34,698 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:29:34" (1/1) ... [2018-12-31 17:29:34,706 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:29:34" (1/1) ... [2018-12-31 17:29:34,708 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:29:34" (1/1) ... [2018-12-31 17:29:34,712 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 17:29:34,712 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 17:29:34,712 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 17:29:34,712 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 17:29:34,713 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:29:34" (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 [2018-12-31 17:29:34,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-31 17:29:34,766 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2018-12-31 17:29:34,766 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2018-12-31 17:29:34,767 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2018-12-31 17:29:34,767 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2018-12-31 17:29:34,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 17:29:34,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 17:29:34,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 17:29:34,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 17:29:34,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 17:29:34,770 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-31 17:29:35,473 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 17:29:35,474 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2018-12-31 17:29:35,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:29:35 BoogieIcfgContainer [2018-12-31 17:29:35,474 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 17:29:35,475 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 17:29:35,476 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 17:29:35,480 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 17:29:35,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 05:29:33" (1/3) ... [2018-12-31 17:29:35,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1626460a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 05:29:35, skipping insertion in model container [2018-12-31 17:29:35,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 05:29:34" (2/3) ... [2018-12-31 17:29:35,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1626460a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 05:29:35, skipping insertion in model container [2018-12-31 17:29:35,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:29:35" (3/3) ... [2018-12-31 17:29:35,485 INFO L112 eAbstractionObserver]: Analyzing ICFG lamport_true-unreach-call.i [2018-12-31 17:29:35,520 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thr2_#in~_.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:29:35,521 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thr2_#in~_.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:29:35,521 WARN L317 ript$VariableManager]: TermVariabe Thread1_thr2_~_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:29:35,521 WARN L317 ript$VariableManager]: TermVariabe Thread1_thr2_~_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:29:35,522 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thr2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:29:35,522 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thr2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:29:35,524 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thr1_#in~_.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:29:35,524 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thr1_#in~_.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:29:35,524 WARN L317 ript$VariableManager]: TermVariabe Thread0_thr1_~_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:29:35,525 WARN L317 ript$VariableManager]: TermVariabe Thread0_thr1_~_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:29:35,525 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thr1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:29:35,525 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thr1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 17:29:35,547 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-31 17:29:35,547 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 17:29:35,558 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-12-31 17:29:35,576 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-12-31 17:29:35,603 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 17:29:35,603 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 17:29:35,604 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 17:29:35,604 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 17:29:35,604 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 17:29:35,604 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 17:29:35,604 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 17:29:35,604 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 17:29:35,605 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 17:29:35,616 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77places, 100 transitions [2018-12-31 17:29:35,723 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1816 states. [2018-12-31 17:29:35,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states. [2018-12-31 17:29:35,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 17:29:35,736 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:29:35,737 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 17:29:35,740 INFO L423 AbstractCegarLoop]: === Iteration 1 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:29:35,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:29:35,746 INFO L82 PathProgramCache]: Analyzing trace with hash -772610409, now seen corresponding path program 1 times [2018-12-31 17:29:35,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:29:35,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:29:35,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:29:35,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:29:35,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:29:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:29:35,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 17:29:35,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:29:35,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 17:29:35,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 17:29:35,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 17:29:35,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 17:29:35,947 INFO L87 Difference]: Start difference. First operand 1816 states. Second operand 2 states. [2018-12-31 17:29:36,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:29:36,029 INFO L93 Difference]: Finished difference Result 1816 states and 5404 transitions. [2018-12-31 17:29:36,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 17:29:36,031 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-12-31 17:29:36,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:29:36,088 INFO L225 Difference]: With dead ends: 1816 [2018-12-31 17:29:36,088 INFO L226 Difference]: Without dead ends: 1702 [2018-12-31 17:29:36,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 17:29:36,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2018-12-31 17:29:36,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1702. [2018-12-31 17:29:36,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1702 states. [2018-12-31 17:29:36,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 5134 transitions. [2018-12-31 17:29:36,265 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 5134 transitions. Word has length 18 [2018-12-31 17:29:36,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:29:36,265 INFO L480 AbstractCegarLoop]: Abstraction has 1702 states and 5134 transitions. [2018-12-31 17:29:36,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 17:29:36,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 5134 transitions. [2018-12-31 17:29:36,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-31 17:29:36,269 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:29:36,269 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 17:29:36,270 INFO L423 AbstractCegarLoop]: === Iteration 2 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:29:36,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:29:36,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1584356875, now seen corresponding path program 1 times [2018-12-31 17:29:36,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:29:36,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:29:36,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:29:36,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:29:36,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:29:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:29:36,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 17:29:36,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:29:36,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 17:29:36,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 17:29:36,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 17:29:36,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 17:29:36,424 INFO L87 Difference]: Start difference. First operand 1702 states and 5134 transitions. Second operand 3 states. [2018-12-31 17:29:36,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:29:36,581 INFO L93 Difference]: Finished difference Result 1687 states and 5003 transitions. [2018-12-31 17:29:36,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 17:29:36,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-31 17:29:36,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:29:36,594 INFO L225 Difference]: With dead ends: 1687 [2018-12-31 17:29:36,594 INFO L226 Difference]: Without dead ends: 1399 [2018-12-31 17:29:36,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 17:29:36,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2018-12-31 17:29:36,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1345. [2018-12-31 17:29:36,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1345 states. [2018-12-31 17:29:36,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 4069 transitions. [2018-12-31 17:29:36,649 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 4069 transitions. Word has length 24 [2018-12-31 17:29:36,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:29:36,649 INFO L480 AbstractCegarLoop]: Abstraction has 1345 states and 4069 transitions. [2018-12-31 17:29:36,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 17:29:36,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 4069 transitions. [2018-12-31 17:29:36,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-31 17:29:36,655 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:29:36,655 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 17:29:36,655 INFO L423 AbstractCegarLoop]: === Iteration 3 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:29:36,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:29:36,656 INFO L82 PathProgramCache]: Analyzing trace with hash 443111029, now seen corresponding path program 1 times [2018-12-31 17:29:36,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:29:36,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:29:36,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:29:36,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:29:36,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:29:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:29:36,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 17:29:36,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:29:36,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 17:29:36,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 17:29:36,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 17:29:36,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 17:29:36,802 INFO L87 Difference]: Start difference. First operand 1345 states and 4069 transitions. Second operand 3 states. [2018-12-31 17:29:36,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:29:36,932 INFO L93 Difference]: Finished difference Result 1255 states and 3767 transitions. [2018-12-31 17:29:36,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 17:29:36,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-31 17:29:36,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:29:36,941 INFO L225 Difference]: With dead ends: 1255 [2018-12-31 17:29:36,941 INFO L226 Difference]: Without dead ends: 952 [2018-12-31 17:29:36,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 17:29:36,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2018-12-31 17:29:36,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 952. [2018-12-31 17:29:36,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2018-12-31 17:29:36,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 2914 transitions. [2018-12-31 17:29:36,980 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 2914 transitions. Word has length 27 [2018-12-31 17:29:36,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:29:36,982 INFO L480 AbstractCegarLoop]: Abstraction has 952 states and 2914 transitions. [2018-12-31 17:29:36,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 17:29:36,982 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 2914 transitions. [2018-12-31 17:29:36,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-31 17:29:36,986 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:29:36,986 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 17:29:36,987 INFO L423 AbstractCegarLoop]: === Iteration 4 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:29:36,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:29:36,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1505967266, now seen corresponding path program 1 times [2018-12-31 17:29:36,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:29:36,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:29:36,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:29:36,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:29:36,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:29:37,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:29:37,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 17:29:37,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:29:37,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 17:29:37,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 17:29:37,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 17:29:37,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 17:29:37,093 INFO L87 Difference]: Start difference. First operand 952 states and 2914 transitions. Second operand 3 states. [2018-12-31 17:29:37,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:29:37,497 INFO L93 Difference]: Finished difference Result 1228 states and 3688 transitions. [2018-12-31 17:29:37,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 17:29:37,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-31 17:29:37,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:29:37,506 INFO L225 Difference]: With dead ends: 1228 [2018-12-31 17:29:37,506 INFO L226 Difference]: Without dead ends: 994 [2018-12-31 17:29:37,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 17:29:37,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2018-12-31 17:29:37,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 943. [2018-12-31 17:29:37,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2018-12-31 17:29:37,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 2817 transitions. [2018-12-31 17:29:37,542 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 2817 transitions. Word has length 36 [2018-12-31 17:29:37,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:29:37,542 INFO L480 AbstractCegarLoop]: Abstraction has 943 states and 2817 transitions. [2018-12-31 17:29:37,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 17:29:37,543 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 2817 transitions. [2018-12-31 17:29:37,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-31 17:29:37,547 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:29:37,547 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 17:29:37,547 INFO L423 AbstractCegarLoop]: === Iteration 5 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:29:37,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:29:37,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1422434340, now seen corresponding path program 2 times [2018-12-31 17:29:37,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:29:37,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:29:37,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:29:37,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:29:37,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:29:37,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:29:37,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 17:29:37,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:29:37,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 17:29:37,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 17:29:37,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 17:29:37,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 17:29:37,765 INFO L87 Difference]: Start difference. First operand 943 states and 2817 transitions. Second operand 4 states. [2018-12-31 17:29:37,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:29:37,867 INFO L93 Difference]: Finished difference Result 1456 states and 4146 transitions. [2018-12-31 17:29:37,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 17:29:37,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-12-31 17:29:37,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:29:37,885 INFO L225 Difference]: With dead ends: 1456 [2018-12-31 17:29:37,885 INFO L226 Difference]: Without dead ends: 1456 [2018-12-31 17:29:37,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-31 17:29:37,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2018-12-31 17:29:37,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1051. [2018-12-31 17:29:37,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1051 states. [2018-12-31 17:29:37,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 3108 transitions. [2018-12-31 17:29:37,932 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 3108 transitions. Word has length 36 [2018-12-31 17:29:37,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:29:37,935 INFO L480 AbstractCegarLoop]: Abstraction has 1051 states and 3108 transitions. [2018-12-31 17:29:37,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 17:29:37,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 3108 transitions. [2018-12-31 17:29:37,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-31 17:29:37,940 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:29:37,942 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 17:29:37,942 INFO L423 AbstractCegarLoop]: === Iteration 6 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:29:37,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:29:37,944 INFO L82 PathProgramCache]: Analyzing trace with hash -163632108, now seen corresponding path program 3 times [2018-12-31 17:29:37,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:29:37,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:29:37,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:29:37,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 17:29:37,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:29:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:29:38,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 17:29:38,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:29:38,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 17:29:38,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 17:29:38,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 17:29:38,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 17:29:38,080 INFO L87 Difference]: Start difference. First operand 1051 states and 3108 transitions. Second operand 3 states. [2018-12-31 17:29:38,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:29:38,209 INFO L93 Difference]: Finished difference Result 1303 states and 3546 transitions. [2018-12-31 17:29:38,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 17:29:38,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-31 17:29:38,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:29:38,220 INFO L225 Difference]: With dead ends: 1303 [2018-12-31 17:29:38,220 INFO L226 Difference]: Without dead ends: 1294 [2018-12-31 17:29:38,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 17:29:38,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2018-12-31 17:29:38,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 973. [2018-12-31 17:29:38,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2018-12-31 17:29:38,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 2744 transitions. [2018-12-31 17:29:38,263 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 2744 transitions. Word has length 36 [2018-12-31 17:29:38,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:29:38,263 INFO L480 AbstractCegarLoop]: Abstraction has 973 states and 2744 transitions. [2018-12-31 17:29:38,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 17:29:38,265 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 2744 transitions. [2018-12-31 17:29:38,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-31 17:29:38,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:29:38,268 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 17:29:38,275 INFO L423 AbstractCegarLoop]: === Iteration 7 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:29:38,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:29:38,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1616007366, now seen corresponding path program 4 times [2018-12-31 17:29:38,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:29:38,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:29:38,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:29:38,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 17:29:38,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:29:38,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:29:38,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 17:29:38,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:29:38,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 17:29:38,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 17:29:38,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 17:29:38,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 17:29:38,375 INFO L87 Difference]: Start difference. First operand 973 states and 2744 transitions. Second operand 3 states. [2018-12-31 17:29:38,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:29:38,550 INFO L93 Difference]: Finished difference Result 880 states and 2301 transitions. [2018-12-31 17:29:38,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 17:29:38,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-31 17:29:38,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:29:38,556 INFO L225 Difference]: With dead ends: 880 [2018-12-31 17:29:38,556 INFO L226 Difference]: Without dead ends: 655 [2018-12-31 17:29:38,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 17:29:38,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2018-12-31 17:29:38,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 568. [2018-12-31 17:29:38,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2018-12-31 17:29:38,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 1424 transitions. [2018-12-31 17:29:38,571 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 1424 transitions. Word has length 36 [2018-12-31 17:29:38,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:29:38,572 INFO L480 AbstractCegarLoop]: Abstraction has 568 states and 1424 transitions. [2018-12-31 17:29:38,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 17:29:38,572 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 1424 transitions. [2018-12-31 17:29:38,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-31 17:29:38,573 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:29:38,574 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 17:29:38,574 INFO L423 AbstractCegarLoop]: === Iteration 8 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:29:38,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:29:38,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1142059985, now seen corresponding path program 1 times [2018-12-31 17:29:38,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:29:38,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:29:38,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:29:38,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-31 17:29:38,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:29:38,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:29:38,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 17:29:38,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:29:38,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 17:29:38,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 17:29:38,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 17:29:38,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 17:29:38,653 INFO L87 Difference]: Start difference. First operand 568 states and 1424 transitions. Second operand 3 states. [2018-12-31 17:29:38,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:29:38,733 INFO L93 Difference]: Finished difference Result 544 states and 1360 transitions. [2018-12-31 17:29:38,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 17:29:38,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-31 17:29:38,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:29:38,737 INFO L225 Difference]: With dead ends: 544 [2018-12-31 17:29:38,738 INFO L226 Difference]: Without dead ends: 469 [2018-12-31 17:29:38,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 17:29:38,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-12-31 17:29:38,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 469. [2018-12-31 17:29:38,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-12-31 17:29:38,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 1171 transitions. [2018-12-31 17:29:38,749 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 1171 transitions. Word has length 39 [2018-12-31 17:29:38,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:29:38,750 INFO L480 AbstractCegarLoop]: Abstraction has 469 states and 1171 transitions. [2018-12-31 17:29:38,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 17:29:38,750 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 1171 transitions. [2018-12-31 17:29:38,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-31 17:29:38,751 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 17:29:38,752 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 17:29:38,752 INFO L423 AbstractCegarLoop]: === Iteration 9 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 17:29:38,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 17:29:38,752 INFO L82 PathProgramCache]: Analyzing trace with hash -547744875, now seen corresponding path program 1 times [2018-12-31 17:29:38,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 17:29:38,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 17:29:38,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:29:38,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 17:29:38,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 17:29:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 17:29:38,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 17:29:38,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 17:29:38,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 17:29:38,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 17:29:38,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 17:29:38,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 17:29:38,838 INFO L87 Difference]: Start difference. First operand 469 states and 1171 transitions. Second operand 3 states. [2018-12-31 17:29:38,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 17:29:38,883 INFO L93 Difference]: Finished difference Result 310 states and 825 transitions. [2018-12-31 17:29:38,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 17:29:38,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-31 17:29:38,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 17:29:38,885 INFO L225 Difference]: With dead ends: 310 [2018-12-31 17:29:38,885 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 17:29:38,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 17:29:38,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 17:29:38,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 17:29:38,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 17:29:38,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 17:29:38,888 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2018-12-31 17:29:38,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 17:29:38,890 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 17:29:38,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 17:29:38,890 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 17:29:38,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 17:29:38,896 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-31 17:29:38,898 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 05:29:38 BasicIcfg [2018-12-31 17:29:38,898 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 17:29:38,898 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 17:29:38,899 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 17:29:38,900 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 17:29:38,901 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 05:29:35" (3/4) ... [2018-12-31 17:29:38,906 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 17:29:38,914 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thr2 [2018-12-31 17:29:38,914 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thr1 [2018-12-31 17:29:38,919 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-12-31 17:29:38,920 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-31 17:29:38,969 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 17:29:38,969 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 17:29:38,970 INFO L168 Benchmark]: Toolchain (without parser) took 5078.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 951.4 MB in the beginning and 842.6 MB in the end (delta: 108.7 MB). Peak memory consumption was 248.2 MB. Max. memory is 11.5 GB. [2018-12-31 17:29:38,972 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 17:29:38,972 INFO L168 Benchmark]: CACSL2BoogieTranslator took 734.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -168.5 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2018-12-31 17:29:38,974 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.85 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-31 17:29:38,974 INFO L168 Benchmark]: Boogie Preprocessor took 35.64 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. [2018-12-31 17:29:38,975 INFO L168 Benchmark]: RCFGBuilder took 762.36 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: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-12-31 17:29:38,976 INFO L168 Benchmark]: TraceAbstraction took 3422.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 842.6 MB in the end (delta: 237.9 MB). Peak memory consumption was 237.9 MB. Max. memory is 11.5 GB. [2018-12-31 17:29:38,976 INFO L168 Benchmark]: Witness Printer took 70.85 ms. Allocated memory is still 1.2 GB. Free memory is still 842.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 17:29:38,984 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 734.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -168.5 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.85 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.64 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 762.36 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: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3422.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 842.6 MB in the end (delta: 237.9 MB). Peak memory consumption was 237.9 MB. Max. memory is 11.5 GB. * Witness Printer took 70.85 ms. Allocated memory is still 1.2 GB. Free memory is still 842.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 685]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 659]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 685]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 659]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 123 locations, 4 error locations. SAFE Result, 3.3s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 795 SDtfs, 283 SDslu, 511 SDs, 0 SdLazy, 91 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1816occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 918 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 291 NumberOfCodeBlocks, 291 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 282 ConstructedInterpolants, 0 QuantifiedInterpolants, 12878 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...