./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/transmitter.01.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c 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/systemc/transmitter.01.cil.c -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 18c351eab8f6ce363bd7076ce800527c30b2b6c5 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 17:32:34,223 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:32:34,226 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:32:34,245 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:32:34,246 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:32:34,248 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:32:34,251 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:32:34,265 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:32:34,268 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:32:34,270 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:32:34,272 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:32:34,274 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:32:34,275 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:32:34,279 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:32:34,281 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:32:34,283 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:32:34,285 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:32:34,287 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:32:34,290 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:32:34,295 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:32:34,301 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:32:34,304 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:32:34,307 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:32:34,309 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:32:34,311 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:32:34,312 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:32:34,312 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:32:34,313 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:32:34,313 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:32:34,314 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:32:34,315 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:32:34,316 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:32:34,316 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:32:34,317 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:32:34,318 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:32:34,319 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:32:34,320 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:32:34,320 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:32:34,320 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:32:34,321 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:32:34,322 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:32:34,323 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 17:32:34,338 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:32:34,339 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:32:34,340 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:32:34,341 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:32:34,341 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:32:34,341 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:32:34,342 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:32:34,342 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:32:34,342 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:32:34,343 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:32:34,343 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:32:34,343 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:32:34,344 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:32:34,344 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:32:34,344 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:32:34,344 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:32:34,345 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:32:34,345 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:32:34,345 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:32:34,346 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:32:34,346 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:32:34,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:32:34,347 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:32:34,347 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:32:34,347 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:32:34,347 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:32:34,348 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:32:34,348 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:32:34,348 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:32:34,349 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 -> 18c351eab8f6ce363bd7076ce800527c30b2b6c5 [2019-11-28 17:32:34,650 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:32:34,664 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:32:34,668 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:32:34,670 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:32:34,670 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:32:34,671 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.01.cil.c [2019-11-28 17:32:34,736 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d68232256/74f8a5d39fd24ecca6144db9d8112fd6/FLAGc7d7c9171 [2019-11-28 17:32:35,271 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:32:35,272 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.01.cil.c [2019-11-28 17:32:35,283 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d68232256/74f8a5d39fd24ecca6144db9d8112fd6/FLAGc7d7c9171 [2019-11-28 17:32:35,568 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d68232256/74f8a5d39fd24ecca6144db9d8112fd6 [2019-11-28 17:32:35,571 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:32:35,573 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:32:35,574 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:32:35,574 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:32:35,578 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:32:35,579 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:32:35" (1/1) ... [2019-11-28 17:32:35,582 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@91324ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:32:35, skipping insertion in model container [2019-11-28 17:32:35,583 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:32:35" (1/1) ... [2019-11-28 17:32:35,591 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:32:35,631 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:32:35,865 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:32:35,871 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:32:35,912 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:32:35,995 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:32:35,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:32:35 WrapperNode [2019-11-28 17:32:35,997 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:32:35,998 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:32:35,998 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:32:35,998 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:32:36,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:32:35" (1/1) ... [2019-11-28 17:32:36,014 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:32:35" (1/1) ... [2019-11-28 17:32:36,048 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:32:36,048 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:32:36,049 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:32:36,049 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:32:36,058 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:32:35" (1/1) ... [2019-11-28 17:32:36,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:32:35" (1/1) ... [2019-11-28 17:32:36,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:32:35" (1/1) ... [2019-11-28 17:32:36,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:32:35" (1/1) ... [2019-11-28 17:32:36,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:32:35" (1/1) ... [2019-11-28 17:32:36,078 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:32:35" (1/1) ... [2019-11-28 17:32:36,081 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:32:35" (1/1) ... [2019-11-28 17:32:36,085 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:32:36,086 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:32:36,086 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:32:36,086 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:32:36,088 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:32:35" (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-28 17:32:36,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:32:36,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:32:36,789 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:32:36,789 INFO L287 CfgBuilder]: Removed 73 assume(true) statements. [2019-11-28 17:32:36,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:32:36 BoogieIcfgContainer [2019-11-28 17:32:36,792 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:32:36,793 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:32:36,793 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:32:36,797 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:32:36,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:32:35" (1/3) ... [2019-11-28 17:32:36,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e34a637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:32:36, skipping insertion in model container [2019-11-28 17:32:36,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:32:35" (2/3) ... [2019-11-28 17:32:36,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e34a637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:32:36, skipping insertion in model container [2019-11-28 17:32:36,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:32:36" (3/3) ... [2019-11-28 17:32:36,804 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.01.cil.c [2019-11-28 17:32:36,815 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:32:36,823 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 17:32:36,837 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 17:32:36,878 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:32:36,879 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:32:36,879 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:32:36,879 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:32:36,880 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:32:36,881 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:32:36,881 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:32:36,881 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:32:36,898 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states. [2019-11-28 17:32:36,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 17:32:36,905 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:32:36,906 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:32:36,906 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:32:36,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:32:36,911 INFO L82 PathProgramCache]: Analyzing trace with hash 827300887, now seen corresponding path program 1 times [2019-11-28 17:32:36,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:32:36,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875297801] [2019-11-28 17:32:36,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:32:36,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:32:37,063 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-28 17:32:37,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875297801] [2019-11-28 17:32:37,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:32:37,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:32:37,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519073121] [2019-11-28 17:32:37,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:32:37,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:32:37,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:32:37,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:32:37,096 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 3 states. [2019-11-28 17:32:37,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:32:37,151 INFO L93 Difference]: Finished difference Result 239 states and 373 transitions. [2019-11-28 17:32:37,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:32:37,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-28 17:32:37,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:32:37,166 INFO L225 Difference]: With dead ends: 239 [2019-11-28 17:32:37,167 INFO L226 Difference]: Without dead ends: 118 [2019-11-28 17:32:37,171 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-28 17:32:37,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-28 17:32:37,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-11-28 17:32:37,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-28 17:32:37,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 174 transitions. [2019-11-28 17:32:37,225 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 174 transitions. Word has length 37 [2019-11-28 17:32:37,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:32:37,226 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 174 transitions. [2019-11-28 17:32:37,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:32:37,226 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 174 transitions. [2019-11-28 17:32:37,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 17:32:37,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:32:37,228 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:32:37,229 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:32:37,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:32:37,230 INFO L82 PathProgramCache]: Analyzing trace with hash 899687445, now seen corresponding path program 1 times [2019-11-28 17:32:37,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:32:37,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439090414] [2019-11-28 17:32:37,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:32:37,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:32:37,269 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-28 17:32:37,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439090414] [2019-11-28 17:32:37,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:32:37,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:32:37,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110606709] [2019-11-28 17:32:37,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:32:37,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:32:37,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:32:37,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:32:37,274 INFO L87 Difference]: Start difference. First operand 118 states and 174 transitions. Second operand 3 states. [2019-11-28 17:32:37,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:32:37,397 INFO L93 Difference]: Finished difference Result 308 states and 454 transitions. [2019-11-28 17:32:37,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:32:37,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-28 17:32:37,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:32:37,402 INFO L225 Difference]: With dead ends: 308 [2019-11-28 17:32:37,406 INFO L226 Difference]: Without dead ends: 196 [2019-11-28 17:32:37,408 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:32:37,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-28 17:32:37,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2019-11-28 17:32:37,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-28 17:32:37,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 280 transitions. [2019-11-28 17:32:37,459 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 280 transitions. Word has length 37 [2019-11-28 17:32:37,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:32:37,459 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 280 transitions. [2019-11-28 17:32:37,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:32:37,462 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 280 transitions. [2019-11-28 17:32:37,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 17:32:37,463 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:32:37,463 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:32:37,463 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:32:37,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:32:37,464 INFO L82 PathProgramCache]: Analyzing trace with hash -413900843, now seen corresponding path program 1 times [2019-11-28 17:32:37,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:32:37,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268330778] [2019-11-28 17:32:37,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:32:37,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:32:37,539 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-28 17:32:37,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268330778] [2019-11-28 17:32:37,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:32:37,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:32:37,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765003502] [2019-11-28 17:32:37,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:32:37,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:32:37,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:32:37,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:32:37,544 INFO L87 Difference]: Start difference. First operand 194 states and 280 transitions. Second operand 3 states. [2019-11-28 17:32:37,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:32:37,585 INFO L93 Difference]: Finished difference Result 381 states and 551 transitions. [2019-11-28 17:32:37,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:32:37,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-28 17:32:37,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:32:37,588 INFO L225 Difference]: With dead ends: 381 [2019-11-28 17:32:37,589 INFO L226 Difference]: Without dead ends: 194 [2019-11-28 17:32:37,590 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:32:37,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-11-28 17:32:37,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2019-11-28 17:32:37,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-28 17:32:37,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 272 transitions. [2019-11-28 17:32:37,611 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 272 transitions. Word has length 37 [2019-11-28 17:32:37,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:32:37,611 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 272 transitions. [2019-11-28 17:32:37,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:32:37,612 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 272 transitions. [2019-11-28 17:32:37,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 17:32:37,613 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:32:37,614 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:32:37,614 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:32:37,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:32:37,615 INFO L82 PathProgramCache]: Analyzing trace with hash -733369323, now seen corresponding path program 1 times [2019-11-28 17:32:37,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:32:37,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678390871] [2019-11-28 17:32:37,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:32:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:32:37,660 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-28 17:32:37,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678390871] [2019-11-28 17:32:37,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:32:37,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:32:37,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431540918] [2019-11-28 17:32:37,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:32:37,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:32:37,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:32:37,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:32:37,664 INFO L87 Difference]: Start difference. First operand 194 states and 272 transitions. Second operand 3 states. [2019-11-28 17:32:37,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:32:37,709 INFO L93 Difference]: Finished difference Result 380 states and 534 transitions. [2019-11-28 17:32:37,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:32:37,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-28 17:32:37,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:32:37,712 INFO L225 Difference]: With dead ends: 380 [2019-11-28 17:32:37,712 INFO L226 Difference]: Without dead ends: 194 [2019-11-28 17:32:37,714 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:32:37,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-11-28 17:32:37,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2019-11-28 17:32:37,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-11-28 17:32:37,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 260 transitions. [2019-11-28 17:32:37,745 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 260 transitions. Word has length 37 [2019-11-28 17:32:37,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:32:37,745 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 260 transitions. [2019-11-28 17:32:37,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:32:37,745 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 260 transitions. [2019-11-28 17:32:37,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 17:32:37,746 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:32:37,749 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:32:37,749 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:32:37,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:32:37,750 INFO L82 PathProgramCache]: Analyzing trace with hash -2103987404, now seen corresponding path program 1 times [2019-11-28 17:32:37,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:32:37,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355113683] [2019-11-28 17:32:37,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:32:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:32:37,806 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-28 17:32:37,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355113683] [2019-11-28 17:32:37,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:32:37,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:32:37,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530590107] [2019-11-28 17:32:37,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:32:37,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:32:37,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:32:37,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:32:37,810 INFO L87 Difference]: Start difference. First operand 194 states and 260 transitions. Second operand 3 states. [2019-11-28 17:32:37,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:32:37,887 INFO L93 Difference]: Finished difference Result 525 states and 700 transitions. [2019-11-28 17:32:37,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:32:37,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-28 17:32:37,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:32:37,890 INFO L225 Difference]: With dead ends: 525 [2019-11-28 17:32:37,891 INFO L226 Difference]: Without dead ends: 356 [2019-11-28 17:32:37,893 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-28 17:32:37,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-11-28 17:32:37,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 334. [2019-11-28 17:32:37,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-28 17:32:37,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 435 transitions. [2019-11-28 17:32:37,937 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 435 transitions. Word has length 37 [2019-11-28 17:32:37,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:32:37,938 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 435 transitions. [2019-11-28 17:32:37,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:32:37,938 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 435 transitions. [2019-11-28 17:32:37,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-28 17:32:37,943 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:32:37,943 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:32:37,944 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:32:37,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:32:37,944 INFO L82 PathProgramCache]: Analyzing trace with hash -303434219, now seen corresponding path program 1 times [2019-11-28 17:32:37,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:32:37,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015216292] [2019-11-28 17:32:37,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:32:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:32:38,042 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-28 17:32:38,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015216292] [2019-11-28 17:32:38,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:32:38,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 17:32:38,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075944997] [2019-11-28 17:32:38,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:32:38,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:32:38,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:32:38,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:32:38,045 INFO L87 Difference]: Start difference. First operand 334 states and 435 transitions. Second operand 3 states. [2019-11-28 17:32:38,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:32:38,115 INFO L93 Difference]: Finished difference Result 910 states and 1192 transitions. [2019-11-28 17:32:38,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:32:38,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-28 17:32:38,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:32:38,120 INFO L225 Difference]: With dead ends: 910 [2019-11-28 17:32:38,120 INFO L226 Difference]: Without dead ends: 606 [2019-11-28 17:32:38,122 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:32:38,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-11-28 17:32:38,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 598. [2019-11-28 17:32:38,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-11-28 17:32:38,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 772 transitions. [2019-11-28 17:32:38,159 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 772 transitions. Word has length 38 [2019-11-28 17:32:38,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:32:38,160 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 772 transitions. [2019-11-28 17:32:38,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:32:38,160 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 772 transitions. [2019-11-28 17:32:38,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 17:32:38,161 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:32:38,162 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2019-11-28 17:32:38,162 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:32:38,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:32:38,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1237930563, now seen corresponding path program 1 times [2019-11-28 17:32:38,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:32:38,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068133015] [2019-11-28 17:32:38,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:32:38,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:32:38,228 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:32:38,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068133015] [2019-11-28 17:32:38,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:32:38,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:32:38,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614266417] [2019-11-28 17:32:38,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:32:38,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:32:38,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:32:38,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:32:38,238 INFO L87 Difference]: Start difference. First operand 598 states and 772 transitions. Second operand 3 states. [2019-11-28 17:32:38,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:32:38,326 INFO L93 Difference]: Finished difference Result 1152 states and 1499 transitions. [2019-11-28 17:32:38,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:32:38,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-28 17:32:38,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:32:38,333 INFO L225 Difference]: With dead ends: 1152 [2019-11-28 17:32:38,333 INFO L226 Difference]: Without dead ends: 864 [2019-11-28 17:32:38,335 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-28 17:32:38,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2019-11-28 17:32:38,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 864. [2019-11-28 17:32:38,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2019-11-28 17:32:38,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1109 transitions. [2019-11-28 17:32:38,388 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1109 transitions. Word has length 51 [2019-11-28 17:32:38,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:32:38,390 INFO L462 AbstractCegarLoop]: Abstraction has 864 states and 1109 transitions. [2019-11-28 17:32:38,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:32:38,390 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1109 transitions. [2019-11-28 17:32:38,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-28 17:32:38,392 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:32:38,392 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 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-28 17:32:38,393 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:32:38,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:32:38,394 INFO L82 PathProgramCache]: Analyzing trace with hash -690734764, now seen corresponding path program 1 times [2019-11-28 17:32:38,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:32:38,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460876284] [2019-11-28 17:32:38,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:32:38,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:32:38,535 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-28 17:32:38,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460876284] [2019-11-28 17:32:38,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:32:38,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:32:38,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465688419] [2019-11-28 17:32:38,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:32:38,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:32:38,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:32:38,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:32:38,537 INFO L87 Difference]: Start difference. First operand 864 states and 1109 transitions. Second operand 5 states. [2019-11-28 17:32:38,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:32:38,764 INFO L93 Difference]: Finished difference Result 2777 states and 3544 transitions. [2019-11-28 17:32:38,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:32:38,764 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-11-28 17:32:38,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:32:38,774 INFO L225 Difference]: With dead ends: 2777 [2019-11-28 17:32:38,774 INFO L226 Difference]: Without dead ends: 1948 [2019-11-28 17:32:38,776 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:32:38,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1948 states. [2019-11-28 17:32:38,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1948 to 909. [2019-11-28 17:32:38,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-11-28 17:32:38,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1143 transitions. [2019-11-28 17:32:38,857 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1143 transitions. Word has length 68 [2019-11-28 17:32:38,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:32:38,858 INFO L462 AbstractCegarLoop]: Abstraction has 909 states and 1143 transitions. [2019-11-28 17:32:38,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:32:38,858 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1143 transitions. [2019-11-28 17:32:38,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-28 17:32:38,860 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:32:38,861 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 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-28 17:32:38,861 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:32:38,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:32:38,861 INFO L82 PathProgramCache]: Analyzing trace with hash 696050646, now seen corresponding path program 1 times [2019-11-28 17:32:38,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:32:38,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449816441] [2019-11-28 17:32:38,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:32:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:32:38,959 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-28 17:32:38,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449816441] [2019-11-28 17:32:38,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:32:38,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:32:38,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688198116] [2019-11-28 17:32:38,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:32:38,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:32:38,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:32:38,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:32:38,962 INFO L87 Difference]: Start difference. First operand 909 states and 1143 transitions. Second operand 5 states. [2019-11-28 17:32:39,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:32:39,192 INFO L93 Difference]: Finished difference Result 2232 states and 2821 transitions. [2019-11-28 17:32:39,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:32:39,193 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-11-28 17:32:39,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:32:39,200 INFO L225 Difference]: With dead ends: 2232 [2019-11-28 17:32:39,200 INFO L226 Difference]: Without dead ends: 1361 [2019-11-28 17:32:39,202 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:32:39,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2019-11-28 17:32:39,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 921. [2019-11-28 17:32:39,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2019-11-28 17:32:39,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1133 transitions. [2019-11-28 17:32:39,279 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1133 transitions. Word has length 68 [2019-11-28 17:32:39,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:32:39,279 INFO L462 AbstractCegarLoop]: Abstraction has 921 states and 1133 transitions. [2019-11-28 17:32:39,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:32:39,280 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1133 transitions. [2019-11-28 17:32:39,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-28 17:32:39,281 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:32:39,281 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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, 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-28 17:32:39,282 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:32:39,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:32:39,282 INFO L82 PathProgramCache]: Analyzing trace with hash 680531928, now seen corresponding path program 1 times [2019-11-28 17:32:39,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:32:39,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622049519] [2019-11-28 17:32:39,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:32:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:32:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:32:39,349 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 17:32:39,350 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 17:32:39,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:32:39 BoogieIcfgContainer [2019-11-28 17:32:39,436 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:32:39,437 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:32:39,437 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:32:39,437 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:32:39,437 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:32:36" (3/4) ... [2019-11-28 17:32:39,440 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 17:32:39,541 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:32:39,542 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:32:39,544 INFO L168 Benchmark]: Toolchain (without parser) took 3970.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 197.1 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -150.2 MB). Peak memory consumption was 46.9 MB. Max. memory is 11.5 GB. [2019-11-28 17:32:39,545 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:32:39,545 INFO L168 Benchmark]: CACSL2BoogieTranslator took 423.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -160.7 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-11-28 17:32:39,546 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.16 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:32:39,546 INFO L168 Benchmark]: Boogie Preprocessor took 37.10 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:32:39,547 INFO L168 Benchmark]: RCFGBuilder took 705.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.2 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. [2019-11-28 17:32:39,548 INFO L168 Benchmark]: TraceAbstraction took 2643.38 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 78.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -42.4 MB). Peak memory consumption was 36.2 MB. Max. memory is 11.5 GB. [2019-11-28 17:32:39,548 INFO L168 Benchmark]: Witness Printer took 105.24 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: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 11.5 GB. [2019-11-28 17:32:39,551 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 423.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -160.7 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.16 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.10 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 705.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.2 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2643.38 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 78.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -42.4 MB). Peak memory consumption was 36.2 MB. Max. memory is 11.5 GB. * Witness Printer took 105.24 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: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 11]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] int m_pc = 0; [L16] int t1_pc = 0; [L17] int m_st ; [L18] int t1_st ; [L19] int m_i ; [L20] int t1_i ; [L21] int M_E = 2; [L22] int T1_E = 2; [L23] int E_1 = 2; VAL [E_1=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0] [L439] int __retres1 ; [L354] m_i = 1 [L355] t1_i = 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L380] int kernel_st ; [L381] int tmp ; [L382] int tmp___0 ; [L386] kernel_st = 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L151] COND TRUE m_i == 1 [L152] m_st = 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L156] COND TRUE t1_i == 1 [L157] t1_st = 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L240] COND FALSE !(M_E == 0) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L245] COND FALSE !(T1_E == 0) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L250] COND FALSE !(E_1 == 0) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L283] int tmp ; [L284] int tmp___0 ; [L102] int __retres1 ; VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L105] COND FALSE !(m_pc == 1) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L115] __retres1 = 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L117] return (__retres1); VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L288] tmp = is_master_triggered() [L290] COND FALSE !(\read(tmp)) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L121] int __retres1 ; VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L124] COND FALSE !(t1_pc == 1) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L134] __retres1 = 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L136] return (__retres1); VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L296] tmp___0 = is_transmit1_triggered() [L298] COND FALSE !(\read(tmp___0)) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L263] COND FALSE !(M_E == 1) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L268] COND FALSE !(T1_E == 1) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L273] COND FALSE !(E_1 == 1) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L394] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L397] kernel_st = 1 [L187] int tmp ; VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L191] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L166] int __retres1 ; VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L169] COND TRUE m_st == 0 [L170] __retres1 = 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L182] return (__retres1); VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L194] tmp = exists_runnable_thread() [L196] COND TRUE \read(tmp) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L201] COND TRUE m_st == 0 [L202] int tmp_ndt_1; [L203] tmp_ndt_1 = __VERIFIER_nondet_int() [L204] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0] [L215] COND TRUE t1_st == 0 [L216] int tmp_ndt_2; [L217] tmp_ndt_2 = __VERIFIER_nondet_int() [L218] COND TRUE \read(tmp_ndt_2) [L220] t1_st = 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L72] COND TRUE t1_pc == 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L83] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1] [L85] t1_pc = 1 [L86] t1_st = 2 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L191] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L166] int __retres1 ; VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L169] COND TRUE m_st == 0 [L170] __retres1 = 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L182] return (__retres1); VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L194] tmp = exists_runnable_thread() [L196] COND TRUE \read(tmp) VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L201] COND TRUE m_st == 0 [L202] int tmp_ndt_1; [L203] tmp_ndt_1 = __VERIFIER_nondet_int() [L204] COND TRUE \read(tmp_ndt_1) [L206] m_st = 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L31] COND TRUE m_pc == 0 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L42] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L45] E_1 = 1 [L283] int tmp ; [L284] int tmp___0 ; [L102] int __retres1 ; VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L105] COND FALSE !(m_pc == 1) VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L115] __retres1 = 0 VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L117] return (__retres1); VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L288] tmp = is_master_triggered() [L290] COND FALSE !(\read(tmp)) VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L121] int __retres1 ; VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L124] COND TRUE t1_pc == 1 VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L125] COND TRUE E_1 == 1 [L126] __retres1 = 1 VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L136] return (__retres1); VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2] [L296] tmp___0 = is_transmit1_triggered() [L298] COND TRUE \read(tmp___0) [L299] t1_st = 0 VAL [E_1=1, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L47] E_1 = 2 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L50] COND TRUE 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L52] m_pc = 1 [L53] m_st = 2 VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0] [L215] COND TRUE t1_st == 0 [L216] int tmp_ndt_2; [L217] tmp_ndt_2 = __VERIFIER_nondet_int() [L218] COND TRUE \read(tmp_ndt_2) [L220] t1_st = 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L72] COND FALSE !(t1_pc == 0) VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L75] COND TRUE t1_pc == 1 VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] [L11] __VERIFIER_error() VAL [E_1=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 122 locations, 1 error locations. Result: UNSAFE, OverallTime: 2.4s, OverallIterations: 10, TraceHistogramMax: 2, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1554 SDtfs, 1693 SDslu, 1435 SDs, 0 SdLazy, 165 SolverSat, 70 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=921occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 1511 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 478 NumberOfCodeBlocks, 478 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 401 ConstructedInterpolants, 0 QuantifiedInterpolants, 28171 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 33/33 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 incorrect! Received shutdown request...