./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d1884ae6-be12-47de-8a63-46c5eeec2ee8/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d1884ae6-be12-47de-8a63-46c5eeec2ee8/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d1884ae6-be12-47de-8a63-46c5eeec2ee8/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d1884ae6-be12-47de-8a63-46c5eeec2ee8/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d1884ae6-be12-47de-8a63-46c5eeec2ee8/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d1884ae6-be12-47de-8a63-46c5eeec2ee8/bin-2019/uautomizer --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 fc492c809d432e4c3053fa8c39191c1c15ea4eea ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 06:32:25,449 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 06:32:25,451 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 06:32:25,460 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 06:32:25,460 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 06:32:25,461 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 06:32:25,462 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 06:32:25,463 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 06:32:25,464 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 06:32:25,465 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 06:32:25,465 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 06:32:25,465 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 06:32:25,466 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 06:32:25,467 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 06:32:25,468 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 06:32:25,468 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 06:32:25,469 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 06:32:25,470 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 06:32:25,471 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 06:32:25,472 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 06:32:25,473 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 06:32:25,474 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 06:32:25,475 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 06:32:25,476 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 06:32:25,476 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 06:32:25,476 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 06:32:25,477 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 06:32:25,478 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 06:32:25,478 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 06:32:25,479 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 06:32:25,479 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 06:32:25,479 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 06:32:25,480 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 06:32:25,480 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 06:32:25,480 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 06:32:25,481 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 06:32:25,481 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d1884ae6-be12-47de-8a63-46c5eeec2ee8/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-09 06:32:25,491 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 06:32:25,491 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 06:32:25,492 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 06:32:25,492 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 06:32:25,493 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 06:32:25,493 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 06:32:25,493 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 06:32:25,493 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 06:32:25,493 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 06:32:25,493 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 06:32:25,494 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 06:32:25,494 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 06:32:25,494 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 06:32:25,494 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 06:32:25,494 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 06:32:25,494 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 06:32:25,494 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 06:32:25,495 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 06:32:25,495 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 06:32:25,495 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 06:32:25,495 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 06:32:25,495 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 06:32:25,495 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 06:32:25,496 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 06:32:25,496 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 06:32:25,496 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 06:32:25,496 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 06:32:25,496 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 06:32:25,496 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 06:32:25,496 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 06:32:25,497 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_d1884ae6-be12-47de-8a63-46c5eeec2ee8/bin-2019/uautomizer 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 -> fc492c809d432e4c3053fa8c39191c1c15ea4eea [2018-12-09 06:32:25,519 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 06:32:25,526 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 06:32:25,528 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 06:32:25,529 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 06:32:25,529 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 06:32:25,529 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d1884ae6-be12-47de-8a63-46c5eeec2ee8/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-09 06:32:25,563 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d1884ae6-be12-47de-8a63-46c5eeec2ee8/bin-2019/uautomizer/data/4f60e0965/35b5cff222be446395ce9a3d58da07c5/FLAG46bbae3a2 [2018-12-09 06:32:26,018 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 06:32:26,019 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d1884ae6-be12-47de-8a63-46c5eeec2ee8/sv-benchmarks/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-09 06:32:26,022 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d1884ae6-be12-47de-8a63-46c5eeec2ee8/bin-2019/uautomizer/data/4f60e0965/35b5cff222be446395ce9a3d58da07c5/FLAG46bbae3a2 [2018-12-09 06:32:26,033 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d1884ae6-be12-47de-8a63-46c5eeec2ee8/bin-2019/uautomizer/data/4f60e0965/35b5cff222be446395ce9a3d58da07c5 [2018-12-09 06:32:26,035 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 06:32:26,036 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 06:32:26,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 06:32:26,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 06:32:26,039 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 06:32:26,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:32:26" (1/1) ... [2018-12-09 06:32:26,042 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f79c046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:32:26, skipping insertion in model container [2018-12-09 06:32:26,042 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:32:26" (1/1) ... [2018-12-09 06:32:26,048 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 06:32:26,061 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 06:32:26,148 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 06:32:26,151 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 06:32:26,163 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 06:32:26,171 INFO L195 MainTranslator]: Completed translation [2018-12-09 06:32:26,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:32:26 WrapperNode [2018-12-09 06:32:26,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 06:32:26,171 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 06:32:26,172 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 06:32:26,172 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 06:32:26,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:32:26" (1/1) ... [2018-12-09 06:32:26,180 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:32:26" (1/1) ... [2018-12-09 06:32:26,183 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 06:32:26,184 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 06:32:26,184 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 06:32:26,184 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 06:32:26,189 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:32:26" (1/1) ... [2018-12-09 06:32:26,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:32:26" (1/1) ... [2018-12-09 06:32:26,190 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:32:26" (1/1) ... [2018-12-09 06:32:26,190 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:32:26" (1/1) ... [2018-12-09 06:32:26,222 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:32:26" (1/1) ... [2018-12-09 06:32:26,226 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:32:26" (1/1) ... [2018-12-09 06:32:26,227 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:32:26" (1/1) ... [2018-12-09 06:32:26,228 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 06:32:26,228 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 06:32:26,228 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 06:32:26,228 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 06:32:26,228 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:32:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d1884ae6-be12-47de-8a63-46c5eeec2ee8/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 06:32:26,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 06:32:26,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 06:32:26,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 06:32:26,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 06:32:26,260 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 06:32:26,260 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 06:32:26,366 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 06:32:26,366 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 06:32:26,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:32:26 BoogieIcfgContainer [2018-12-09 06:32:26,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 06:32:26,366 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 06:32:26,367 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 06:32:26,368 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 06:32:26,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 06:32:26" (1/3) ... [2018-12-09 06:32:26,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c6a0457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:32:26, skipping insertion in model container [2018-12-09 06:32:26,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:32:26" (2/3) ... [2018-12-09 06:32:26,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c6a0457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:32:26, skipping insertion in model container [2018-12-09 06:32:26,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:32:26" (3/3) ... [2018-12-09 06:32:26,370 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-09 06:32:26,376 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 06:32:26,381 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 06:32:26,389 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 06:32:26,406 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 06:32:26,406 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 06:32:26,406 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 06:32:26,406 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 06:32:26,406 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 06:32:26,406 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 06:32:26,407 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 06:32:26,407 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 06:32:26,407 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 06:32:26,416 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-12-09 06:32:26,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 06:32:26,419 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:32:26,420 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:32:26,421 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:32:26,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:32:26,424 INFO L82 PathProgramCache]: Analyzing trace with hash 429652513, now seen corresponding path program 1 times [2018-12-09 06:32:26,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:32:26,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:32:26,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:32:26,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:32:26,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:32:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:32:26,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:32:26,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:32:26,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:32:26,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:32:26,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:32:26,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:32:26,527 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2018-12-09 06:32:26,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:32:26,552 INFO L93 Difference]: Finished difference Result 63 states and 102 transitions. [2018-12-09 06:32:26,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:32:26,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-09 06:32:26,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:32:26,559 INFO L225 Difference]: With dead ends: 63 [2018-12-09 06:32:26,559 INFO L226 Difference]: Without dead ends: 48 [2018-12-09 06:32:26,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:32:26,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-09 06:32:26,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2018-12-09 06:32:26,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-09 06:32:26,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2018-12-09 06:32:26,583 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 16 [2018-12-09 06:32:26,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:32:26,583 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2018-12-09 06:32:26,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:32:26,583 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2018-12-09 06:32:26,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 06:32:26,584 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:32:26,584 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:32:26,584 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:32:26,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:32:26,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1109710883, now seen corresponding path program 1 times [2018-12-09 06:32:26,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:32:26,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:32:26,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:32:26,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:32:26,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:32:26,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:32:26,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:32:26,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:32:26,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:32:26,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:32:26,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:32:26,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:32:26,610 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2018-12-09 06:32:26,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:32:26,625 INFO L93 Difference]: Finished difference Result 77 states and 132 transitions. [2018-12-09 06:32:26,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:32:26,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-09 06:32:26,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:32:26,626 INFO L225 Difference]: With dead ends: 77 [2018-12-09 06:32:26,626 INFO L226 Difference]: Without dead ends: 48 [2018-12-09 06:32:26,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:32:26,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-09 06:32:26,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-12-09 06:32:26,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-09 06:32:26,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 77 transitions. [2018-12-09 06:32:26,630 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 77 transitions. Word has length 16 [2018-12-09 06:32:26,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:32:26,630 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 77 transitions. [2018-12-09 06:32:26,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:32:26,630 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 77 transitions. [2018-12-09 06:32:26,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 06:32:26,631 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:32:26,631 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:32:26,631 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:32:26,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:32:26,631 INFO L82 PathProgramCache]: Analyzing trace with hash 434540691, now seen corresponding path program 1 times [2018-12-09 06:32:26,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:32:26,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:32:26,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:32:26,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:32:26,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:32:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:32:26,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:32:26,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:32:26,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:32:26,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:32:26,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:32:26,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:32:26,650 INFO L87 Difference]: Start difference. First operand 46 states and 77 transitions. Second operand 3 states. [2018-12-09 06:32:26,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:32:26,660 INFO L93 Difference]: Finished difference Result 72 states and 117 transitions. [2018-12-09 06:32:26,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:32:26,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-09 06:32:26,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:32:26,660 INFO L225 Difference]: With dead ends: 72 [2018-12-09 06:32:26,660 INFO L226 Difference]: Without dead ends: 51 [2018-12-09 06:32:26,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:32:26,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-09 06:32:26,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-12-09 06:32:26,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-09 06:32:26,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 79 transitions. [2018-12-09 06:32:26,664 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 79 transitions. Word has length 17 [2018-12-09 06:32:26,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:32:26,664 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 79 transitions. [2018-12-09 06:32:26,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:32:26,665 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2018-12-09 06:32:26,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 06:32:26,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:32:26,665 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:32:26,665 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:32:26,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:32:26,665 INFO L82 PathProgramCache]: Analyzing trace with hash 41513681, now seen corresponding path program 1 times [2018-12-09 06:32:26,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:32:26,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:32:26,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:32:26,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:32:26,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:32:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:32:26,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:32:26,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:32:26,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:32:26,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:32:26,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:32:26,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:32:26,682 INFO L87 Difference]: Start difference. First operand 49 states and 79 transitions. Second operand 3 states. [2018-12-09 06:32:26,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:32:26,693 INFO L93 Difference]: Finished difference Result 88 states and 144 transitions. [2018-12-09 06:32:26,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:32:26,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-09 06:32:26,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:32:26,694 INFO L225 Difference]: With dead ends: 88 [2018-12-09 06:32:26,694 INFO L226 Difference]: Without dead ends: 86 [2018-12-09 06:32:26,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:32:26,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-09 06:32:26,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 64. [2018-12-09 06:32:26,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-09 06:32:26,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 104 transitions. [2018-12-09 06:32:26,699 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 104 transitions. Word has length 17 [2018-12-09 06:32:26,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:32:26,699 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 104 transitions. [2018-12-09 06:32:26,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:32:26,699 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 104 transitions. [2018-12-09 06:32:26,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 06:32:26,699 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:32:26,699 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:32:26,700 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:32:26,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:32:26,700 INFO L82 PathProgramCache]: Analyzing trace with hash 721572051, now seen corresponding path program 1 times [2018-12-09 06:32:26,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:32:26,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:32:26,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:32:26,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:32:26,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:32:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:32:26,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:32:26,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:32:26,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:32:26,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:32:26,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:32:26,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:32:26,714 INFO L87 Difference]: Start difference. First operand 64 states and 104 transitions. Second operand 3 states. [2018-12-09 06:32:26,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:32:26,725 INFO L93 Difference]: Finished difference Result 144 states and 238 transitions. [2018-12-09 06:32:26,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:32:26,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-09 06:32:26,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:32:26,726 INFO L225 Difference]: With dead ends: 144 [2018-12-09 06:32:26,726 INFO L226 Difference]: Without dead ends: 88 [2018-12-09 06:32:26,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:32:26,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-09 06:32:26,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2018-12-09 06:32:26,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-09 06:32:26,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 138 transitions. [2018-12-09 06:32:26,731 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 138 transitions. Word has length 17 [2018-12-09 06:32:26,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:32:26,731 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 138 transitions. [2018-12-09 06:32:26,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:32:26,731 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 138 transitions. [2018-12-09 06:32:26,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 06:32:26,732 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:32:26,732 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:32:26,732 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:32:26,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:32:26,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1287139128, now seen corresponding path program 1 times [2018-12-09 06:32:26,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:32:26,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:32:26,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:32:26,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:32:26,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:32:26,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:32:26,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:32:26,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:32:26,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:32:26,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:32:26,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:32:26,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:32:26,745 INFO L87 Difference]: Start difference. First operand 86 states and 138 transitions. Second operand 3 states. [2018-12-09 06:32:26,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:32:26,754 INFO L93 Difference]: Finished difference Result 129 states and 205 transitions. [2018-12-09 06:32:26,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:32:26,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-09 06:32:26,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:32:26,755 INFO L225 Difference]: With dead ends: 129 [2018-12-09 06:32:26,755 INFO L226 Difference]: Without dead ends: 90 [2018-12-09 06:32:26,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:32:26,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-09 06:32:26,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-12-09 06:32:26,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-09 06:32:26,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 138 transitions. [2018-12-09 06:32:26,760 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 138 transitions. Word has length 18 [2018-12-09 06:32:26,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:32:26,760 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 138 transitions. [2018-12-09 06:32:26,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:32:26,760 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 138 transitions. [2018-12-09 06:32:26,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 06:32:26,760 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:32:26,761 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:32:26,761 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:32:26,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:32:26,761 INFO L82 PathProgramCache]: Analyzing trace with hash 894112118, now seen corresponding path program 1 times [2018-12-09 06:32:26,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:32:26,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:32:26,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:32:26,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:32:26,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:32:26,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:32:26,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:32:26,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:32:26,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:32:26,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:32:26,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:32:26,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:32:26,776 INFO L87 Difference]: Start difference. First operand 88 states and 138 transitions. Second operand 3 states. [2018-12-09 06:32:26,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:32:26,785 INFO L93 Difference]: Finished difference Result 156 states and 248 transitions. [2018-12-09 06:32:26,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:32:26,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-09 06:32:26,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:32:26,786 INFO L225 Difference]: With dead ends: 156 [2018-12-09 06:32:26,786 INFO L226 Difference]: Without dead ends: 154 [2018-12-09 06:32:26,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:32:26,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-09 06:32:26,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 120. [2018-12-09 06:32:26,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-09 06:32:26,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 186 transitions. [2018-12-09 06:32:26,793 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 186 transitions. Word has length 18 [2018-12-09 06:32:26,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:32:26,793 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 186 transitions. [2018-12-09 06:32:26,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:32:26,793 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 186 transitions. [2018-12-09 06:32:26,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 06:32:26,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:32:26,793 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:32:26,794 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:32:26,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:32:26,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1574170488, now seen corresponding path program 1 times [2018-12-09 06:32:26,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:32:26,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:32:26,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:32:26,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:32:26,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:32:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:32:26,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:32:26,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:32:26,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:32:26,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:32:26,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:32:26,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:32:26,808 INFO L87 Difference]: Start difference. First operand 120 states and 186 transitions. Second operand 3 states. [2018-12-09 06:32:26,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:32:26,821 INFO L93 Difference]: Finished difference Result 272 states and 424 transitions. [2018-12-09 06:32:26,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:32:26,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-09 06:32:26,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:32:26,823 INFO L225 Difference]: With dead ends: 272 [2018-12-09 06:32:26,823 INFO L226 Difference]: Without dead ends: 162 [2018-12-09 06:32:26,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:32:26,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-12-09 06:32:26,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2018-12-09 06:32:26,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-09 06:32:26,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 242 transitions. [2018-12-09 06:32:26,832 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 242 transitions. Word has length 18 [2018-12-09 06:32:26,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:32:26,832 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 242 transitions. [2018-12-09 06:32:26,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:32:26,833 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 242 transitions. [2018-12-09 06:32:26,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 06:32:26,833 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:32:26,833 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:32:26,833 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:32:26,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:32:26,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1947887240, now seen corresponding path program 1 times [2018-12-09 06:32:26,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:32:26,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:32:26,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:32:26,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:32:26,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:32:26,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:32:26,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:32:26,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:32:26,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:32:26,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:32:26,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:32:26,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:32:26,849 INFO L87 Difference]: Start difference. First operand 160 states and 242 transitions. Second operand 3 states. [2018-12-09 06:32:26,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:32:26,862 INFO L93 Difference]: Finished difference Result 240 states and 360 transitions. [2018-12-09 06:32:26,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:32:26,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-09 06:32:26,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:32:26,863 INFO L225 Difference]: With dead ends: 240 [2018-12-09 06:32:26,863 INFO L226 Difference]: Without dead ends: 166 [2018-12-09 06:32:26,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:32:26,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-12-09 06:32:26,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2018-12-09 06:32:26,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-12-09 06:32:26,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 242 transitions. [2018-12-09 06:32:26,870 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 242 transitions. Word has length 19 [2018-12-09 06:32:26,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:32:26,871 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 242 transitions. [2018-12-09 06:32:26,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:32:26,871 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 242 transitions. [2018-12-09 06:32:26,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 06:32:26,871 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:32:26,872 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:32:26,872 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:32:26,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:32:26,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1554860230, now seen corresponding path program 1 times [2018-12-09 06:32:26,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:32:26,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:32:26,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:32:26,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:32:26,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:32:26,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:32:26,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:32:26,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:32:26,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:32:26,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:32:26,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:32:26,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:32:26,895 INFO L87 Difference]: Start difference. First operand 164 states and 242 transitions. Second operand 3 states. [2018-12-09 06:32:26,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:32:26,906 INFO L93 Difference]: Finished difference Result 284 states and 424 transitions. [2018-12-09 06:32:26,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:32:26,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-09 06:32:26,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:32:26,907 INFO L225 Difference]: With dead ends: 284 [2018-12-09 06:32:26,907 INFO L226 Difference]: Without dead ends: 282 [2018-12-09 06:32:26,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:32:26,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-09 06:32:26,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 232. [2018-12-09 06:32:26,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-12-09 06:32:26,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 334 transitions. [2018-12-09 06:32:26,916 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 334 transitions. Word has length 19 [2018-12-09 06:32:26,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:32:26,916 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 334 transitions. [2018-12-09 06:32:26,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:32:26,916 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 334 transitions. [2018-12-09 06:32:26,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 06:32:26,917 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:32:26,917 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:32:26,917 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:32:26,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:32:26,917 INFO L82 PathProgramCache]: Analyzing trace with hash -2060048696, now seen corresponding path program 1 times [2018-12-09 06:32:26,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:32:26,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:32:26,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:32:26,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:32:26,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:32:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:32:26,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:32:26,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:32:26,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:32:26,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:32:26,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:32:26,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:32:26,929 INFO L87 Difference]: Start difference. First operand 232 states and 334 transitions. Second operand 3 states. [2018-12-09 06:32:26,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:32:26,940 INFO L93 Difference]: Finished difference Result 524 states and 752 transitions. [2018-12-09 06:32:26,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:32:26,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-09 06:32:26,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:32:26,942 INFO L225 Difference]: With dead ends: 524 [2018-12-09 06:32:26,942 INFO L226 Difference]: Without dead ends: 306 [2018-12-09 06:32:26,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:32:26,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-12-09 06:32:26,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2018-12-09 06:32:26,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-12-09 06:32:26,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 422 transitions. [2018-12-09 06:32:26,950 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 422 transitions. Word has length 19 [2018-12-09 06:32:26,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:32:26,950 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 422 transitions. [2018-12-09 06:32:26,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:32:26,950 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 422 transitions. [2018-12-09 06:32:26,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 06:32:26,951 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:32:26,951 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:32:26,951 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:32:26,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:32:26,951 INFO L82 PathProgramCache]: Analyzing trace with hash 956242573, now seen corresponding path program 1 times [2018-12-09 06:32:26,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:32:26,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:32:26,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:32:26,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:32:26,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:32:26,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:32:26,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:32:26,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:32:26,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:32:26,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:32:26,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:32:26,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:32:26,964 INFO L87 Difference]: Start difference. First operand 304 states and 422 transitions. Second operand 3 states. [2018-12-09 06:32:26,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:32:26,974 INFO L93 Difference]: Finished difference Result 456 states and 628 transitions. [2018-12-09 06:32:26,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:32:26,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-09 06:32:26,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:32:26,975 INFO L225 Difference]: With dead ends: 456 [2018-12-09 06:32:26,975 INFO L226 Difference]: Without dead ends: 314 [2018-12-09 06:32:26,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:32:26,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-12-09 06:32:26,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 312. [2018-12-09 06:32:26,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-12-09 06:32:26,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 422 transitions. [2018-12-09 06:32:26,984 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 422 transitions. Word has length 20 [2018-12-09 06:32:26,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:32:26,984 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 422 transitions. [2018-12-09 06:32:26,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:32:26,984 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 422 transitions. [2018-12-09 06:32:26,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 06:32:26,985 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:32:26,985 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:32:26,985 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:32:26,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:32:26,986 INFO L82 PathProgramCache]: Analyzing trace with hash 563215563, now seen corresponding path program 1 times [2018-12-09 06:32:26,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:32:26,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:32:26,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:32:26,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:32:26,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:32:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:32:27,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:32:27,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:32:27,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:32:27,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:32:27,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:32:27,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:32:27,000 INFO L87 Difference]: Start difference. First operand 312 states and 422 transitions. Second operand 3 states. [2018-12-09 06:32:27,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:32:27,018 INFO L93 Difference]: Finished difference Result 524 states and 712 transitions. [2018-12-09 06:32:27,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:32:27,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-09 06:32:27,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:32:27,020 INFO L225 Difference]: With dead ends: 524 [2018-12-09 06:32:27,020 INFO L226 Difference]: Without dead ends: 522 [2018-12-09 06:32:27,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:32:27,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-12-09 06:32:27,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 456. [2018-12-09 06:32:27,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-12-09 06:32:27,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 598 transitions. [2018-12-09 06:32:27,034 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 598 transitions. Word has length 20 [2018-12-09 06:32:27,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:32:27,034 INFO L480 AbstractCegarLoop]: Abstraction has 456 states and 598 transitions. [2018-12-09 06:32:27,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:32:27,034 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 598 transitions. [2018-12-09 06:32:27,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 06:32:27,035 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:32:27,035 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:32:27,036 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:32:27,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:32:27,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1243273933, now seen corresponding path program 1 times [2018-12-09 06:32:27,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:32:27,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:32:27,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:32:27,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:32:27,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:32:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:32:27,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:32:27,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:32:27,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:32:27,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:32:27,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:32:27,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:32:27,051 INFO L87 Difference]: Start difference. First operand 456 states and 598 transitions. Second operand 3 states. [2018-12-09 06:32:27,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:32:27,075 INFO L93 Difference]: Finished difference Result 1020 states and 1320 transitions. [2018-12-09 06:32:27,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:32:27,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-09 06:32:27,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:32:27,077 INFO L225 Difference]: With dead ends: 1020 [2018-12-09 06:32:27,077 INFO L226 Difference]: Without dead ends: 586 [2018-12-09 06:32:27,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:32:27,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2018-12-09 06:32:27,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 584. [2018-12-09 06:32:27,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2018-12-09 06:32:27,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 726 transitions. [2018-12-09 06:32:27,096 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 726 transitions. Word has length 20 [2018-12-09 06:32:27,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:32:27,096 INFO L480 AbstractCegarLoop]: Abstraction has 584 states and 726 transitions. [2018-12-09 06:32:27,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:32:27,096 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 726 transitions. [2018-12-09 06:32:27,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 06:32:27,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:32:27,097 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:32:27,097 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:32:27,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:32:27,098 INFO L82 PathProgramCache]: Analyzing trace with hash 280029309, now seen corresponding path program 1 times [2018-12-09 06:32:27,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:32:27,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:32:27,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:32:27,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:32:27,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:32:27,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:32:27,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:32:27,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:32:27,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:32:27,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:32:27,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:32:27,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:32:27,108 INFO L87 Difference]: Start difference. First operand 584 states and 726 transitions. Second operand 3 states. [2018-12-09 06:32:27,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:32:27,126 INFO L93 Difference]: Finished difference Result 876 states and 1080 transitions. [2018-12-09 06:32:27,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:32:27,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-09 06:32:27,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:32:27,128 INFO L225 Difference]: With dead ends: 876 [2018-12-09 06:32:27,128 INFO L226 Difference]: Without dead ends: 602 [2018-12-09 06:32:27,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:32:27,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-12-09 06:32:27,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2018-12-09 06:32:27,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-12-09 06:32:27,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 726 transitions. [2018-12-09 06:32:27,141 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 726 transitions. Word has length 21 [2018-12-09 06:32:27,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:32:27,141 INFO L480 AbstractCegarLoop]: Abstraction has 600 states and 726 transitions. [2018-12-09 06:32:27,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:32:27,142 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 726 transitions. [2018-12-09 06:32:27,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 06:32:27,142 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:32:27,142 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:32:27,142 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:32:27,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:32:27,143 INFO L82 PathProgramCache]: Analyzing trace with hash -112997701, now seen corresponding path program 1 times [2018-12-09 06:32:27,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:32:27,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:32:27,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:32:27,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:32:27,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:32:27,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:32:27,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:32:27,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:32:27,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:32:27,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:32:27,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:32:27,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:32:27,160 INFO L87 Difference]: Start difference. First operand 600 states and 726 transitions. Second operand 3 states. [2018-12-09 06:32:27,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:32:27,180 INFO L93 Difference]: Finished difference Result 970 states and 1159 transitions. [2018-12-09 06:32:27,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:32:27,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-09 06:32:27,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:32:27,182 INFO L225 Difference]: With dead ends: 970 [2018-12-09 06:32:27,182 INFO L226 Difference]: Without dead ends: 968 [2018-12-09 06:32:27,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:32:27,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2018-12-09 06:32:27,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 904. [2018-12-09 06:32:27,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-12-09 06:32:27,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1062 transitions. [2018-12-09 06:32:27,201 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1062 transitions. Word has length 21 [2018-12-09 06:32:27,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:32:27,201 INFO L480 AbstractCegarLoop]: Abstraction has 904 states and 1062 transitions. [2018-12-09 06:32:27,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:32:27,201 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1062 transitions. [2018-12-09 06:32:27,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 06:32:27,202 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 06:32:27,202 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 06:32:27,202 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 06:32:27,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 06:32:27,202 INFO L82 PathProgramCache]: Analyzing trace with hash 567060669, now seen corresponding path program 1 times [2018-12-09 06:32:27,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 06:32:27,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 06:32:27,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:32:27,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 06:32:27,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 06:32:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 06:32:27,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 06:32:27,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 06:32:27,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 06:32:27,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 06:32:27,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 06:32:27,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:32:27,211 INFO L87 Difference]: Start difference. First operand 904 states and 1062 transitions. Second operand 3 states. [2018-12-09 06:32:27,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 06:32:27,237 INFO L93 Difference]: Finished difference Result 1992 states and 2278 transitions. [2018-12-09 06:32:27,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 06:32:27,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-09 06:32:27,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 06:32:27,237 INFO L225 Difference]: With dead ends: 1992 [2018-12-09 06:32:27,237 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 06:32:27,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 06:32:27,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 06:32:27,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 06:32:27,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 06:32:27,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 06:32:27,239 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-12-09 06:32:27,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 06:32:27,240 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 06:32:27,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 06:32:27,240 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 06:32:27,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 06:32:27,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 06:32:27,253 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-09 06:32:27,253 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 06:32:27,253 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 06:32:27,253 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-09 06:32:27,253 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 06:32:27,253 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 06:32:27,253 INFO L448 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2018-12-09 06:32:27,253 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 107) no Hoare annotation was computed. [2018-12-09 06:32:27,253 INFO L448 ceAbstractionStarter]: For program point L77-1(lines 27 102) no Hoare annotation was computed. [2018-12-09 06:32:27,253 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2018-12-09 06:32:27,253 INFO L448 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-12-09 06:32:27,254 INFO L451 ceAbstractionStarter]: At program point L103(lines 5 107) the Hoare annotation is: true [2018-12-09 06:32:27,254 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. [2018-12-09 06:32:27,254 INFO L448 ceAbstractionStarter]: For program point L62-1(lines 27 102) no Hoare annotation was computed. [2018-12-09 06:32:27,254 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 27 102) no Hoare annotation was computed. [2018-12-09 06:32:27,254 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 27 102) no Hoare annotation was computed. [2018-12-09 06:32:27,254 INFO L448 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2018-12-09 06:32:27,254 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 107) no Hoare annotation was computed. [2018-12-09 06:32:27,254 INFO L448 ceAbstractionStarter]: For program point L46-2(lines 27 102) no Hoare annotation was computed. [2018-12-09 06:32:27,254 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 107) the Hoare annotation is: true [2018-12-09 06:32:27,254 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-12-09 06:32:27,254 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 27 102) no Hoare annotation was computed. [2018-12-09 06:32:27,254 INFO L451 ceAbstractionStarter]: At program point L97-1(lines 27 102) the Hoare annotation is: true [2018-12-09 06:32:27,254 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-12-09 06:32:27,254 INFO L448 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2018-12-09 06:32:27,254 INFO L444 ceAbstractionStarter]: At program point L98-1(lines 5 107) the Hoare annotation is: false [2018-12-09 06:32:27,255 INFO L448 ceAbstractionStarter]: For program point L82-1(lines 27 102) no Hoare annotation was computed. [2018-12-09 06:32:27,255 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 27 102) no Hoare annotation was computed. [2018-12-09 06:32:27,255 INFO L448 ceAbstractionStarter]: For program point L58-1(lines 27 102) no Hoare annotation was computed. [2018-12-09 06:32:27,255 INFO L448 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2018-12-09 06:32:27,255 INFO L448 ceAbstractionStarter]: For program point L50-1(lines 27 102) no Hoare annotation was computed. [2018-12-09 06:32:27,255 INFO L448 ceAbstractionStarter]: For program point L92-1(lines 27 102) no Hoare annotation was computed. [2018-12-09 06:32:27,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 06:32:27 BoogieIcfgContainer [2018-12-09 06:32:27,259 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 06:32:27,259 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 06:32:27,259 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 06:32:27,260 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 06:32:27,260 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:32:26" (3/4) ... [2018-12-09 06:32:27,262 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 06:32:27,266 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 06:32:27,267 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 06:32:27,269 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-09 06:32:27,270 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-09 06:32:27,270 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 06:32:27,301 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d1884ae6-be12-47de-8a63-46c5eeec2ee8/bin-2019/uautomizer/witness.graphml [2018-12-09 06:32:27,301 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 06:32:27,302 INFO L168 Benchmark]: Toolchain (without parser) took 1266.16 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 954.4 MB in the beginning and 878.1 MB in the end (delta: 76.2 MB). Peak memory consumption was 178.5 MB. Max. memory is 11.5 GB. [2018-12-09 06:32:27,303 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 06:32:27,303 INFO L168 Benchmark]: CACSL2BoogieTranslator took 134.16 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 943.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 06:32:27,303 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.09 ms. Allocated memory is still 1.0 GB. Free memory is still 943.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 06:32:27,303 INFO L168 Benchmark]: Boogie Preprocessor took 44.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 943.6 MB in the beginning and 1.1 GB in the end (delta: -156.7 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2018-12-09 06:32:27,304 INFO L168 Benchmark]: RCFGBuilder took 138.17 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: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-12-09 06:32:27,304 INFO L168 Benchmark]: TraceAbstraction took 892.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 883.5 MB in the end (delta: 199.8 MB). Peak memory consumption was 199.8 MB. Max. memory is 11.5 GB. [2018-12-09 06:32:27,304 INFO L168 Benchmark]: Witness Printer took 41.65 ms. Allocated memory is still 1.1 GB. Free memory was 883.5 MB in the beginning and 878.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 06:32:27,305 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 134.16 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 943.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.09 ms. Allocated memory is still 1.0 GB. Free memory is still 943.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 943.6 MB in the beginning and 1.1 GB in the end (delta: -156.7 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 138.17 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: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 892.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 883.5 MB in the end (delta: 199.8 MB). Peak memory consumption was 199.8 MB. Max. memory is 11.5 GB. * Witness Printer took 41.65 ms. Allocated memory is still 1.1 GB. Free memory was 883.5 MB in the beginning and 878.1 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 105]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. SAFE Result, 0.8s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 923 SDtfs, 417 SDslu, 612 SDs, 0 SdLazy, 91 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=904occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 270 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 74 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 317 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 9690 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...