./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-ext/01_inc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f6fb2bb1 Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/pthread-ext/01_inc.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 4d91aa845889f03c833da32b972f2eb6326d7db9 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-f6fb2bb [2019-11-19 19:06:59,764 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 19:06:59,766 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 19:06:59,784 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 19:06:59,785 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 19:06:59,786 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 19:06:59,787 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 19:06:59,789 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 19:06:59,791 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 19:06:59,793 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 19:06:59,794 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 19:06:59,795 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 19:06:59,795 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 19:06:59,796 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 19:06:59,798 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 19:06:59,799 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 19:06:59,801 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 19:06:59,803 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 19:06:59,805 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 19:06:59,809 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 19:06:59,812 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 19:06:59,815 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 19:06:59,817 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 19:06:59,820 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 19:06:59,827 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 19:06:59,828 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 19:06:59,828 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 19:06:59,829 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 19:06:59,831 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 19:06:59,832 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 19:06:59,833 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 19:06:59,834 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 19:06:59,835 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 19:06:59,836 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 19:06:59,840 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 19:06:59,841 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 19:06:59,843 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 19:06:59,843 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 19:06:59,843 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 19:06:59,846 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 19:06:59,848 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 19:06:59,849 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 19:06:59,869 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 19:06:59,870 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 19:06:59,872 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 19:06:59,873 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 19:06:59,873 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 19:06:59,873 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 19:06:59,873 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 19:06:59,874 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 19:06:59,874 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 19:06:59,875 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 19:06:59,876 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 19:06:59,876 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 19:06:59,877 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 19:06:59,877 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 19:06:59,878 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 19:06:59,878 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 19:06:59,878 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 19:06:59,879 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 19:06:59,879 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 19:06:59,879 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 19:06:59,879 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 19:06:59,880 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 19:06:59,880 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 19:06:59,880 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 19:06:59,881 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 19:06:59,881 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 19:06:59,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 19:06:59,881 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 19:06:59,882 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 -> 4d91aa845889f03c833da32b972f2eb6326d7db9 [2019-11-19 19:07:00,250 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 19:07:00,266 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 19:07:00,270 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 19:07:00,272 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 19:07:00,272 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 19:07:00,273 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/01_inc.i [2019-11-19 19:07:00,352 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3476704e8/952bc748a7c84dad9a74bf02bbc33469/FLAGc8fcfc17b [2019-11-19 19:07:00,910 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 19:07:00,911 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/01_inc.i [2019-11-19 19:07:00,928 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3476704e8/952bc748a7c84dad9a74bf02bbc33469/FLAGc8fcfc17b [2019-11-19 19:07:01,219 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3476704e8/952bc748a7c84dad9a74bf02bbc33469 [2019-11-19 19:07:01,224 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 19:07:01,226 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 19:07:01,227 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 19:07:01,227 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 19:07:01,231 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 19:07:01,232 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:07:01" (1/1) ... [2019-11-19 19:07:01,235 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@747c9e89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:07:01, skipping insertion in model container [2019-11-19 19:07:01,236 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:07:01" (1/1) ... [2019-11-19 19:07:01,244 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 19:07:01,300 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 19:07:01,734 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 19:07:01,751 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 19:07:01,825 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 19:07:01,915 INFO L192 MainTranslator]: Completed translation [2019-11-19 19:07:01,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:07:01 WrapperNode [2019-11-19 19:07:01,917 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 19:07:01,918 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 19:07:01,918 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 19:07:01,918 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 19:07:01,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:07:01" (1/1) ... [2019-11-19 19:07:01,969 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:07:01" (1/1) ... [2019-11-19 19:07:01,992 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 19:07:01,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 19:07:01,993 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 19:07:01,993 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 19:07:02,003 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:07:01" (1/1) ... [2019-11-19 19:07:02,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:07:01" (1/1) ... [2019-11-19 19:07:02,006 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:07:01" (1/1) ... [2019-11-19 19:07:02,006 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:07:01" (1/1) ... [2019-11-19 19:07:02,012 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:07:01" (1/1) ... [2019-11-19 19:07:02,017 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:07:01" (1/1) ... [2019-11-19 19:07:02,019 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:07:01" (1/1) ... [2019-11-19 19:07:02,024 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 19:07:02,025 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 19:07:02,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 19:07:02,027 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 19:07:02,028 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:07:01" (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 [2019-11-19 19:07:02,092 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2019-11-19 19:07:02,092 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2019-11-19 19:07:02,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-19 19:07:02,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 19:07:02,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 19:07:02,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 19:07:02,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 19:07:02,095 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-19 19:07:02,235 INFO L1494 $ProcedureCfgBuilder]: dropping label inside atomic statement: __VERIFIER_atomic_acquire_returnLabel [2019-11-19 19:07:02,236 INFO L1494 $ProcedureCfgBuilder]: dropping label inside atomic statement: __VERIFIER_atomic_release_returnLabel [2019-11-19 19:07:02,237 INFO L1494 $ProcedureCfgBuilder]: dropping label inside atomic statement: __VERIFIER_atomic_release_returnLabel#2 [2019-11-19 19:07:02,410 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 19:07:02,410 INFO L285 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-19 19:07:02,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:07:02 BoogieIcfgContainer [2019-11-19 19:07:02,412 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 19:07:02,413 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 19:07:02,413 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 19:07:02,417 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 19:07:02,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:07:01" (1/3) ... [2019-11-19 19:07:02,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21dc0d2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:07:02, skipping insertion in model container [2019-11-19 19:07:02,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:07:01" (2/3) ... [2019-11-19 19:07:02,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21dc0d2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:07:02, skipping insertion in model container [2019-11-19 19:07:02,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:07:02" (3/3) ... [2019-11-19 19:07:02,427 INFO L109 eAbstractionObserver]: Analyzing ICFG 01_inc.i [2019-11-19 19:07:02,467 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:07:02,467 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:07:02,467 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:07:02,467 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:07:02,468 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork2_~v~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:07:02,469 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:07:02,469 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:07:02,470 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork2_~v~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:07:02,470 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork2_~v~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:07:02,470 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork2_~v~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:07:02,471 WARN L315 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork2_~v~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:07:02,471 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:07:02,472 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:07:02,472 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:07:02,473 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:07:02,473 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:07:02,473 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:07:02,474 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~v~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:07:02,474 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:07:02,474 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:07:02,475 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~v~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:07:02,475 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~v~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:07:02,475 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~v~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:07:02,476 WARN L315 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~v~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:07:02,480 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:07:02,481 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:07:02,481 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:07:02,483 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:07:02,483 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:07:02,483 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:07:02,484 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~v~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:07:02,484 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:07:02,485 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:07:02,485 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~v~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:07:02,486 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~v~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:07:02,486 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~v~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:07:02,487 WARN L315 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork1_~v~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:07:02,488 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:07:02,488 WARN L315 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 19:07:02,511 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-19 19:07:02,512 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 19:07:02,519 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-11-19 19:07:02,528 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-11-19 19:07:02,545 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 19:07:02,546 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 19:07:02,546 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 19:07:02,546 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 19:07:02,546 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 19:07:02,547 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 19:07:02,547 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 19:07:02,547 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 19:07:02,558 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 58 transitions [2019-11-19 19:07:04,848 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 19779 states. [2019-11-19 19:07:04,850 INFO L276 IsEmpty]: Start isEmpty. Operand 19779 states. [2019-11-19 19:07:04,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-19 19:07:04,865 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:07:04,866 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:07:04,866 INFO L410 AbstractCegarLoop]: === Iteration 1 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 19:07:04,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:07:04,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1188642634, now seen corresponding path program 1 times [2019-11-19 19:07:04,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:07:04,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407323104] [2019-11-19 19:07:04,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:07:05,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:07:05,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:07:05,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407323104] [2019-11-19 19:07:05,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:07:05,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 19:07:05,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158945991] [2019-11-19 19:07:05,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 19:07:05,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:07:05,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 19:07:05,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 19:07:05,334 INFO L87 Difference]: Start difference. First operand 19779 states. Second operand 5 states. [2019-11-19 19:07:05,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:07:05,697 INFO L93 Difference]: Finished difference Result 13174 states and 45394 transitions. [2019-11-19 19:07:05,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 19:07:05,699 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-19 19:07:05,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:07:05,832 INFO L225 Difference]: With dead ends: 13174 [2019-11-19 19:07:05,832 INFO L226 Difference]: Without dead ends: 12438 [2019-11-19 19:07:05,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-19 19:07:06,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12438 states. [2019-11-19 19:07:06,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12438 to 8478. [2019-11-19 19:07:06,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8478 states. [2019-11-19 19:07:06,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8478 states to 8478 states and 29340 transitions. [2019-11-19 19:07:06,529 INFO L78 Accepts]: Start accepts. Automaton has 8478 states and 29340 transitions. Word has length 17 [2019-11-19 19:07:06,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:07:06,530 INFO L462 AbstractCegarLoop]: Abstraction has 8478 states and 29340 transitions. [2019-11-19 19:07:06,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 19:07:06,531 INFO L276 IsEmpty]: Start isEmpty. Operand 8478 states and 29340 transitions. [2019-11-19 19:07:06,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-19 19:07:06,533 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:07:06,533 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:07:06,534 INFO L410 AbstractCegarLoop]: === Iteration 2 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 19:07:06,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:07:06,535 INFO L82 PathProgramCache]: Analyzing trace with hash -408601406, now seen corresponding path program 1 times [2019-11-19 19:07:06,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:07:06,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79030365] [2019-11-19 19:07:06,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:07:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:07:06,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:07:06,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79030365] [2019-11-19 19:07:06,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:07:06,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 19:07:06,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328028587] [2019-11-19 19:07:06,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 19:07:06,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:07:06,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 19:07:06,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 19:07:06,840 INFO L87 Difference]: Start difference. First operand 8478 states and 29340 transitions. Second operand 5 states. [2019-11-19 19:07:07,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:07:07,109 INFO L93 Difference]: Finished difference Result 13218 states and 44823 transitions. [2019-11-19 19:07:07,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 19:07:07,110 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-19 19:07:07,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:07:07,206 INFO L225 Difference]: With dead ends: 13218 [2019-11-19 19:07:07,206 INFO L226 Difference]: Without dead ends: 13094 [2019-11-19 19:07:07,208 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-19 19:07:07,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13094 states. [2019-11-19 19:07:07,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13094 to 8882. [2019-11-19 19:07:07,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8882 states. [2019-11-19 19:07:07,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8882 states to 8882 states and 30551 transitions. [2019-11-19 19:07:07,651 INFO L78 Accepts]: Start accepts. Automaton has 8882 states and 30551 transitions. Word has length 17 [2019-11-19 19:07:07,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:07:07,652 INFO L462 AbstractCegarLoop]: Abstraction has 8882 states and 30551 transitions. [2019-11-19 19:07:07,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 19:07:07,652 INFO L276 IsEmpty]: Start isEmpty. Operand 8882 states and 30551 transitions. [2019-11-19 19:07:07,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-19 19:07:07,657 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:07:07,657 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:07:07,658 INFO L410 AbstractCegarLoop]: === Iteration 3 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 19:07:07,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:07:07,659 INFO L82 PathProgramCache]: Analyzing trace with hash 371439822, now seen corresponding path program 1 times [2019-11-19 19:07:07,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:07:07,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339521742] [2019-11-19 19:07:07,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:07:07,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:07:07,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:07:07,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339521742] [2019-11-19 19:07:07,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:07:07,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 19:07:07,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281999371] [2019-11-19 19:07:07,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 19:07:07,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:07:07,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 19:07:07,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 19:07:07,837 INFO L87 Difference]: Start difference. First operand 8882 states and 30551 transitions. Second operand 5 states. [2019-11-19 19:07:08,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:07:08,071 INFO L93 Difference]: Finished difference Result 13810 states and 46591 transitions. [2019-11-19 19:07:08,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 19:07:08,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-19 19:07:08,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:07:08,125 INFO L225 Difference]: With dead ends: 13810 [2019-11-19 19:07:08,126 INFO L226 Difference]: Without dead ends: 13686 [2019-11-19 19:07:08,126 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-19 19:07:08,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13686 states. [2019-11-19 19:07:08,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13686 to 9222. [2019-11-19 19:07:08,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9222 states. [2019-11-19 19:07:08,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9222 states to 9222 states and 31482 transitions. [2019-11-19 19:07:08,535 INFO L78 Accepts]: Start accepts. Automaton has 9222 states and 31482 transitions. Word has length 17 [2019-11-19 19:07:08,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:07:08,535 INFO L462 AbstractCegarLoop]: Abstraction has 9222 states and 31482 transitions. [2019-11-19 19:07:08,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 19:07:08,536 INFO L276 IsEmpty]: Start isEmpty. Operand 9222 states and 31482 transitions. [2019-11-19 19:07:08,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-19 19:07:08,541 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:07:08,541 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:07:08,541 INFO L410 AbstractCegarLoop]: === Iteration 4 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 19:07:08,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:07:08,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1637145132, now seen corresponding path program 1 times [2019-11-19 19:07:08,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:07:08,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435298032] [2019-11-19 19:07:08,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:07:08,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:07:08,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 19:07:08,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435298032] [2019-11-19 19:07:08,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:07:08,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 19:07:08,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738302543] [2019-11-19 19:07:08,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 19:07:08,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:07:08,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 19:07:08,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-19 19:07:08,760 INFO L87 Difference]: Start difference. First operand 9222 states and 31482 transitions. Second operand 7 states. [2019-11-19 19:07:09,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:07:09,346 INFO L93 Difference]: Finished difference Result 14946 states and 49441 transitions. [2019-11-19 19:07:09,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 19:07:09,348 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-19 19:07:09,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:07:09,400 INFO L225 Difference]: With dead ends: 14946 [2019-11-19 19:07:09,400 INFO L226 Difference]: Without dead ends: 14510 [2019-11-19 19:07:09,402 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-19 19:07:09,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14510 states. [2019-11-19 19:07:09,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14510 to 9282. [2019-11-19 19:07:09,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9282 states. [2019-11-19 19:07:09,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9282 states to 9282 states and 31316 transitions. [2019-11-19 19:07:09,735 INFO L78 Accepts]: Start accepts. Automaton has 9282 states and 31316 transitions. Word has length 26 [2019-11-19 19:07:09,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:07:09,736 INFO L462 AbstractCegarLoop]: Abstraction has 9282 states and 31316 transitions. [2019-11-19 19:07:09,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 19:07:09,737 INFO L276 IsEmpty]: Start isEmpty. Operand 9282 states and 31316 transitions. [2019-11-19 19:07:09,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-19 19:07:09,743 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:07:09,743 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:07:09,743 INFO L410 AbstractCegarLoop]: === Iteration 5 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 19:07:09,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:07:09,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1260293678, now seen corresponding path program 2 times [2019-11-19 19:07:09,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:07:09,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411508650] [2019-11-19 19:07:09,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:07:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:07:09,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 19:07:09,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411508650] [2019-11-19 19:07:09,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:07:09,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 19:07:09,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508765468] [2019-11-19 19:07:09,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 19:07:09,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:07:09,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 19:07:09,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:07:09,813 INFO L87 Difference]: Start difference. First operand 9282 states and 31316 transitions. Second operand 3 states. [2019-11-19 19:07:09,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:07:09,864 INFO L93 Difference]: Finished difference Result 6102 states and 19812 transitions. [2019-11-19 19:07:09,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 19:07:09,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-19 19:07:09,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:07:09,881 INFO L225 Difference]: With dead ends: 6102 [2019-11-19 19:07:09,882 INFO L226 Difference]: Without dead ends: 6102 [2019-11-19 19:07:09,883 INFO L630 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 [2019-11-19 19:07:09,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6102 states. [2019-11-19 19:07:10,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6102 to 6102. [2019-11-19 19:07:10,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6102 states. [2019-11-19 19:07:10,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6102 states to 6102 states and 19812 transitions. [2019-11-19 19:07:10,072 INFO L78 Accepts]: Start accepts. Automaton has 6102 states and 19812 transitions. Word has length 26 [2019-11-19 19:07:10,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:07:10,072 INFO L462 AbstractCegarLoop]: Abstraction has 6102 states and 19812 transitions. [2019-11-19 19:07:10,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 19:07:10,073 INFO L276 IsEmpty]: Start isEmpty. Operand 6102 states and 19812 transitions. [2019-11-19 19:07:10,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-19 19:07:10,079 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:07:10,079 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:07:10,087 INFO L410 AbstractCegarLoop]: === Iteration 6 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 19:07:10,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:07:10,088 INFO L82 PathProgramCache]: Analyzing trace with hash 126168824, now seen corresponding path program 3 times [2019-11-19 19:07:10,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:07:10,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952510423] [2019-11-19 19:07:10,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:07:10,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:07:10,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 19:07:10,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952510423] [2019-11-19 19:07:10,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:07:10,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 19:07:10,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460767369] [2019-11-19 19:07:10,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 19:07:10,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:07:10,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 19:07:10,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-19 19:07:10,268 INFO L87 Difference]: Start difference. First operand 6102 states and 19812 transitions. Second operand 7 states. [2019-11-19 19:07:10,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:07:10,676 INFO L93 Difference]: Finished difference Result 9786 states and 31494 transitions. [2019-11-19 19:07:10,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-19 19:07:10,677 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-19 19:07:10,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:07:10,705 INFO L225 Difference]: With dead ends: 9786 [2019-11-19 19:07:10,706 INFO L226 Difference]: Without dead ends: 9702 [2019-11-19 19:07:10,706 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-11-19 19:07:10,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9702 states. [2019-11-19 19:07:10,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9702 to 5106. [2019-11-19 19:07:10,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5106 states. [2019-11-19 19:07:10,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5106 states to 5106 states and 16248 transitions. [2019-11-19 19:07:10,898 INFO L78 Accepts]: Start accepts. Automaton has 5106 states and 16248 transitions. Word has length 26 [2019-11-19 19:07:10,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:07:10,899 INFO L462 AbstractCegarLoop]: Abstraction has 5106 states and 16248 transitions. [2019-11-19 19:07:10,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 19:07:10,899 INFO L276 IsEmpty]: Start isEmpty. Operand 5106 states and 16248 transitions. [2019-11-19 19:07:10,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-19 19:07:10,903 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:07:10,903 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:07:10,904 INFO L410 AbstractCegarLoop]: === Iteration 7 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 19:07:10,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:07:10,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1052824518, now seen corresponding path program 1 times [2019-11-19 19:07:10,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:07:10,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534146405] [2019-11-19 19:07:10,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:07:10,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:07:11,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 19:07:11,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534146405] [2019-11-19 19:07:11,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:07:11,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 19:07:11,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037813713] [2019-11-19 19:07:11,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 19:07:11,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:07:11,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 19:07:11,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-19 19:07:11,066 INFO L87 Difference]: Start difference. First operand 5106 states and 16248 transitions. Second operand 7 states. [2019-11-19 19:07:11,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:07:11,407 INFO L93 Difference]: Finished difference Result 7770 states and 24738 transitions. [2019-11-19 19:07:11,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 19:07:11,408 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-19 19:07:11,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:07:11,428 INFO L225 Difference]: With dead ends: 7770 [2019-11-19 19:07:11,428 INFO L226 Difference]: Without dead ends: 7686 [2019-11-19 19:07:11,429 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-19 19:07:11,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7686 states. [2019-11-19 19:07:11,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7686 to 4986. [2019-11-19 19:07:11,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4986 states. [2019-11-19 19:07:11,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4986 states to 4986 states and 15765 transitions. [2019-11-19 19:07:11,603 INFO L78 Accepts]: Start accepts. Automaton has 4986 states and 15765 transitions. Word has length 26 [2019-11-19 19:07:11,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:07:11,604 INFO L462 AbstractCegarLoop]: Abstraction has 4986 states and 15765 transitions. [2019-11-19 19:07:11,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 19:07:11,604 INFO L276 IsEmpty]: Start isEmpty. Operand 4986 states and 15765 transitions. [2019-11-19 19:07:11,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-19 19:07:11,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:07:11,608 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:07:11,609 INFO L410 AbstractCegarLoop]: === Iteration 8 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 19:07:11,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:07:11,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1895426092, now seen corresponding path program 2 times [2019-11-19 19:07:11,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:07:11,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977437770] [2019-11-19 19:07:11,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:07:11,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:07:11,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 19:07:11,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977437770] [2019-11-19 19:07:11,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:07:11,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 19:07:11,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302962002] [2019-11-19 19:07:11,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 19:07:11,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:07:11,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 19:07:11,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-19 19:07:11,727 INFO L87 Difference]: Start difference. First operand 4986 states and 15765 transitions. Second operand 7 states. [2019-11-19 19:07:12,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:07:12,142 INFO L93 Difference]: Finished difference Result 8322 states and 26232 transitions. [2019-11-19 19:07:12,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-19 19:07:12,143 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-19 19:07:12,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:07:12,164 INFO L225 Difference]: With dead ends: 8322 [2019-11-19 19:07:12,165 INFO L226 Difference]: Without dead ends: 8238 [2019-11-19 19:07:12,165 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-11-19 19:07:12,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8238 states. [2019-11-19 19:07:12,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8238 to 4230. [2019-11-19 19:07:12,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4230 states. [2019-11-19 19:07:12,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4230 states to 4230 states and 13095 transitions. [2019-11-19 19:07:12,331 INFO L78 Accepts]: Start accepts. Automaton has 4230 states and 13095 transitions. Word has length 26 [2019-11-19 19:07:12,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:07:12,331 INFO L462 AbstractCegarLoop]: Abstraction has 4230 states and 13095 transitions. [2019-11-19 19:07:12,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 19:07:12,332 INFO L276 IsEmpty]: Start isEmpty. Operand 4230 states and 13095 transitions. [2019-11-19 19:07:12,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-19 19:07:12,337 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:07:12,337 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:07:12,337 INFO L410 AbstractCegarLoop]: === Iteration 9 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 19:07:12,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:07:12,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1176828260, now seen corresponding path program 1 times [2019-11-19 19:07:12,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:07:12,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467120257] [2019-11-19 19:07:12,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:07:12,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:07:12,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 19:07:12,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467120257] [2019-11-19 19:07:12,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:07:12,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 19:07:12,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464475637] [2019-11-19 19:07:12,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 19:07:12,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:07:12,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 19:07:12,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-19 19:07:12,499 INFO L87 Difference]: Start difference. First operand 4230 states and 13095 transitions. Second operand 7 states. [2019-11-19 19:07:12,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:07:12,986 INFO L93 Difference]: Finished difference Result 7734 states and 24123 transitions. [2019-11-19 19:07:12,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-19 19:07:12,987 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-19 19:07:12,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:07:13,005 INFO L225 Difference]: With dead ends: 7734 [2019-11-19 19:07:13,005 INFO L226 Difference]: Without dead ends: 7650 [2019-11-19 19:07:13,006 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2019-11-19 19:07:13,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7650 states. [2019-11-19 19:07:13,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7650 to 4398. [2019-11-19 19:07:13,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4398 states. [2019-11-19 19:07:13,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4398 states to 4398 states and 13656 transitions. [2019-11-19 19:07:13,157 INFO L78 Accepts]: Start accepts. Automaton has 4398 states and 13656 transitions. Word has length 26 [2019-11-19 19:07:13,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:07:13,159 INFO L462 AbstractCegarLoop]: Abstraction has 4398 states and 13656 transitions. [2019-11-19 19:07:13,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 19:07:13,159 INFO L276 IsEmpty]: Start isEmpty. Operand 4398 states and 13656 transitions. [2019-11-19 19:07:13,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-19 19:07:13,163 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:07:13,163 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:07:13,163 INFO L410 AbstractCegarLoop]: === Iteration 10 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 19:07:13,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:07:13,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1983655624, now seen corresponding path program 2 times [2019-11-19 19:07:13,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:07:13,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177298695] [2019-11-19 19:07:13,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:07:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:07:13,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 19:07:13,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177298695] [2019-11-19 19:07:13,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:07:13,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 19:07:13,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906984697] [2019-11-19 19:07:13,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 19:07:13,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:07:13,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 19:07:13,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-19 19:07:13,328 INFO L87 Difference]: Start difference. First operand 4398 states and 13656 transitions. Second operand 7 states. [2019-11-19 19:07:13,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:07:13,510 INFO L93 Difference]: Finished difference Result 6006 states and 18411 transitions. [2019-11-19 19:07:13,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 19:07:13,511 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-11-19 19:07:13,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:07:13,524 INFO L225 Difference]: With dead ends: 6006 [2019-11-19 19:07:13,524 INFO L226 Difference]: Without dead ends: 5922 [2019-11-19 19:07:13,525 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-19 19:07:13,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5922 states. [2019-11-19 19:07:13,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5922 to 3642. [2019-11-19 19:07:13,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3642 states. [2019-11-19 19:07:13,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3642 states to 3642 states and 10986 transitions. [2019-11-19 19:07:13,627 INFO L78 Accepts]: Start accepts. Automaton has 3642 states and 10986 transitions. Word has length 26 [2019-11-19 19:07:13,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:07:13,627 INFO L462 AbstractCegarLoop]: Abstraction has 3642 states and 10986 transitions. [2019-11-19 19:07:13,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 19:07:13,627 INFO L276 IsEmpty]: Start isEmpty. Operand 3642 states and 10986 transitions. [2019-11-19 19:07:13,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-19 19:07:13,634 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:07:13,635 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 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] [2019-11-19 19:07:13,635 INFO L410 AbstractCegarLoop]: === Iteration 11 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 19:07:13,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:07:13,635 INFO L82 PathProgramCache]: Analyzing trace with hash 292412490, now seen corresponding path program 1 times [2019-11-19 19:07:13,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:07:13,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331320703] [2019-11-19 19:07:13,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:07:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:07:13,766 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-19 19:07:13,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331320703] [2019-11-19 19:07:13,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:07:13,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-19 19:07:13,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790572550] [2019-11-19 19:07:13,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 19:07:13,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:07:13,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 19:07:13,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-19 19:07:13,768 INFO L87 Difference]: Start difference. First operand 3642 states and 10986 transitions. Second operand 9 states. [2019-11-19 19:07:14,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:07:14,052 INFO L93 Difference]: Finished difference Result 5314 states and 16152 transitions. [2019-11-19 19:07:14,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 19:07:14,052 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-11-19 19:07:14,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:07:14,063 INFO L225 Difference]: With dead ends: 5314 [2019-11-19 19:07:14,063 INFO L226 Difference]: Without dead ends: 4638 [2019-11-19 19:07:14,064 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-11-19 19:07:14,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4638 states. [2019-11-19 19:07:14,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4638 to 3498. [2019-11-19 19:07:14,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3498 states. [2019-11-19 19:07:14,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3498 states to 3498 states and 10518 transitions. [2019-11-19 19:07:14,183 INFO L78 Accepts]: Start accepts. Automaton has 3498 states and 10518 transitions. Word has length 35 [2019-11-19 19:07:14,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:07:14,185 INFO L462 AbstractCegarLoop]: Abstraction has 3498 states and 10518 transitions. [2019-11-19 19:07:14,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 19:07:14,185 INFO L276 IsEmpty]: Start isEmpty. Operand 3498 states and 10518 transitions. [2019-11-19 19:07:14,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-19 19:07:14,193 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:07:14,193 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 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] [2019-11-19 19:07:14,193 INFO L410 AbstractCegarLoop]: === Iteration 12 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 19:07:14,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:07:14,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1956453450, now seen corresponding path program 2 times [2019-11-19 19:07:14,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:07:14,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903910736] [2019-11-19 19:07:14,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:07:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:07:14,340 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-19 19:07:14,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903910736] [2019-11-19 19:07:14,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:07:14,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-19 19:07:14,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121309104] [2019-11-19 19:07:14,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 19:07:14,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:07:14,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 19:07:14,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-19 19:07:14,342 INFO L87 Difference]: Start difference. First operand 3498 states and 10518 transitions. Second operand 9 states. [2019-11-19 19:07:14,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:07:14,931 INFO L93 Difference]: Finished difference Result 5298 states and 16100 transitions. [2019-11-19 19:07:14,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-19 19:07:14,931 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-11-19 19:07:14,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:07:14,940 INFO L225 Difference]: With dead ends: 5298 [2019-11-19 19:07:14,940 INFO L226 Difference]: Without dead ends: 4926 [2019-11-19 19:07:14,940 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2019-11-19 19:07:14,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4926 states. [2019-11-19 19:07:15,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4926 to 3678. [2019-11-19 19:07:15,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3678 states. [2019-11-19 19:07:15,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3678 states to 3678 states and 11009 transitions. [2019-11-19 19:07:15,101 INFO L78 Accepts]: Start accepts. Automaton has 3678 states and 11009 transitions. Word has length 35 [2019-11-19 19:07:15,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:07:15,101 INFO L462 AbstractCegarLoop]: Abstraction has 3678 states and 11009 transitions. [2019-11-19 19:07:15,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 19:07:15,102 INFO L276 IsEmpty]: Start isEmpty. Operand 3678 states and 11009 transitions. [2019-11-19 19:07:15,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-19 19:07:15,108 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:07:15,108 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 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] [2019-11-19 19:07:15,108 INFO L410 AbstractCegarLoop]: === Iteration 13 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 19:07:15,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:07:15,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1956452618, now seen corresponding path program 1 times [2019-11-19 19:07:15,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:07:15,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831198105] [2019-11-19 19:07:15,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:07:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:07:15,291 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-19 19:07:15,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831198105] [2019-11-19 19:07:15,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:07:15,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-19 19:07:15,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549290740] [2019-11-19 19:07:15,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 19:07:15,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:07:15,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 19:07:15,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-19 19:07:15,294 INFO L87 Difference]: Start difference. First operand 3678 states and 11009 transitions. Second operand 9 states. [2019-11-19 19:07:15,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:07:15,548 INFO L93 Difference]: Finished difference Result 3658 states and 10890 transitions. [2019-11-19 19:07:15,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 19:07:15,549 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-11-19 19:07:15,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:07:15,555 INFO L225 Difference]: With dead ends: 3658 [2019-11-19 19:07:15,555 INFO L226 Difference]: Without dead ends: 3102 [2019-11-19 19:07:15,556 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-11-19 19:07:15,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3102 states. [2019-11-19 19:07:15,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3102 to 3102. [2019-11-19 19:07:15,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3102 states. [2019-11-19 19:07:15,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3102 states to 3102 states and 9399 transitions. [2019-11-19 19:07:15,627 INFO L78 Accepts]: Start accepts. Automaton has 3102 states and 9399 transitions. Word has length 35 [2019-11-19 19:07:15,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:07:15,627 INFO L462 AbstractCegarLoop]: Abstraction has 3102 states and 9399 transitions. [2019-11-19 19:07:15,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 19:07:15,628 INFO L276 IsEmpty]: Start isEmpty. Operand 3102 states and 9399 transitions. [2019-11-19 19:07:15,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-19 19:07:15,633 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:07:15,633 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 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] [2019-11-19 19:07:15,633 INFO L410 AbstractCegarLoop]: === Iteration 14 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 19:07:15,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:07:15,634 INFO L82 PathProgramCache]: Analyzing trace with hash 730863852, now seen corresponding path program 3 times [2019-11-19 19:07:15,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:07:15,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416736078] [2019-11-19 19:07:15,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:07:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:07:15,799 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-19 19:07:15,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416736078] [2019-11-19 19:07:15,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:07:15,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-19 19:07:15,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211803567] [2019-11-19 19:07:15,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 19:07:15,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:07:15,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 19:07:15,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-19 19:07:15,801 INFO L87 Difference]: Start difference. First operand 3102 states and 9399 transitions. Second operand 9 states. [2019-11-19 19:07:16,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:07:16,077 INFO L93 Difference]: Finished difference Result 4390 states and 13365 transitions. [2019-11-19 19:07:16,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 19:07:16,077 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-11-19 19:07:16,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:07:16,083 INFO L225 Difference]: With dead ends: 4390 [2019-11-19 19:07:16,083 INFO L226 Difference]: Without dead ends: 3714 [2019-11-19 19:07:16,084 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-11-19 19:07:16,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3714 states. [2019-11-19 19:07:16,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3714 to 2574. [2019-11-19 19:07:16,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2574 states. [2019-11-19 19:07:16,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2574 states to 2574 states and 7731 transitions. [2019-11-19 19:07:16,131 INFO L78 Accepts]: Start accepts. Automaton has 2574 states and 7731 transitions. Word has length 35 [2019-11-19 19:07:16,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:07:16,132 INFO L462 AbstractCegarLoop]: Abstraction has 2574 states and 7731 transitions. [2019-11-19 19:07:16,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 19:07:16,132 INFO L276 IsEmpty]: Start isEmpty. Operand 2574 states and 7731 transitions. [2019-11-19 19:07:16,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-19 19:07:16,136 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:07:16,136 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 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] [2019-11-19 19:07:16,136 INFO L410 AbstractCegarLoop]: === Iteration 15 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 19:07:16,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:07:16,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1562884332, now seen corresponding path program 4 times [2019-11-19 19:07:16,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:07:16,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256454003] [2019-11-19 19:07:16,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:07:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:07:16,275 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-19 19:07:16,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256454003] [2019-11-19 19:07:16,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:07:16,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-19 19:07:16,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580752323] [2019-11-19 19:07:16,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 19:07:16,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:07:16,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 19:07:16,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-19 19:07:16,277 INFO L87 Difference]: Start difference. First operand 2574 states and 7731 transitions. Second operand 9 states. [2019-11-19 19:07:16,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:07:16,497 INFO L93 Difference]: Finished difference Result 3106 states and 9294 transitions. [2019-11-19 19:07:16,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 19:07:16,498 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-11-19 19:07:16,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:07:16,502 INFO L225 Difference]: With dead ends: 3106 [2019-11-19 19:07:16,502 INFO L226 Difference]: Without dead ends: 2178 [2019-11-19 19:07:16,503 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-11-19 19:07:16,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2178 states. [2019-11-19 19:07:16,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2178 to 2178. [2019-11-19 19:07:16,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2178 states. [2019-11-19 19:07:16,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2178 states to 2178 states and 6612 transitions. [2019-11-19 19:07:16,544 INFO L78 Accepts]: Start accepts. Automaton has 2178 states and 6612 transitions. Word has length 35 [2019-11-19 19:07:16,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:07:16,544 INFO L462 AbstractCegarLoop]: Abstraction has 2178 states and 6612 transitions. [2019-11-19 19:07:16,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 19:07:16,544 INFO L276 IsEmpty]: Start isEmpty. Operand 2178 states and 6612 transitions. [2019-11-19 19:07:16,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-19 19:07:16,548 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:07:16,548 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 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] [2019-11-19 19:07:16,548 INFO L410 AbstractCegarLoop]: === Iteration 16 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 19:07:16,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:07:16,548 INFO L82 PathProgramCache]: Analyzing trace with hash -363582894, now seen corresponding path program 5 times [2019-11-19 19:07:16,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:07:16,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686354682] [2019-11-19 19:07:16,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:07:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:07:16,682 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-19 19:07:16,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686354682] [2019-11-19 19:07:16,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:07:16,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-19 19:07:16,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935095958] [2019-11-19 19:07:16,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 19:07:16,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:07:16,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 19:07:16,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-19 19:07:16,684 INFO L87 Difference]: Start difference. First operand 2178 states and 6612 transitions. Second operand 9 states. [2019-11-19 19:07:16,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:07:16,911 INFO L93 Difference]: Finished difference Result 2326 states and 6975 transitions. [2019-11-19 19:07:16,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 19:07:16,911 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-11-19 19:07:16,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:07:16,915 INFO L225 Difference]: With dead ends: 2326 [2019-11-19 19:07:16,915 INFO L226 Difference]: Without dead ends: 1650 [2019-11-19 19:07:16,915 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-11-19 19:07:16,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2019-11-19 19:07:16,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1650. [2019-11-19 19:07:16,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1650 states. [2019-11-19 19:07:16,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1650 states and 4944 transitions. [2019-11-19 19:07:16,938 INFO L78 Accepts]: Start accepts. Automaton has 1650 states and 4944 transitions. Word has length 35 [2019-11-19 19:07:16,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:07:16,939 INFO L462 AbstractCegarLoop]: Abstraction has 1650 states and 4944 transitions. [2019-11-19 19:07:16,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 19:07:16,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 4944 transitions. [2019-11-19 19:07:16,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-19 19:07:16,942 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:07:16,942 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 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] [2019-11-19 19:07:16,942 INFO L410 AbstractCegarLoop]: === Iteration 17 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 19:07:16,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:07:16,943 INFO L82 PathProgramCache]: Analyzing trace with hash 468437586, now seen corresponding path program 6 times [2019-11-19 19:07:16,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:07:16,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873517113] [2019-11-19 19:07:16,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:07:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:07:17,102 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-19 19:07:17,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873517113] [2019-11-19 19:07:17,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:07:17,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-19 19:07:17,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108010137] [2019-11-19 19:07:17,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 19:07:17,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:07:17,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 19:07:17,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-19 19:07:17,104 INFO L87 Difference]: Start difference. First operand 1650 states and 4944 transitions. Second operand 9 states. [2019-11-19 19:07:17,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:07:17,389 INFO L93 Difference]: Finished difference Result 1170 states and 3320 transitions. [2019-11-19 19:07:17,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 19:07:17,389 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-11-19 19:07:17,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:07:17,391 INFO L225 Difference]: With dead ends: 1170 [2019-11-19 19:07:17,391 INFO L226 Difference]: Without dead ends: 798 [2019-11-19 19:07:17,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-11-19 19:07:17,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2019-11-19 19:07:17,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 798. [2019-11-19 19:07:17,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2019-11-19 19:07:17,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 2129 transitions. [2019-11-19 19:07:17,402 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 2129 transitions. Word has length 35 [2019-11-19 19:07:17,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:07:17,402 INFO L462 AbstractCegarLoop]: Abstraction has 798 states and 2129 transitions. [2019-11-19 19:07:17,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 19:07:17,402 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 2129 transitions. [2019-11-19 19:07:17,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-19 19:07:17,404 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 19:07:17,404 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 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] [2019-11-19 19:07:17,404 INFO L410 AbstractCegarLoop]: === Iteration 18 === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 19:07:17,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:07:17,404 INFO L82 PathProgramCache]: Analyzing trace with hash 468437170, now seen corresponding path program 1 times [2019-11-19 19:07:17,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:07:17,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767033695] [2019-11-19 19:07:17,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:07:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:07:17,536 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-19 19:07:17,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767033695] [2019-11-19 19:07:17,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:07:17,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-19 19:07:17,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417485249] [2019-11-19 19:07:17,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 19:07:17,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:07:17,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 19:07:17,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-19 19:07:17,538 INFO L87 Difference]: Start difference. First operand 798 states and 2129 transitions. Second operand 9 states. [2019-11-19 19:07:17,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:07:17,699 INFO L93 Difference]: Finished difference Result 670 states and 1713 transitions. [2019-11-19 19:07:17,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 19:07:17,700 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-11-19 19:07:17,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 19:07:17,700 INFO L225 Difference]: With dead ends: 670 [2019-11-19 19:07:17,701 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 19:07:17,701 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-11-19 19:07:17,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 19:07:17,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 19:07:17,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 19:07:17,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 19:07:17,702 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2019-11-19 19:07:17,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 19:07:17,702 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 19:07:17,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 19:07:17,702 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 19:07:17,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 19:07:17,705 INFO L304 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-19 19:07:17,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:07:17 BasicIcfg [2019-11-19 19:07:17,707 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 19:07:17,708 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 19:07:17,708 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 19:07:17,708 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 19:07:17,708 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:07:02" (3/4) ... [2019-11-19 19:07:17,712 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 19:07:17,720 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thr1 [2019-11-19 19:07:17,724 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-11-19 19:07:17,724 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-19 19:07:17,724 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-19 19:07:17,762 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 19:07:17,763 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 19:07:17,765 INFO L168 Benchmark]: Toolchain (without parser) took 16539.20 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 654.8 MB). Free memory was 961.7 MB in the beginning and 1.0 GB in the end (delta: -50.6 MB). Peak memory consumption was 604.3 MB. Max. memory is 11.5 GB. [2019-11-19 19:07:17,766 INFO L168 Benchmark]: CDTParser took 0.66 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 19:07:17,766 INFO L168 Benchmark]: CACSL2BoogieTranslator took 690.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -170.3 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-19 19:07:17,767 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-19 19:07:17,767 INFO L168 Benchmark]: Boogie Preprocessor took 31.76 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. [2019-11-19 19:07:17,768 INFO L168 Benchmark]: RCFGBuilder took 387.09 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: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2019-11-19 19:07:17,768 INFO L168 Benchmark]: TraceAbstraction took 15294.07 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 498.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 81.2 MB). Peak memory consumption was 579.3 MB. Max. memory is 11.5 GB. [2019-11-19 19:07:17,769 INFO L168 Benchmark]: Witness Printer took 55.15 ms. Allocated memory is still 1.7 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2019-11-19 19:07:17,772 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.66 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 690.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -170.3 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.76 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 387.09 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: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15294.07 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 498.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 81.2 MB). Peak memory consumption was 579.3 MB. Max. memory is 11.5 GB. * Witness Printer took 55.15 ms. Allocated memory is still 1.7 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 695]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 695]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 695]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 695]: 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, 64 locations, 4 error locations. Result: SAFE, OverallTime: 15.1s, OverallIterations: 18, TraceHistogramMax: 3, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1570 SDtfs, 2474 SDslu, 4871 SDs, 0 SdLazy, 2529 SolverSat, 190 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 222 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19779occurred 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: 3.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 38228 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 513 NumberOfCodeBlocks, 513 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 495 ConstructedInterpolants, 0 QuantifiedInterpolants, 65274 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 101/101 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...