./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8c15e4d1-b599-4f78-b7c2-d948db734203/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8c15e4d1-b599-4f78-b7c2-d948db734203/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8c15e4d1-b599-4f78-b7c2-d948db734203/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8c15e4d1-b599-4f78-b7c2-d948db734203/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_13.c -s /tmp/vcloud-vcloud-master/worker/run_dir_8c15e4d1-b599-4f78-b7c2-d948db734203/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8c15e4d1-b599-4f78-b7c2-d948db734203/bin/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 87288fc43230a9d3829930d8a140fe9b3ddaa0e7 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 16:53:44,373 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:53:44,375 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:53:44,384 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:53:44,384 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:53:44,385 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:53:44,385 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:53:44,387 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:53:44,388 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:53:44,389 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:53:44,389 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:53:44,390 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:53:44,390 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:53:44,391 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:53:44,392 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:53:44,392 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:53:44,393 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:53:44,393 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:53:44,395 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:53:44,396 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:53:44,398 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:53:44,398 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:53:44,399 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:53:44,400 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:53:44,402 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:53:44,402 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:53:44,402 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:53:44,403 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:53:44,403 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:53:44,403 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:53:44,403 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:53:44,404 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:53:44,404 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:53:44,405 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:53:44,406 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:53:44,406 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:53:44,407 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:53:44,407 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:53:44,407 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:53:44,408 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:53:44,408 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:53:44,409 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8c15e4d1-b599-4f78-b7c2-d948db734203/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 16:53:44,421 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:53:44,421 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:53:44,422 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:53:44,423 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:53:44,423 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 16:53:44,423 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:53:44,423 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:53:44,423 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:53:44,424 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:53:44,424 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:53:44,424 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:53:44,424 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:53:44,424 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:53:44,424 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:53:44,425 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:53:44,425 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:53:44,425 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:53:44,425 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:53:44,425 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 16:53:44,426 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:53:44,426 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:53:44,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:53:44,426 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:53:44,426 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:53:44,427 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:53:44,427 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 16:53:44,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:53:44,427 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:53:44,427 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:53:44,427 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_8c15e4d1-b599-4f78-b7c2-d948db734203/bin/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 -> 87288fc43230a9d3829930d8a140fe9b3ddaa0e7 [2019-12-07 16:53:44,532 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:53:44,540 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:53:44,543 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:53:44,544 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:53:44,545 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:53:44,545 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8c15e4d1-b599-4f78-b7c2-d948db734203/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_13.c [2019-12-07 16:53:44,588 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8c15e4d1-b599-4f78-b7c2-d948db734203/bin/uautomizer/data/9ec24ba47/e1d1fb0c6280478f8d52da4c5599c97a/FLAG9da4e8ced [2019-12-07 16:53:44,900 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:53:44,900 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8c15e4d1-b599-4f78-b7c2-d948db734203/sv-benchmarks/c/locks/test_locks_13.c [2019-12-07 16:53:44,905 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8c15e4d1-b599-4f78-b7c2-d948db734203/bin/uautomizer/data/9ec24ba47/e1d1fb0c6280478f8d52da4c5599c97a/FLAG9da4e8ced [2019-12-07 16:53:44,913 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8c15e4d1-b599-4f78-b7c2-d948db734203/bin/uautomizer/data/9ec24ba47/e1d1fb0c6280478f8d52da4c5599c97a [2019-12-07 16:53:44,915 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:53:44,916 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:53:44,917 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:53:44,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:53:44,919 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:53:44,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:53:44" (1/1) ... [2019-12-07 16:53:44,921 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20cc73ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:53:44, skipping insertion in model container [2019-12-07 16:53:44,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:53:44" (1/1) ... [2019-12-07 16:53:44,926 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:53:44,943 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:53:45,089 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:53:45,091 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:53:45,112 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:53:45,121 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:53:45,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:53:45 WrapperNode [2019-12-07 16:53:45,121 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:53:45,122 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:53:45,122 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:53:45,122 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:53:45,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:53:45" (1/1) ... [2019-12-07 16:53:45,132 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:53:45" (1/1) ... [2019-12-07 16:53:45,148 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:53:45,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:53:45,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:53:45,148 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:53:45,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:53:45" (1/1) ... [2019-12-07 16:53:45,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:53:45" (1/1) ... [2019-12-07 16:53:45,156 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:53:45" (1/1) ... [2019-12-07 16:53:45,156 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:53:45" (1/1) ... [2019-12-07 16:53:45,159 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:53:45" (1/1) ... [2019-12-07 16:53:45,162 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:53:45" (1/1) ... [2019-12-07 16:53:45,164 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:53:45" (1/1) ... [2019-12-07 16:53:45,165 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:53:45,166 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:53:45,166 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:53:45,166 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:53:45,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:53:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8c15e4d1-b599-4f78-b7c2-d948db734203/bin/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 [2019-12-07 16:53:45,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:53:45,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:53:45,392 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:53:45,392 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-12-07 16:53:45,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:53:45 BoogieIcfgContainer [2019-12-07 16:53:45,393 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:53:45,393 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:53:45,393 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:53:45,395 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:53:45,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:53:44" (1/3) ... [2019-12-07 16:53:45,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@abaca7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:53:45, skipping insertion in model container [2019-12-07 16:53:45,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:53:45" (2/3) ... [2019-12-07 16:53:45,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@abaca7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:53:45, skipping insertion in model container [2019-12-07 16:53:45,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:53:45" (3/3) ... [2019-12-07 16:53:45,397 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_13.c [2019-12-07 16:53:45,404 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:53:45,408 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 16:53:45,417 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 16:53:45,431 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:53:45,432 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:53:45,432 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:53:45,432 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:53:45,432 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:53:45,432 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:53:45,432 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:53:45,432 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:53:45,442 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2019-12-07 16:53:45,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 16:53:45,446 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:45,446 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:53:45,447 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:53:45,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:45,450 INFO L82 PathProgramCache]: Analyzing trace with hash -677951942, now seen corresponding path program 1 times [2019-12-07 16:53:45,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:53:45,456 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033646529] [2019-12-07 16:53:45,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:53:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:45,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:45,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033646529] [2019-12-07 16:53:45,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:45,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:53:45,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316669860] [2019-12-07 16:53:45,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:53:45,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:53:45,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:53:45,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:45,592 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 3 states. [2019-12-07 16:53:45,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:45,625 INFO L93 Difference]: Finished difference Result 100 states and 180 transitions. [2019-12-07 16:53:45,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:53:45,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 16:53:45,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:45,633 INFO L225 Difference]: With dead ends: 100 [2019-12-07 16:53:45,633 INFO L226 Difference]: Without dead ends: 86 [2019-12-07 16:53:45,635 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:45,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-12-07 16:53:45,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 58. [2019-12-07 16:53:45,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-12-07 16:53:45,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 109 transitions. [2019-12-07 16:53:45,663 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 109 transitions. Word has length 19 [2019-12-07 16:53:45,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:45,663 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 109 transitions. [2019-12-07 16:53:45,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:53:45,663 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 109 transitions. [2019-12-07 16:53:45,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 16:53:45,664 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:45,664 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:53:45,665 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:53:45,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:45,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1699020296, now seen corresponding path program 1 times [2019-12-07 16:53:45,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:53:45,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713991311] [2019-12-07 16:53:45,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:53:45,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:45,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:45,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713991311] [2019-12-07 16:53:45,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:45,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:53:45,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904552603] [2019-12-07 16:53:45,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:53:45,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:53:45,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:53:45,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:45,711 INFO L87 Difference]: Start difference. First operand 58 states and 109 transitions. Second operand 3 states. [2019-12-07 16:53:45,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:45,729 INFO L93 Difference]: Finished difference Result 143 states and 268 transitions. [2019-12-07 16:53:45,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:53:45,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 16:53:45,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:45,731 INFO L225 Difference]: With dead ends: 143 [2019-12-07 16:53:45,731 INFO L226 Difference]: Without dead ends: 86 [2019-12-07 16:53:45,731 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:45,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-12-07 16:53:45,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2019-12-07 16:53:45,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-07 16:53:45,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 157 transitions. [2019-12-07 16:53:45,739 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 157 transitions. Word has length 19 [2019-12-07 16:53:45,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:45,739 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 157 transitions. [2019-12-07 16:53:45,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:53:45,739 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 157 transitions. [2019-12-07 16:53:45,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 16:53:45,740 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:45,740 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:53:45,740 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:53:45,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:45,740 INFO L82 PathProgramCache]: Analyzing trace with hash 458538653, now seen corresponding path program 1 times [2019-12-07 16:53:45,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:53:45,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945404603] [2019-12-07 16:53:45,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:53:45,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:45,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:45,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945404603] [2019-12-07 16:53:45,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:45,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:53:45,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635571512] [2019-12-07 16:53:45,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:53:45,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:53:45,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:53:45,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:45,770 INFO L87 Difference]: Start difference. First operand 84 states and 157 transitions. Second operand 3 states. [2019-12-07 16:53:45,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:45,784 INFO L93 Difference]: Finished difference Result 131 states and 239 transitions. [2019-12-07 16:53:45,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:53:45,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 16:53:45,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:45,785 INFO L225 Difference]: With dead ends: 131 [2019-12-07 16:53:45,785 INFO L226 Difference]: Without dead ends: 89 [2019-12-07 16:53:45,785 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:45,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-07 16:53:45,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-12-07 16:53:45,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-12-07 16:53:45,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 159 transitions. [2019-12-07 16:53:45,791 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 159 transitions. Word has length 20 [2019-12-07 16:53:45,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:45,792 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 159 transitions. [2019-12-07 16:53:45,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:53:45,792 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 159 transitions. [2019-12-07 16:53:45,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 16:53:45,792 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:45,792 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:53:45,793 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:53:45,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:45,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1129809249, now seen corresponding path program 1 times [2019-12-07 16:53:45,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:53:45,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931712991] [2019-12-07 16:53:45,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:53:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:45,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:45,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931712991] [2019-12-07 16:53:45,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:45,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:53:45,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258244511] [2019-12-07 16:53:45,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:53:45,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:53:45,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:53:45,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:45,819 INFO L87 Difference]: Start difference. First operand 87 states and 159 transitions. Second operand 3 states. [2019-12-07 16:53:45,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:45,832 INFO L93 Difference]: Finished difference Result 168 states and 308 transitions. [2019-12-07 16:53:45,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:53:45,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 16:53:45,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:45,834 INFO L225 Difference]: With dead ends: 168 [2019-12-07 16:53:45,834 INFO L226 Difference]: Without dead ends: 166 [2019-12-07 16:53:45,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:45,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-12-07 16:53:45,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 116. [2019-12-07 16:53:45,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-12-07 16:53:45,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 212 transitions. [2019-12-07 16:53:45,842 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 212 transitions. Word has length 20 [2019-12-07 16:53:45,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:45,842 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 212 transitions. [2019-12-07 16:53:45,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:53:45,842 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 212 transitions. [2019-12-07 16:53:45,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 16:53:45,843 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:45,843 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:53:45,843 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:53:45,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:45,843 INFO L82 PathProgramCache]: Analyzing trace with hash 2144089693, now seen corresponding path program 1 times [2019-12-07 16:53:45,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:53:45,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582170825] [2019-12-07 16:53:45,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:53:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:45,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:45,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582170825] [2019-12-07 16:53:45,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:45,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:53:45,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260214103] [2019-12-07 16:53:45,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:53:45,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:53:45,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:53:45,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:45,867 INFO L87 Difference]: Start difference. First operand 116 states and 212 transitions. Second operand 3 states. [2019-12-07 16:53:45,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:45,879 INFO L93 Difference]: Finished difference Result 280 states and 514 transitions. [2019-12-07 16:53:45,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:53:45,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 16:53:45,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:45,880 INFO L225 Difference]: With dead ends: 280 [2019-12-07 16:53:45,881 INFO L226 Difference]: Without dead ends: 168 [2019-12-07 16:53:45,881 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:45,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-12-07 16:53:45,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2019-12-07 16:53:45,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-12-07 16:53:45,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 302 transitions. [2019-12-07 16:53:45,889 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 302 transitions. Word has length 20 [2019-12-07 16:53:45,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:45,889 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 302 transitions. [2019-12-07 16:53:45,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:53:45,890 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 302 transitions. [2019-12-07 16:53:45,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 16:53:45,890 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:45,890 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:53:45,891 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:53:45,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:45,891 INFO L82 PathProgramCache]: Analyzing trace with hash -664135635, now seen corresponding path program 1 times [2019-12-07 16:53:45,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:53:45,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852453017] [2019-12-07 16:53:45,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:53:45,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:45,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:45,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852453017] [2019-12-07 16:53:45,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:45,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:53:45,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392315036] [2019-12-07 16:53:45,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:53:45,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:53:45,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:53:45,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:45,911 INFO L87 Difference]: Start difference. First operand 166 states and 302 transitions. Second operand 3 states. [2019-12-07 16:53:45,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:45,922 INFO L93 Difference]: Finished difference Result 251 states and 453 transitions. [2019-12-07 16:53:45,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:53:45,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 16:53:45,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:45,923 INFO L225 Difference]: With dead ends: 251 [2019-12-07 16:53:45,923 INFO L226 Difference]: Without dead ends: 170 [2019-12-07 16:53:45,924 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:45,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-12-07 16:53:45,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2019-12-07 16:53:45,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 16:53:45,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 302 transitions. [2019-12-07 16:53:45,930 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 302 transitions. Word has length 21 [2019-12-07 16:53:45,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:45,931 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 302 transitions. [2019-12-07 16:53:45,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:53:45,931 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 302 transitions. [2019-12-07 16:53:45,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 16:53:45,931 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:45,932 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:53:45,932 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:53:45,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:45,932 INFO L82 PathProgramCache]: Analyzing trace with hash 2042483759, now seen corresponding path program 1 times [2019-12-07 16:53:45,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:53:45,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427642403] [2019-12-07 16:53:45,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:53:45,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:45,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:45,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427642403] [2019-12-07 16:53:45,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:45,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:53:45,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288422951] [2019-12-07 16:53:45,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:53:45,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:53:45,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:53:45,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:45,952 INFO L87 Difference]: Start difference. First operand 168 states and 302 transitions. Second operand 3 states. [2019-12-07 16:53:45,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:45,967 INFO L93 Difference]: Finished difference Result 488 states and 880 transitions. [2019-12-07 16:53:45,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:53:45,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 16:53:45,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:45,969 INFO L225 Difference]: With dead ends: 488 [2019-12-07 16:53:45,969 INFO L226 Difference]: Without dead ends: 326 [2019-12-07 16:53:45,970 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:45,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-12-07 16:53:45,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 324. [2019-12-07 16:53:45,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-12-07 16:53:45,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 578 transitions. [2019-12-07 16:53:45,983 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 578 transitions. Word has length 21 [2019-12-07 16:53:45,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:45,983 INFO L462 AbstractCegarLoop]: Abstraction has 324 states and 578 transitions. [2019-12-07 16:53:45,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:53:45,983 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 578 transitions. [2019-12-07 16:53:45,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 16:53:45,985 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:45,985 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:53:45,985 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:53:45,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:45,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1231415183, now seen corresponding path program 1 times [2019-12-07 16:53:45,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:53:45,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831559619] [2019-12-07 16:53:45,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:53:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:46,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:46,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831559619] [2019-12-07 16:53:46,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:46,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:53:46,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784524393] [2019-12-07 16:53:46,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:53:46,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:53:46,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:53:46,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:46,007 INFO L87 Difference]: Start difference. First operand 324 states and 578 transitions. Second operand 3 states. [2019-12-07 16:53:46,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:46,019 INFO L93 Difference]: Finished difference Result 416 states and 748 transitions. [2019-12-07 16:53:46,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:53:46,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 16:53:46,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:46,022 INFO L225 Difference]: With dead ends: 416 [2019-12-07 16:53:46,022 INFO L226 Difference]: Without dead ends: 414 [2019-12-07 16:53:46,023 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:46,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-12-07 16:53:46,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 324. [2019-12-07 16:53:46,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-12-07 16:53:46,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 574 transitions. [2019-12-07 16:53:46,032 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 574 transitions. Word has length 21 [2019-12-07 16:53:46,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:46,032 INFO L462 AbstractCegarLoop]: Abstraction has 324 states and 574 transitions. [2019-12-07 16:53:46,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:53:46,032 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 574 transitions. [2019-12-07 16:53:46,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 16:53:46,033 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:46,033 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:53:46,034 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:53:46,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:46,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1107299854, now seen corresponding path program 1 times [2019-12-07 16:53:46,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:53:46,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593787941] [2019-12-07 16:53:46,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:53:46,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:46,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:46,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593787941] [2019-12-07 16:53:46,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:46,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:53:46,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561527232] [2019-12-07 16:53:46,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:53:46,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:53:46,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:53:46,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:46,056 INFO L87 Difference]: Start difference. First operand 324 states and 574 transitions. Second operand 3 states. [2019-12-07 16:53:46,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:46,071 INFO L93 Difference]: Finished difference Result 612 states and 1096 transitions. [2019-12-07 16:53:46,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:53:46,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-07 16:53:46,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:46,075 INFO L225 Difference]: With dead ends: 612 [2019-12-07 16:53:46,075 INFO L226 Difference]: Without dead ends: 610 [2019-12-07 16:53:46,075 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:46,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-12-07 16:53:46,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 448. [2019-12-07 16:53:46,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-12-07 16:53:46,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 782 transitions. [2019-12-07 16:53:46,087 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 782 transitions. Word has length 22 [2019-12-07 16:53:46,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:46,087 INFO L462 AbstractCegarLoop]: Abstraction has 448 states and 782 transitions. [2019-12-07 16:53:46,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:53:46,087 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 782 transitions. [2019-12-07 16:53:46,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 16:53:46,089 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:46,089 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:53:46,089 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:53:46,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:46,089 INFO L82 PathProgramCache]: Analyzing trace with hash -2128368208, now seen corresponding path program 1 times [2019-12-07 16:53:46,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:53:46,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682899511] [2019-12-07 16:53:46,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:53:46,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:46,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:46,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682899511] [2019-12-07 16:53:46,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:46,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:53:46,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931874898] [2019-12-07 16:53:46,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:53:46,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:53:46,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:53:46,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:46,108 INFO L87 Difference]: Start difference. First operand 448 states and 782 transitions. Second operand 3 states. [2019-12-07 16:53:46,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:46,127 INFO L93 Difference]: Finished difference Result 1076 states and 1888 transitions. [2019-12-07 16:53:46,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:53:46,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-07 16:53:46,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:46,130 INFO L225 Difference]: With dead ends: 1076 [2019-12-07 16:53:46,130 INFO L226 Difference]: Without dead ends: 634 [2019-12-07 16:53:46,131 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:46,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-12-07 16:53:46,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 632. [2019-12-07 16:53:46,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-12-07 16:53:46,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 1098 transitions. [2019-12-07 16:53:46,143 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 1098 transitions. Word has length 22 [2019-12-07 16:53:46,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:46,144 INFO L462 AbstractCegarLoop]: Abstraction has 632 states and 1098 transitions. [2019-12-07 16:53:46,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:53:46,144 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 1098 transitions. [2019-12-07 16:53:46,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 16:53:46,145 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:46,145 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:53:46,145 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:53:46,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:46,145 INFO L82 PathProgramCache]: Analyzing trace with hash 33656292, now seen corresponding path program 1 times [2019-12-07 16:53:46,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:53:46,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011729143] [2019-12-07 16:53:46,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:53:46,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:46,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:46,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011729143] [2019-12-07 16:53:46,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:46,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:53:46,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362411741] [2019-12-07 16:53:46,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:53:46,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:53:46,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:53:46,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:46,161 INFO L87 Difference]: Start difference. First operand 632 states and 1098 transitions. Second operand 3 states. [2019-12-07 16:53:46,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:46,174 INFO L93 Difference]: Finished difference Result 956 states and 1656 transitions. [2019-12-07 16:53:46,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:53:46,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-07 16:53:46,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:46,177 INFO L225 Difference]: With dead ends: 956 [2019-12-07 16:53:46,178 INFO L226 Difference]: Without dead ends: 646 [2019-12-07 16:53:46,178 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:46,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2019-12-07 16:53:46,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 644. [2019-12-07 16:53:46,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-12-07 16:53:46,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1106 transitions. [2019-12-07 16:53:46,190 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1106 transitions. Word has length 23 [2019-12-07 16:53:46,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:46,190 INFO L462 AbstractCegarLoop]: Abstraction has 644 states and 1106 transitions. [2019-12-07 16:53:46,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:53:46,190 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1106 transitions. [2019-12-07 16:53:46,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 16:53:46,191 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:46,191 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:53:46,191 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:53:46,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:46,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1554691610, now seen corresponding path program 1 times [2019-12-07 16:53:46,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:53:46,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822636467] [2019-12-07 16:53:46,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:53:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:46,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:46,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822636467] [2019-12-07 16:53:46,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:46,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:53:46,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859354660] [2019-12-07 16:53:46,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:53:46,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:53:46,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:53:46,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:46,205 INFO L87 Difference]: Start difference. First operand 644 states and 1106 transitions. Second operand 3 states. [2019-12-07 16:53:46,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:46,224 INFO L93 Difference]: Finished difference Result 1192 states and 2076 transitions. [2019-12-07 16:53:46,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:53:46,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-07 16:53:46,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:46,231 INFO L225 Difference]: With dead ends: 1192 [2019-12-07 16:53:46,232 INFO L226 Difference]: Without dead ends: 1190 [2019-12-07 16:53:46,232 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:46,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2019-12-07 16:53:46,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 900. [2019-12-07 16:53:46,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2019-12-07 16:53:46,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1514 transitions. [2019-12-07 16:53:46,258 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1514 transitions. Word has length 23 [2019-12-07 16:53:46,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:46,258 INFO L462 AbstractCegarLoop]: Abstraction has 900 states and 1514 transitions. [2019-12-07 16:53:46,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:53:46,258 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1514 transitions. [2019-12-07 16:53:46,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 16:53:46,259 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:46,260 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:53:46,260 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:53:46,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:46,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1719207332, now seen corresponding path program 1 times [2019-12-07 16:53:46,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:53:46,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494532683] [2019-12-07 16:53:46,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:53:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:46,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:46,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494532683] [2019-12-07 16:53:46,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:46,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:53:46,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908573341] [2019-12-07 16:53:46,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:53:46,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:53:46,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:53:46,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:46,276 INFO L87 Difference]: Start difference. First operand 900 states and 1514 transitions. Second operand 3 states. [2019-12-07 16:53:46,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:46,297 INFO L93 Difference]: Finished difference Result 2136 states and 3612 transitions. [2019-12-07 16:53:46,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:53:46,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-07 16:53:46,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:46,303 INFO L225 Difference]: With dead ends: 2136 [2019-12-07 16:53:46,303 INFO L226 Difference]: Without dead ends: 1254 [2019-12-07 16:53:46,304 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:46,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2019-12-07 16:53:46,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1252. [2019-12-07 16:53:46,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1252 states. [2019-12-07 16:53:46,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 2098 transitions. [2019-12-07 16:53:46,331 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 2098 transitions. Word has length 23 [2019-12-07 16:53:46,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:46,332 INFO L462 AbstractCegarLoop]: Abstraction has 1252 states and 2098 transitions. [2019-12-07 16:53:46,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:53:46,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 2098 transitions. [2019-12-07 16:53:46,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 16:53:46,333 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:46,333 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:53:46,333 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:53:46,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:46,334 INFO L82 PathProgramCache]: Analyzing trace with hash -950585915, now seen corresponding path program 1 times [2019-12-07 16:53:46,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:53:46,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763463009] [2019-12-07 16:53:46,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:53:46,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:46,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:46,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763463009] [2019-12-07 16:53:46,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:46,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:53:46,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742268937] [2019-12-07 16:53:46,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:53:46,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:53:46,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:53:46,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:46,349 INFO L87 Difference]: Start difference. First operand 1252 states and 2098 transitions. Second operand 3 states. [2019-12-07 16:53:46,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:46,371 INFO L93 Difference]: Finished difference Result 1880 states and 3140 transitions. [2019-12-07 16:53:46,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:53:46,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-12-07 16:53:46,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:46,377 INFO L225 Difference]: With dead ends: 1880 [2019-12-07 16:53:46,377 INFO L226 Difference]: Without dead ends: 1270 [2019-12-07 16:53:46,378 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:46,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2019-12-07 16:53:46,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1268. [2019-12-07 16:53:46,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1268 states. [2019-12-07 16:53:46,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1268 states to 1268 states and 2098 transitions. [2019-12-07 16:53:46,405 INFO L78 Accepts]: Start accepts. Automaton has 1268 states and 2098 transitions. Word has length 24 [2019-12-07 16:53:46,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:46,405 INFO L462 AbstractCegarLoop]: Abstraction has 1268 states and 2098 transitions. [2019-12-07 16:53:46,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:53:46,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1268 states and 2098 transitions. [2019-12-07 16:53:46,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 16:53:46,406 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:46,407 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:53:46,407 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:53:46,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:46,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1756033479, now seen corresponding path program 1 times [2019-12-07 16:53:46,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:53:46,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432748134] [2019-12-07 16:53:46,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:53:46,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:46,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:46,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432748134] [2019-12-07 16:53:46,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:46,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:53:46,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060369613] [2019-12-07 16:53:46,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:53:46,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:53:46,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:53:46,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:46,421 INFO L87 Difference]: Start difference. First operand 1268 states and 2098 transitions. Second operand 3 states. [2019-12-07 16:53:46,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:46,445 INFO L93 Difference]: Finished difference Result 2312 states and 3892 transitions. [2019-12-07 16:53:46,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:53:46,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-12-07 16:53:46,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:46,455 INFO L225 Difference]: With dead ends: 2312 [2019-12-07 16:53:46,455 INFO L226 Difference]: Without dead ends: 2310 [2019-12-07 16:53:46,456 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:46,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2310 states. [2019-12-07 16:53:46,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2310 to 1796. [2019-12-07 16:53:46,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1796 states. [2019-12-07 16:53:46,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 2898 transitions. [2019-12-07 16:53:46,509 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 2898 transitions. Word has length 24 [2019-12-07 16:53:46,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:46,509 INFO L462 AbstractCegarLoop]: Abstraction has 1796 states and 2898 transitions. [2019-12-07 16:53:46,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:53:46,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2898 transitions. [2019-12-07 16:53:46,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 16:53:46,511 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:46,512 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:53:46,512 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:53:46,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:46,512 INFO L82 PathProgramCache]: Analyzing trace with hash 734965125, now seen corresponding path program 1 times [2019-12-07 16:53:46,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:53:46,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78175421] [2019-12-07 16:53:46,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:53:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:46,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:46,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78175421] [2019-12-07 16:53:46,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:46,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:53:46,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249441192] [2019-12-07 16:53:46,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:53:46,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:53:46,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:53:46,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:46,530 INFO L87 Difference]: Start difference. First operand 1796 states and 2898 transitions. Second operand 3 states. [2019-12-07 16:53:46,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:46,569 INFO L93 Difference]: Finished difference Result 4232 states and 6868 transitions. [2019-12-07 16:53:46,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:53:46,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-12-07 16:53:46,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:46,579 INFO L225 Difference]: With dead ends: 4232 [2019-12-07 16:53:46,579 INFO L226 Difference]: Without dead ends: 2470 [2019-12-07 16:53:46,581 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:46,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2470 states. [2019-12-07 16:53:46,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2470 to 2468. [2019-12-07 16:53:46,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2468 states. [2019-12-07 16:53:46,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2468 states to 2468 states and 3970 transitions. [2019-12-07 16:53:46,625 INFO L78 Accepts]: Start accepts. Automaton has 2468 states and 3970 transitions. Word has length 24 [2019-12-07 16:53:46,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:46,625 INFO L462 AbstractCegarLoop]: Abstraction has 2468 states and 3970 transitions. [2019-12-07 16:53:46,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:53:46,626 INFO L276 IsEmpty]: Start isEmpty. Operand 2468 states and 3970 transitions. [2019-12-07 16:53:46,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 16:53:46,627 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:46,627 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:53:46,627 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:53:46,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:46,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1397322919, now seen corresponding path program 1 times [2019-12-07 16:53:46,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:53:46,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181082415] [2019-12-07 16:53:46,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:53:46,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:46,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:46,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181082415] [2019-12-07 16:53:46,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:46,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:53:46,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763020828] [2019-12-07 16:53:46,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:53:46,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:53:46,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:53:46,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:46,643 INFO L87 Difference]: Start difference. First operand 2468 states and 3970 transitions. Second operand 3 states. [2019-12-07 16:53:46,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:46,669 INFO L93 Difference]: Finished difference Result 3704 states and 5940 transitions. [2019-12-07 16:53:46,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:53:46,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-07 16:53:46,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:46,679 INFO L225 Difference]: With dead ends: 3704 [2019-12-07 16:53:46,679 INFO L226 Difference]: Without dead ends: 2502 [2019-12-07 16:53:46,681 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:46,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2502 states. [2019-12-07 16:53:46,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2502 to 2500. [2019-12-07 16:53:46,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2500 states. [2019-12-07 16:53:46,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 2500 states and 3970 transitions. [2019-12-07 16:53:46,723 INFO L78 Accepts]: Start accepts. Automaton has 2500 states and 3970 transitions. Word has length 25 [2019-12-07 16:53:46,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:46,723 INFO L462 AbstractCegarLoop]: Abstraction has 2500 states and 3970 transitions. [2019-12-07 16:53:46,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:53:46,723 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 3970 transitions. [2019-12-07 16:53:46,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 16:53:46,725 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:46,725 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:53:46,725 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:53:46,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:46,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1309296475, now seen corresponding path program 1 times [2019-12-07 16:53:46,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:53:46,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772459550] [2019-12-07 16:53:46,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:53:46,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:46,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:46,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772459550] [2019-12-07 16:53:46,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:46,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:53:46,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611440214] [2019-12-07 16:53:46,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:53:46,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:53:46,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:53:46,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:46,742 INFO L87 Difference]: Start difference. First operand 2500 states and 3970 transitions. Second operand 3 states. [2019-12-07 16:53:46,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:46,793 INFO L93 Difference]: Finished difference Result 4488 states and 7268 transitions. [2019-12-07 16:53:46,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:53:46,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-07 16:53:46,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:46,811 INFO L225 Difference]: With dead ends: 4488 [2019-12-07 16:53:46,811 INFO L226 Difference]: Without dead ends: 4486 [2019-12-07 16:53:46,812 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:46,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4486 states. [2019-12-07 16:53:46,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4486 to 3588. [2019-12-07 16:53:46,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3588 states. [2019-12-07 16:53:46,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3588 states to 3588 states and 5538 transitions. [2019-12-07 16:53:46,883 INFO L78 Accepts]: Start accepts. Automaton has 3588 states and 5538 transitions. Word has length 25 [2019-12-07 16:53:46,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:46,884 INFO L462 AbstractCegarLoop]: Abstraction has 3588 states and 5538 transitions. [2019-12-07 16:53:46,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:53:46,884 INFO L276 IsEmpty]: Start isEmpty. Operand 3588 states and 5538 transitions. [2019-12-07 16:53:46,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 16:53:46,887 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:46,887 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:53:46,887 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:53:46,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:46,887 INFO L82 PathProgramCache]: Analyzing trace with hash 288228121, now seen corresponding path program 1 times [2019-12-07 16:53:46,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:53:46,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993314081] [2019-12-07 16:53:46,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:53:46,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:46,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:46,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993314081] [2019-12-07 16:53:46,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:46,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:53:46,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118972839] [2019-12-07 16:53:46,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:53:46,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:53:46,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:53:46,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:46,904 INFO L87 Difference]: Start difference. First operand 3588 states and 5538 transitions. Second operand 3 states. [2019-12-07 16:53:46,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:46,959 INFO L93 Difference]: Finished difference Result 8392 states and 13028 transitions. [2019-12-07 16:53:46,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:53:46,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-07 16:53:46,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:46,980 INFO L225 Difference]: With dead ends: 8392 [2019-12-07 16:53:46,980 INFO L226 Difference]: Without dead ends: 4870 [2019-12-07 16:53:46,984 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:46,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4870 states. [2019-12-07 16:53:47,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4870 to 4868. [2019-12-07 16:53:47,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4868 states. [2019-12-07 16:53:47,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4868 states to 4868 states and 7490 transitions. [2019-12-07 16:53:47,076 INFO L78 Accepts]: Start accepts. Automaton has 4868 states and 7490 transitions. Word has length 25 [2019-12-07 16:53:47,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:47,076 INFO L462 AbstractCegarLoop]: Abstraction has 4868 states and 7490 transitions. [2019-12-07 16:53:47,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:53:47,076 INFO L276 IsEmpty]: Start isEmpty. Operand 4868 states and 7490 transitions. [2019-12-07 16:53:47,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 16:53:47,080 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:47,080 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:53:47,080 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:53:47,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:47,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1933699482, now seen corresponding path program 1 times [2019-12-07 16:53:47,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:53:47,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805500874] [2019-12-07 16:53:47,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:53:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:47,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:47,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805500874] [2019-12-07 16:53:47,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:47,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:53:47,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866311050] [2019-12-07 16:53:47,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:53:47,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:53:47,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:53:47,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:47,093 INFO L87 Difference]: Start difference. First operand 4868 states and 7490 transitions. Second operand 3 states. [2019-12-07 16:53:47,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:47,158 INFO L93 Difference]: Finished difference Result 7304 states and 11204 transitions. [2019-12-07 16:53:47,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:53:47,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-07 16:53:47,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:47,168 INFO L225 Difference]: With dead ends: 7304 [2019-12-07 16:53:47,168 INFO L226 Difference]: Without dead ends: 4934 [2019-12-07 16:53:47,171 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:47,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4934 states. [2019-12-07 16:53:47,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4934 to 4932. [2019-12-07 16:53:47,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4932 states. [2019-12-07 16:53:47,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4932 states to 4932 states and 7490 transitions. [2019-12-07 16:53:47,271 INFO L78 Accepts]: Start accepts. Automaton has 4932 states and 7490 transitions. Word has length 26 [2019-12-07 16:53:47,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:47,271 INFO L462 AbstractCegarLoop]: Abstraction has 4932 states and 7490 transitions. [2019-12-07 16:53:47,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:53:47,271 INFO L276 IsEmpty]: Start isEmpty. Operand 4932 states and 7490 transitions. [2019-12-07 16:53:47,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 16:53:47,274 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:47,274 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:53:47,275 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:53:47,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:47,275 INFO L82 PathProgramCache]: Analyzing trace with hash 345351580, now seen corresponding path program 1 times [2019-12-07 16:53:47,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:53:47,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370301336] [2019-12-07 16:53:47,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:53:47,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:47,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:47,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370301336] [2019-12-07 16:53:47,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:47,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:53:47,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132821666] [2019-12-07 16:53:47,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:53:47,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:53:47,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:53:47,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:47,288 INFO L87 Difference]: Start difference. First operand 4932 states and 7490 transitions. Second operand 3 states. [2019-12-07 16:53:47,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:47,342 INFO L93 Difference]: Finished difference Result 8712 states and 13508 transitions. [2019-12-07 16:53:47,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:53:47,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-07 16:53:47,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:47,353 INFO L225 Difference]: With dead ends: 8712 [2019-12-07 16:53:47,353 INFO L226 Difference]: Without dead ends: 8710 [2019-12-07 16:53:47,355 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:47,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8710 states. [2019-12-07 16:53:47,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8710 to 7172. [2019-12-07 16:53:47,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7172 states. [2019-12-07 16:53:47,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7172 states to 7172 states and 10562 transitions. [2019-12-07 16:53:47,460 INFO L78 Accepts]: Start accepts. Automaton has 7172 states and 10562 transitions. Word has length 26 [2019-12-07 16:53:47,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:47,460 INFO L462 AbstractCegarLoop]: Abstraction has 7172 states and 10562 transitions. [2019-12-07 16:53:47,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:53:47,460 INFO L276 IsEmpty]: Start isEmpty. Operand 7172 states and 10562 transitions. [2019-12-07 16:53:47,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 16:53:47,466 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:47,466 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:53:47,466 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:53:47,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:47,467 INFO L82 PathProgramCache]: Analyzing trace with hash -675716774, now seen corresponding path program 1 times [2019-12-07 16:53:47,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:53:47,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336747150] [2019-12-07 16:53:47,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:53:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:47,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:47,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336747150] [2019-12-07 16:53:47,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:47,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:53:47,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442777875] [2019-12-07 16:53:47,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:53:47,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:53:47,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:53:47,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:47,479 INFO L87 Difference]: Start difference. First operand 7172 states and 10562 transitions. Second operand 3 states. [2019-12-07 16:53:47,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:47,551 INFO L93 Difference]: Finished difference Result 16648 states and 24644 transitions. [2019-12-07 16:53:47,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:53:47,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-07 16:53:47,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:47,563 INFO L225 Difference]: With dead ends: 16648 [2019-12-07 16:53:47,563 INFO L226 Difference]: Without dead ends: 9606 [2019-12-07 16:53:47,569 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:47,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9606 states. [2019-12-07 16:53:47,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9606 to 9604. [2019-12-07 16:53:47,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9604 states. [2019-12-07 16:53:47,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9604 states to 9604 states and 14082 transitions. [2019-12-07 16:53:47,698 INFO L78 Accepts]: Start accepts. Automaton has 9604 states and 14082 transitions. Word has length 26 [2019-12-07 16:53:47,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:47,698 INFO L462 AbstractCegarLoop]: Abstraction has 9604 states and 14082 transitions. [2019-12-07 16:53:47,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:53:47,698 INFO L276 IsEmpty]: Start isEmpty. Operand 9604 states and 14082 transitions. [2019-12-07 16:53:47,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 16:53:47,705 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:47,705 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:53:47,705 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:53:47,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:47,705 INFO L82 PathProgramCache]: Analyzing trace with hash 2116179150, now seen corresponding path program 1 times [2019-12-07 16:53:47,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:53:47,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488539901] [2019-12-07 16:53:47,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:53:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:47,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:47,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488539901] [2019-12-07 16:53:47,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:47,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:53:47,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567516391] [2019-12-07 16:53:47,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:53:47,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:53:47,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:53:47,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:47,719 INFO L87 Difference]: Start difference. First operand 9604 states and 14082 transitions. Second operand 3 states. [2019-12-07 16:53:47,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:47,799 INFO L93 Difference]: Finished difference Result 14408 states and 21060 transitions. [2019-12-07 16:53:47,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:53:47,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 16:53:47,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:47,812 INFO L225 Difference]: With dead ends: 14408 [2019-12-07 16:53:47,812 INFO L226 Difference]: Without dead ends: 9734 [2019-12-07 16:53:47,818 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:47,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9734 states. [2019-12-07 16:53:47,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9734 to 9732. [2019-12-07 16:53:47,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9732 states. [2019-12-07 16:53:47,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9732 states to 9732 states and 14082 transitions. [2019-12-07 16:53:47,960 INFO L78 Accepts]: Start accepts. Automaton has 9732 states and 14082 transitions. Word has length 27 [2019-12-07 16:53:47,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:47,960 INFO L462 AbstractCegarLoop]: Abstraction has 9732 states and 14082 transitions. [2019-12-07 16:53:47,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:53:47,961 INFO L276 IsEmpty]: Start isEmpty. Operand 9732 states and 14082 transitions. [2019-12-07 16:53:47,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 16:53:47,967 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:47,967 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:53:47,967 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:53:47,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:47,967 INFO L82 PathProgramCache]: Analyzing trace with hash 527831248, now seen corresponding path program 1 times [2019-12-07 16:53:47,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:53:47,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709911194] [2019-12-07 16:53:47,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:53:47,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:47,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:47,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709911194] [2019-12-07 16:53:47,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:47,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:53:47,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790162503] [2019-12-07 16:53:47,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:53:47,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:53:47,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:53:47,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:47,979 INFO L87 Difference]: Start difference. First operand 9732 states and 14082 transitions. Second operand 3 states. [2019-12-07 16:53:48,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:48,074 INFO L93 Difference]: Finished difference Result 16904 states and 24964 transitions. [2019-12-07 16:53:48,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:53:48,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 16:53:48,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:48,093 INFO L225 Difference]: With dead ends: 16904 [2019-12-07 16:53:48,093 INFO L226 Difference]: Without dead ends: 16902 [2019-12-07 16:53:48,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:48,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16902 states. [2019-12-07 16:53:48,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16902 to 14340. [2019-12-07 16:53:48,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14340 states. [2019-12-07 16:53:48,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14340 states to 14340 states and 20098 transitions. [2019-12-07 16:53:48,248 INFO L78 Accepts]: Start accepts. Automaton has 14340 states and 20098 transitions. Word has length 27 [2019-12-07 16:53:48,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:48,248 INFO L462 AbstractCegarLoop]: Abstraction has 14340 states and 20098 transitions. [2019-12-07 16:53:48,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:53:48,248 INFO L276 IsEmpty]: Start isEmpty. Operand 14340 states and 20098 transitions. [2019-12-07 16:53:48,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 16:53:48,258 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:48,258 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:53:48,258 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:53:48,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:48,258 INFO L82 PathProgramCache]: Analyzing trace with hash -493237106, now seen corresponding path program 1 times [2019-12-07 16:53:48,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:53:48,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171746733] [2019-12-07 16:53:48,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:53:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:48,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:48,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171746733] [2019-12-07 16:53:48,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:48,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:53:48,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264435138] [2019-12-07 16:53:48,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:53:48,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:53:48,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:53:48,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:48,269 INFO L87 Difference]: Start difference. First operand 14340 states and 20098 transitions. Second operand 3 states. [2019-12-07 16:53:48,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:48,407 INFO L93 Difference]: Finished difference Result 33032 states and 46468 transitions. [2019-12-07 16:53:48,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:53:48,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 16:53:48,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:48,432 INFO L225 Difference]: With dead ends: 33032 [2019-12-07 16:53:48,432 INFO L226 Difference]: Without dead ends: 18950 [2019-12-07 16:53:48,442 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:48,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18950 states. [2019-12-07 16:53:48,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18950 to 18948. [2019-12-07 16:53:48,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18948 states. [2019-12-07 16:53:48,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18948 states to 18948 states and 26370 transitions. [2019-12-07 16:53:48,632 INFO L78 Accepts]: Start accepts. Automaton has 18948 states and 26370 transitions. Word has length 27 [2019-12-07 16:53:48,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:48,633 INFO L462 AbstractCegarLoop]: Abstraction has 18948 states and 26370 transitions. [2019-12-07 16:53:48,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:53:48,633 INFO L276 IsEmpty]: Start isEmpty. Operand 18948 states and 26370 transitions. [2019-12-07 16:53:48,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 16:53:48,642 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:48,642 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:53:48,642 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:53:48,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:48,642 INFO L82 PathProgramCache]: Analyzing trace with hash -816885393, now seen corresponding path program 1 times [2019-12-07 16:53:48,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:53:48,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286774905] [2019-12-07 16:53:48,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:53:48,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:48,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:48,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286774905] [2019-12-07 16:53:48,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:48,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:53:48,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099027462] [2019-12-07 16:53:48,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:53:48,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:53:48,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:53:48,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:48,654 INFO L87 Difference]: Start difference. First operand 18948 states and 26370 transitions. Second operand 3 states. [2019-12-07 16:53:48,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:48,749 INFO L93 Difference]: Finished difference Result 28424 states and 39428 transitions. [2019-12-07 16:53:48,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:53:48,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-07 16:53:48,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:48,771 INFO L225 Difference]: With dead ends: 28424 [2019-12-07 16:53:48,771 INFO L226 Difference]: Without dead ends: 19206 [2019-12-07 16:53:48,779 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:48,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19206 states. [2019-12-07 16:53:49,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19206 to 19204. [2019-12-07 16:53:49,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19204 states. [2019-12-07 16:53:49,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19204 states to 19204 states and 26370 transitions. [2019-12-07 16:53:49,039 INFO L78 Accepts]: Start accepts. Automaton has 19204 states and 26370 transitions. Word has length 28 [2019-12-07 16:53:49,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:49,039 INFO L462 AbstractCegarLoop]: Abstraction has 19204 states and 26370 transitions. [2019-12-07 16:53:49,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:53:49,039 INFO L276 IsEmpty]: Start isEmpty. Operand 19204 states and 26370 transitions. [2019-12-07 16:53:49,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 16:53:49,049 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:49,049 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:53:49,049 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:53:49,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:49,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1889734001, now seen corresponding path program 1 times [2019-12-07 16:53:49,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:53:49,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923574752] [2019-12-07 16:53:49,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:53:49,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:49,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:49,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923574752] [2019-12-07 16:53:49,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:49,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:53:49,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056457873] [2019-12-07 16:53:49,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:53:49,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:53:49,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:53:49,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:49,061 INFO L87 Difference]: Start difference. First operand 19204 states and 26370 transitions. Second operand 3 states. [2019-12-07 16:53:49,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:49,199 INFO L93 Difference]: Finished difference Result 32776 states and 45828 transitions. [2019-12-07 16:53:49,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:53:49,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-07 16:53:49,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:49,231 INFO L225 Difference]: With dead ends: 32776 [2019-12-07 16:53:49,231 INFO L226 Difference]: Without dead ends: 32774 [2019-12-07 16:53:49,235 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:49,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32774 states. [2019-12-07 16:53:49,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32774 to 28676. [2019-12-07 16:53:49,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28676 states. [2019-12-07 16:53:49,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28676 states to 28676 states and 38146 transitions. [2019-12-07 16:53:49,576 INFO L78 Accepts]: Start accepts. Automaton has 28676 states and 38146 transitions. Word has length 28 [2019-12-07 16:53:49,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:49,576 INFO L462 AbstractCegarLoop]: Abstraction has 28676 states and 38146 transitions. [2019-12-07 16:53:49,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:53:49,576 INFO L276 IsEmpty]: Start isEmpty. Operand 28676 states and 38146 transitions. [2019-12-07 16:53:49,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 16:53:49,590 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:49,590 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:53:49,590 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:53:49,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:49,590 INFO L82 PathProgramCache]: Analyzing trace with hash 868665647, now seen corresponding path program 1 times [2019-12-07 16:53:49,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:53:49,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608214754] [2019-12-07 16:53:49,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:53:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:49,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:49,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608214754] [2019-12-07 16:53:49,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:49,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:53:49,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607426323] [2019-12-07 16:53:49,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:53:49,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:53:49,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:53:49,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:49,601 INFO L87 Difference]: Start difference. First operand 28676 states and 38146 transitions. Second operand 3 states. [2019-12-07 16:53:49,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:49,796 INFO L93 Difference]: Finished difference Result 65544 states and 87300 transitions. [2019-12-07 16:53:49,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:53:49,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-07 16:53:49,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:49,823 INFO L225 Difference]: With dead ends: 65544 [2019-12-07 16:53:49,823 INFO L226 Difference]: Without dead ends: 37382 [2019-12-07 16:53:49,839 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:49,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37382 states. [2019-12-07 16:53:50,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37382 to 37380. [2019-12-07 16:53:50,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37380 states. [2019-12-07 16:53:50,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37380 states to 37380 states and 49154 transitions. [2019-12-07 16:53:50,217 INFO L78 Accepts]: Start accepts. Automaton has 37380 states and 49154 transitions. Word has length 28 [2019-12-07 16:53:50,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:50,217 INFO L462 AbstractCegarLoop]: Abstraction has 37380 states and 49154 transitions. [2019-12-07 16:53:50,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:53:50,217 INFO L276 IsEmpty]: Start isEmpty. Operand 37380 states and 49154 transitions. [2019-12-07 16:53:50,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 16:53:50,232 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:50,232 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:53:50,232 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:53:50,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:50,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1547572669, now seen corresponding path program 1 times [2019-12-07 16:53:50,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:53:50,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555419512] [2019-12-07 16:53:50,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:53:50,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:50,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:50,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555419512] [2019-12-07 16:53:50,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:50,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:53:50,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938907104] [2019-12-07 16:53:50,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:53:50,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:53:50,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:53:50,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:50,247 INFO L87 Difference]: Start difference. First operand 37380 states and 49154 transitions. Second operand 3 states. [2019-12-07 16:53:50,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:50,554 INFO L93 Difference]: Finished difference Result 56072 states and 73476 transitions. [2019-12-07 16:53:50,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:53:50,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 16:53:50,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:50,578 INFO L225 Difference]: With dead ends: 56072 [2019-12-07 16:53:50,578 INFO L226 Difference]: Without dead ends: 37894 [2019-12-07 16:53:50,586 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:50,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37894 states. [2019-12-07 16:53:50,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37894 to 37892. [2019-12-07 16:53:50,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37892 states. [2019-12-07 16:53:50,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37892 states to 37892 states and 49154 transitions. [2019-12-07 16:53:50,946 INFO L78 Accepts]: Start accepts. Automaton has 37892 states and 49154 transitions. Word has length 29 [2019-12-07 16:53:50,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:50,947 INFO L462 AbstractCegarLoop]: Abstraction has 37892 states and 49154 transitions. [2019-12-07 16:53:50,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:53:50,947 INFO L276 IsEmpty]: Start isEmpty. Operand 37892 states and 49154 transitions. [2019-12-07 16:53:50,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 16:53:50,959 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:50,959 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:53:50,960 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:53:50,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:50,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1159046725, now seen corresponding path program 1 times [2019-12-07 16:53:50,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:53:50,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566521956] [2019-12-07 16:53:50,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:53:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:50,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:50,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566521956] [2019-12-07 16:53:50,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:50,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:53:50,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906621255] [2019-12-07 16:53:50,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:53:50,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:53:50,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:53:50,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:50,975 INFO L87 Difference]: Start difference. First operand 37892 states and 49154 transitions. Second operand 3 states. [2019-12-07 16:53:51,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:51,396 INFO L93 Difference]: Finished difference Result 110600 states and 141316 transitions. [2019-12-07 16:53:51,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:53:51,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 16:53:51,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:51,452 INFO L225 Difference]: With dead ends: 110600 [2019-12-07 16:53:51,452 INFO L226 Difference]: Without dead ends: 73734 [2019-12-07 16:53:51,470 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:51,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73734 states. [2019-12-07 16:53:52,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73734 to 73732. [2019-12-07 16:53:52,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73732 states. [2019-12-07 16:53:52,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73732 states to 73732 states and 92162 transitions. [2019-12-07 16:53:52,223 INFO L78 Accepts]: Start accepts. Automaton has 73732 states and 92162 transitions. Word has length 29 [2019-12-07 16:53:52,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:52,223 INFO L462 AbstractCegarLoop]: Abstraction has 73732 states and 92162 transitions. [2019-12-07 16:53:52,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:53:52,223 INFO L276 IsEmpty]: Start isEmpty. Operand 73732 states and 92162 transitions. [2019-12-07 16:53:52,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 16:53:52,250 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:52,250 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:53:52,250 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:53:52,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:52,251 INFO L82 PathProgramCache]: Analyzing trace with hash -2114852217, now seen corresponding path program 1 times [2019-12-07 16:53:52,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:53:52,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102548544] [2019-12-07 16:53:52,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:53:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:52,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:52,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102548544] [2019-12-07 16:53:52,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:52,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:53:52,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192656460] [2019-12-07 16:53:52,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:53:52,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:53:52,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:53:52,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:52,264 INFO L87 Difference]: Start difference. First operand 73732 states and 92162 transitions. Second operand 3 states. [2019-12-07 16:53:52,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:52,826 INFO L93 Difference]: Finished difference Result 79880 states and 102404 transitions. [2019-12-07 16:53:52,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:53:52,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 16:53:52,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:52,874 INFO L225 Difference]: With dead ends: 79880 [2019-12-07 16:53:52,875 INFO L226 Difference]: Without dead ends: 79878 [2019-12-07 16:53:52,883 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:52,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79878 states. [2019-12-07 16:53:53,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79878 to 73732. [2019-12-07 16:53:53,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73732 states. [2019-12-07 16:53:53,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73732 states to 73732 states and 91138 transitions. [2019-12-07 16:53:53,730 INFO L78 Accepts]: Start accepts. Automaton has 73732 states and 91138 transitions. Word has length 29 [2019-12-07 16:53:53,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:53,730 INFO L462 AbstractCegarLoop]: Abstraction has 73732 states and 91138 transitions. [2019-12-07 16:53:53,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:53:53,730 INFO L276 IsEmpty]: Start isEmpty. Operand 73732 states and 91138 transitions. [2019-12-07 16:53:53,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 16:53:53,753 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:53,753 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:53:53,754 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:53:53,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:53,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1570925892, now seen corresponding path program 1 times [2019-12-07 16:53:53,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:53:53,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238170537] [2019-12-07 16:53:53,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:53:53,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:53,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:53,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238170537] [2019-12-07 16:53:53,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:53,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:53:53,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164120034] [2019-12-07 16:53:53,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:53:53,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:53:53,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:53:53,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:53,767 INFO L87 Difference]: Start difference. First operand 73732 states and 91138 transitions. Second operand 3 states. [2019-12-07 16:53:54,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:54,342 INFO L93 Difference]: Finished difference Result 121864 states and 151556 transitions. [2019-12-07 16:53:54,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:53:54,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-07 16:53:54,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:54,436 INFO L225 Difference]: With dead ends: 121864 [2019-12-07 16:53:54,436 INFO L226 Difference]: Without dead ends: 121862 [2019-12-07 16:53:54,456 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:54,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121862 states. [2019-12-07 16:53:55,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121862 to 113668. [2019-12-07 16:53:55,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113668 states. [2019-12-07 16:53:55,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113668 states to 113668 states and 137218 transitions. [2019-12-07 16:53:55,690 INFO L78 Accepts]: Start accepts. Automaton has 113668 states and 137218 transitions. Word has length 30 [2019-12-07 16:53:55,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:55,691 INFO L462 AbstractCegarLoop]: Abstraction has 113668 states and 137218 transitions. [2019-12-07 16:53:55,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:53:55,691 INFO L276 IsEmpty]: Start isEmpty. Operand 113668 states and 137218 transitions. [2019-12-07 16:53:55,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 16:53:55,741 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:55,741 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:53:55,741 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:53:55,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:55,742 INFO L82 PathProgramCache]: Analyzing trace with hash 549857538, now seen corresponding path program 1 times [2019-12-07 16:53:55,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:53:55,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349594819] [2019-12-07 16:53:55,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:53:55,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:55,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:55,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349594819] [2019-12-07 16:53:55,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:55,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:53:55,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010205140] [2019-12-07 16:53:55,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:53:55,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:53:55,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:53:55,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:55,755 INFO L87 Difference]: Start difference. First operand 113668 states and 137218 transitions. Second operand 3 states. [2019-12-07 16:53:56,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:53:56,593 INFO L93 Difference]: Finished difference Result 257032 states and 309252 transitions. [2019-12-07 16:53:56,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:53:56,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-07 16:53:56,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:53:56,703 INFO L225 Difference]: With dead ends: 257032 [2019-12-07 16:53:56,703 INFO L226 Difference]: Without dead ends: 144390 [2019-12-07 16:53:56,752 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:56,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144390 states. [2019-12-07 16:53:58,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144390 to 144388. [2019-12-07 16:53:58,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144388 states. [2019-12-07 16:53:58,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144388 states to 144388 states and 169986 transitions. [2019-12-07 16:53:58,415 INFO L78 Accepts]: Start accepts. Automaton has 144388 states and 169986 transitions. Word has length 30 [2019-12-07 16:53:58,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:53:58,415 INFO L462 AbstractCegarLoop]: Abstraction has 144388 states and 169986 transitions. [2019-12-07 16:53:58,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:53:58,415 INFO L276 IsEmpty]: Start isEmpty. Operand 144388 states and 169986 transitions. [2019-12-07 16:53:58,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 16:53:58,469 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:53:58,469 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:53:58,469 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:53:58,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:53:58,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1454278522, now seen corresponding path program 1 times [2019-12-07 16:53:58,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:53:58,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518671589] [2019-12-07 16:53:58,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:53:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:53:58,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:53:58,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518671589] [2019-12-07 16:53:58,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:53:58,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:53:58,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925264293] [2019-12-07 16:53:58,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:53:58,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:53:58,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:53:58,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:53:58,484 INFO L87 Difference]: Start difference. First operand 144388 states and 169986 transitions. Second operand 3 states. [2019-12-07 16:54:00,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:54:00,094 INFO L93 Difference]: Finished difference Result 218120 states and 257028 transitions. [2019-12-07 16:54:00,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:54:00,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-07 16:54:00,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:54:00,205 INFO L225 Difference]: With dead ends: 218120 [2019-12-07 16:54:00,205 INFO L226 Difference]: Without dead ends: 147462 [2019-12-07 16:54:00,238 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:54:00,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147462 states. [2019-12-07 16:54:01,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147462 to 147460. [2019-12-07 16:54:01,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147460 states. [2019-12-07 16:54:01,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147460 states to 147460 states and 172034 transitions. [2019-12-07 16:54:01,820 INFO L78 Accepts]: Start accepts. Automaton has 147460 states and 172034 transitions. Word has length 31 [2019-12-07 16:54:01,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:54:01,820 INFO L462 AbstractCegarLoop]: Abstraction has 147460 states and 172034 transitions. [2019-12-07 16:54:01,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:54:01,820 INFO L276 IsEmpty]: Start isEmpty. Operand 147460 states and 172034 transitions. [2019-12-07 16:54:02,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 16:54:02,008 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:54:02,008 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:54:02,008 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:54:02,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:54:02,009 INFO L82 PathProgramCache]: Analyzing trace with hash -134069380, now seen corresponding path program 1 times [2019-12-07 16:54:02,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:54:02,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746621633] [2019-12-07 16:54:02,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:54:02,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:54:02,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:54:02,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746621633] [2019-12-07 16:54:02,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:54:02,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:54:02,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358060703] [2019-12-07 16:54:02,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:54:02,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:54:02,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:54:02,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:54:02,020 INFO L87 Difference]: Start difference. First operand 147460 states and 172034 transitions. Second operand 3 states. [2019-12-07 16:54:03,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:54:03,247 INFO L93 Difference]: Finished difference Result 237574 states and 274435 transitions. [2019-12-07 16:54:03,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:54:03,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-07 16:54:03,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:54:03,465 INFO L225 Difference]: With dead ends: 237574 [2019-12-07 16:54:03,465 INFO L226 Difference]: Without dead ends: 237572 [2019-12-07 16:54:03,505 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:54:03,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237572 states. [2019-12-07 16:54:05,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237572 to 229380. [2019-12-07 16:54:05,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229380 states. [2019-12-07 16:54:06,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229380 states to 229380 states and 262146 transitions. [2019-12-07 16:54:06,090 INFO L78 Accepts]: Start accepts. Automaton has 229380 states and 262146 transitions. Word has length 31 [2019-12-07 16:54:06,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:54:06,090 INFO L462 AbstractCegarLoop]: Abstraction has 229380 states and 262146 transitions. [2019-12-07 16:54:06,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:54:06,090 INFO L276 IsEmpty]: Start isEmpty. Operand 229380 states and 262146 transitions. [2019-12-07 16:54:06,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 16:54:06,208 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:54:06,208 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:54:06,208 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:54:06,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:54:06,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1155137734, now seen corresponding path program 1 times [2019-12-07 16:54:06,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:54:06,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11765515] [2019-12-07 16:54:06,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:54:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:54:06,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:54:06,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11765515] [2019-12-07 16:54:06,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:54:06,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:54:06,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046277741] [2019-12-07 16:54:06,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:54:06,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:54:06,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:54:06,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:54:06,221 INFO L87 Difference]: Start difference. First operand 229380 states and 262146 transitions. Second operand 3 states. [2019-12-07 16:54:08,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:54:08,023 INFO L93 Difference]: Finished difference Result 512004 states and 577538 transitions. [2019-12-07 16:54:08,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:54:08,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-07 16:54:08,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:54:08,025 INFO L225 Difference]: With dead ends: 512004 [2019-12-07 16:54:08,025 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 16:54:08,155 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:54:08,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 16:54:08,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 16:54:08,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 16:54:08,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 16:54:08,156 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2019-12-07 16:54:08,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:54:08,156 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 16:54:08,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:54:08,156 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 16:54:08,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 16:54:08,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 16:54:08,189 INFO L246 CegarLoopResult]: For program point L151(line 151) no Hoare annotation was computed. [2019-12-07 16:54:08,189 INFO L246 CegarLoopResult]: For program point L85-1(lines 48 200) no Hoare annotation was computed. [2019-12-07 16:54:08,189 INFO L249 CegarLoopResult]: At program point L201(lines 5 205) the Hoare annotation is: true [2019-12-07 16:54:08,189 INFO L246 CegarLoopResult]: For program point L135-1(lines 48 200) no Hoare annotation was computed. [2019-12-07 16:54:08,189 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 16:54:08,189 INFO L246 CegarLoopResult]: For program point L185-1(lines 48 200) no Hoare annotation was computed. [2019-12-07 16:54:08,189 INFO L246 CegarLoopResult]: For program point L136(line 136) no Hoare annotation was computed. [2019-12-07 16:54:08,190 INFO L246 CegarLoopResult]: For program point L186(line 186) no Hoare annotation was computed. [2019-12-07 16:54:08,190 INFO L246 CegarLoopResult]: For program point L170-1(lines 48 200) no Hoare annotation was computed. [2019-12-07 16:54:08,190 INFO L246 CegarLoopResult]: For program point L121-1(lines 48 200) no Hoare annotation was computed. [2019-12-07 16:54:08,190 INFO L249 CegarLoopResult]: At program point L204(lines 4 205) the Hoare annotation is: true [2019-12-07 16:54:08,190 INFO L246 CegarLoopResult]: For program point L171(line 171) no Hoare annotation was computed. [2019-12-07 16:54:08,190 INFO L246 CegarLoopResult]: For program point L105-1(lines 48 200) no Hoare annotation was computed. [2019-12-07 16:54:08,190 INFO L246 CegarLoopResult]: For program point L155-1(lines 48 200) no Hoare annotation was computed. [2019-12-07 16:54:08,190 INFO L246 CegarLoopResult]: For program point L89-1(lines 48 200) no Hoare annotation was computed. [2019-12-07 16:54:08,190 INFO L246 CegarLoopResult]: For program point L156(line 156) no Hoare annotation was computed. [2019-12-07 16:54:08,190 INFO L246 CegarLoopResult]: For program point L140-1(lines 48 200) no Hoare annotation was computed. [2019-12-07 16:54:08,190 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 16:54:08,190 INFO L246 CegarLoopResult]: For program point L190-1(lines 48 200) no Hoare annotation was computed. [2019-12-07 16:54:08,190 INFO L246 CegarLoopResult]: For program point L141(line 141) no Hoare annotation was computed. [2019-12-07 16:54:08,190 INFO L246 CegarLoopResult]: For program point L191(line 191) no Hoare annotation was computed. [2019-12-07 16:54:08,190 INFO L246 CegarLoopResult]: For program point L125-1(lines 48 200) no Hoare annotation was computed. [2019-12-07 16:54:08,191 INFO L246 CegarLoopResult]: For program point L175-1(lines 48 200) no Hoare annotation was computed. [2019-12-07 16:54:08,191 INFO L246 CegarLoopResult]: For program point L109-1(lines 48 200) no Hoare annotation was computed. [2019-12-07 16:54:08,191 INFO L246 CegarLoopResult]: For program point L93-1(lines 48 200) no Hoare annotation was computed. [2019-12-07 16:54:08,191 INFO L246 CegarLoopResult]: For program point L176(line 176) no Hoare annotation was computed. [2019-12-07 16:54:08,191 INFO L246 CegarLoopResult]: For program point L160-1(lines 48 200) no Hoare annotation was computed. [2019-12-07 16:54:08,191 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 16:54:08,191 INFO L246 CegarLoopResult]: For program point L161(line 161) no Hoare annotation was computed. [2019-12-07 16:54:08,191 INFO L246 CegarLoopResult]: For program point L145-1(lines 48 200) no Hoare annotation was computed. [2019-12-07 16:54:08,191 INFO L249 CegarLoopResult]: At program point L195-1(lines 48 200) the Hoare annotation is: true [2019-12-07 16:54:08,191 INFO L246 CegarLoopResult]: For program point L129-1(lines 48 200) no Hoare annotation was computed. [2019-12-07 16:54:08,191 INFO L246 CegarLoopResult]: For program point L146(line 146) no Hoare annotation was computed. [2019-12-07 16:54:08,191 INFO L246 CegarLoopResult]: For program point L113-1(lines 48 200) no Hoare annotation was computed. [2019-12-07 16:54:08,191 INFO L246 CegarLoopResult]: For program point L196(line 196) no Hoare annotation was computed. [2019-12-07 16:54:08,191 INFO L242 CegarLoopResult]: At program point L196-1(lines 5 205) the Hoare annotation is: false [2019-12-07 16:54:08,191 INFO L246 CegarLoopResult]: For program point L97-1(lines 48 200) no Hoare annotation was computed. [2019-12-07 16:54:08,192 INFO L246 CegarLoopResult]: For program point L180-1(lines 48 200) no Hoare annotation was computed. [2019-12-07 16:54:08,192 INFO L246 CegarLoopResult]: For program point L81(lines 81 83) no Hoare annotation was computed. [2019-12-07 16:54:08,192 INFO L246 CegarLoopResult]: For program point L81-2(lines 48 200) no Hoare annotation was computed. [2019-12-07 16:54:08,192 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 203) no Hoare annotation was computed. [2019-12-07 16:54:08,192 INFO L246 CegarLoopResult]: For program point L181(line 181) no Hoare annotation was computed. [2019-12-07 16:54:08,192 INFO L246 CegarLoopResult]: For program point L165-1(lines 48 200) no Hoare annotation was computed. [2019-12-07 16:54:08,192 INFO L246 CegarLoopResult]: For program point L50(lines 50 52) no Hoare annotation was computed. [2019-12-07 16:54:08,192 INFO L246 CegarLoopResult]: For program point L166(line 166) no Hoare annotation was computed. [2019-12-07 16:54:08,192 INFO L246 CegarLoopResult]: For program point L150-1(lines 48 200) no Hoare annotation was computed. [2019-12-07 16:54:08,192 INFO L246 CegarLoopResult]: For program point L117-1(lines 48 200) no Hoare annotation was computed. [2019-12-07 16:54:08,192 INFO L246 CegarLoopResult]: For program point L101-1(lines 48 200) no Hoare annotation was computed. [2019-12-07 16:54:08,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:54:08 BoogieIcfgContainer [2019-12-07 16:54:08,200 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:54:08,201 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:54:08,201 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:54:08,201 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:54:08,201 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:53:45" (3/4) ... [2019-12-07 16:54:08,203 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 16:54:08,212 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-07 16:54:08,212 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 16:54:08,251 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8c15e4d1-b599-4f78-b7c2-d948db734203/bin/uautomizer/witness.graphml [2019-12-07 16:54:08,251 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:54:08,252 INFO L168 Benchmark]: Toolchain (without parser) took 23336.10 ms. Allocated memory was 1.0 GB in the beginning and 4.5 GB in the end (delta: 3.4 GB). Free memory was 945.1 MB in the beginning and 1.1 GB in the end (delta: -125.4 MB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2019-12-07 16:54:08,253 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:54:08,253 INFO L168 Benchmark]: CACSL2BoogieTranslator took 204.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.8 MB). Free memory was 945.1 MB in the beginning and 1.1 GB in the end (delta: -142.5 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-12-07 16:54:08,253 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.25 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:54:08,254 INFO L168 Benchmark]: Boogie Preprocessor took 17.31 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:54:08,254 INFO L168 Benchmark]: RCFGBuilder took 227.26 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: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-12-07 16:54:08,254 INFO L168 Benchmark]: TraceAbstraction took 22807.00 ms. Allocated memory was 1.1 GB in the beginning and 4.5 GB in the end (delta: 3.3 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -82.0 MB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2019-12-07 16:54:08,254 INFO L168 Benchmark]: Witness Printer took 50.55 ms. Allocated memory is still 4.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 71.9 MB). Peak memory consumption was 71.9 MB. Max. memory is 11.5 GB. [2019-12-07 16:54:08,256 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 204.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.8 MB). Free memory was 945.1 MB in the beginning and 1.1 GB in the end (delta: -142.5 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.25 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.31 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 227.26 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: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22807.00 ms. Allocated memory was 1.1 GB in the beginning and 4.5 GB in the end (delta: 3.3 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -82.0 MB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. * Witness Printer took 50.55 ms. Allocated memory is still 4.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 71.9 MB). Peak memory consumption was 71.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 203]: 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: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 48 locations, 1 error locations. Result: SAFE, OverallTime: 22.7s, OverallIterations: 36, TraceHistogramMax: 1, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3765 SDtfs, 1926 SDslu, 2532 SDs, 0 SdLazy, 191 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229380occurred in iteration=35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.3s AutomataMinimizationTime, 36 MinimizatonAttempts, 32806 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 8201 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 904 NumberOfCodeBlocks, 904 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 868 ConstructedInterpolants, 0 QuantifiedInterpolants, 47768 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...