./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_14-1.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_c988a84f-023e-4365-b447-c6a71f1add9c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c988a84f-023e-4365-b447-c6a71f1add9c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c988a84f-023e-4365-b447-c6a71f1add9c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c988a84f-023e-4365-b447-c6a71f1add9c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_14-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c988a84f-023e-4365-b447-c6a71f1add9c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c988a84f-023e-4365-b447-c6a71f1add9c/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 c5a3d22d49117f02662b197492bc1b16616a2878 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 12:55:11,822 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:55:11,824 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:55:11,831 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:55:11,831 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:55:11,832 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:55:11,833 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:55:11,834 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:55:11,835 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:55:11,836 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:55:11,836 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:55:11,837 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:55:11,837 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:55:11,838 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:55:11,839 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:55:11,840 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:55:11,840 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:55:11,841 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:55:11,842 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:55:11,843 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:55:11,845 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:55:11,845 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:55:11,846 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:55:11,846 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:55:11,848 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:55:11,848 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:55:11,848 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:55:11,849 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:55:11,849 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:55:11,850 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:55:11,850 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:55:11,850 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:55:11,850 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:55:11,851 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:55:11,852 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:55:11,852 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:55:11,852 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:55:11,852 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:55:11,852 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:55:11,853 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:55:11,853 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:55:11,854 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c988a84f-023e-4365-b447-c6a71f1add9c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 12:55:11,863 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:55:11,863 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:55:11,864 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:55:11,864 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:55:11,864 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:55:11,864 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:55:11,864 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:55:11,864 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:55:11,865 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:55:11,865 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:55:11,865 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:55:11,865 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:55:11,865 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:55:11,865 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:55:11,865 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:55:11,865 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:55:11,866 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:55:11,866 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:55:11,866 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:55:11,866 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:55:11,866 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:55:11,866 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:55:11,866 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:55:11,866 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:55:11,867 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:55:11,867 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 12:55:11,867 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:55:11,867 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:55:11,867 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:55:11,867 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_c988a84f-023e-4365-b447-c6a71f1add9c/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 -> c5a3d22d49117f02662b197492bc1b16616a2878 [2019-12-07 12:55:11,965 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:55:11,976 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:55:11,978 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:55:11,980 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:55:11,980 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:55:11,981 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c988a84f-023e-4365-b447-c6a71f1add9c/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_14-1.c [2019-12-07 12:55:12,028 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c988a84f-023e-4365-b447-c6a71f1add9c/bin/uautomizer/data/c57e3687c/3061eff765e24c4bbed8e12fc967a35b/FLAGfb43a15c1 [2019-12-07 12:55:12,350 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:55:12,350 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c988a84f-023e-4365-b447-c6a71f1add9c/sv-benchmarks/c/locks/test_locks_14-1.c [2019-12-07 12:55:12,357 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c988a84f-023e-4365-b447-c6a71f1add9c/bin/uautomizer/data/c57e3687c/3061eff765e24c4bbed8e12fc967a35b/FLAGfb43a15c1 [2019-12-07 12:55:12,366 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c988a84f-023e-4365-b447-c6a71f1add9c/bin/uautomizer/data/c57e3687c/3061eff765e24c4bbed8e12fc967a35b [2019-12-07 12:55:12,368 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:55:12,369 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:55:12,370 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:55:12,370 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:55:12,372 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:55:12,373 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:55:12" (1/1) ... [2019-12-07 12:55:12,375 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aaa2f28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:55:12, skipping insertion in model container [2019-12-07 12:55:12,375 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:55:12" (1/1) ... [2019-12-07 12:55:12,379 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:55:12,397 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:55:12,556 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:55:12,560 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:55:12,582 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:55:12,593 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:55:12,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:55:12 WrapperNode [2019-12-07 12:55:12,594 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:55:12,594 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:55:12,594 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:55:12,594 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:55:12,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:55:12" (1/1) ... [2019-12-07 12:55:12,605 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:55:12" (1/1) ... [2019-12-07 12:55:12,622 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:55:12,622 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:55:12,622 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:55:12,622 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:55:12,628 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:55:12" (1/1) ... [2019-12-07 12:55:12,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:55:12" (1/1) ... [2019-12-07 12:55:12,630 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:55:12" (1/1) ... [2019-12-07 12:55:12,630 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:55:12" (1/1) ... [2019-12-07 12:55:12,632 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:55:12" (1/1) ... [2019-12-07 12:55:12,636 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:55:12" (1/1) ... [2019-12-07 12:55:12,637 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:55:12" (1/1) ... [2019-12-07 12:55:12,639 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:55:12,639 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:55:12,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:55:12,639 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:55:12,640 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:55:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c988a84f-023e-4365-b447-c6a71f1add9c/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 12:55:12,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:55:12,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:55:12,876 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:55:12,876 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-12-07 12:55:12,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:55:12 BoogieIcfgContainer [2019-12-07 12:55:12,877 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:55:12,878 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:55:12,878 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:55:12,880 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:55:12,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:55:12" (1/3) ... [2019-12-07 12:55:12,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@708e22b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:55:12, skipping insertion in model container [2019-12-07 12:55:12,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:55:12" (2/3) ... [2019-12-07 12:55:12,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@708e22b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:55:12, skipping insertion in model container [2019-12-07 12:55:12,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:55:12" (3/3) ... [2019-12-07 12:55:12,882 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_14-1.c [2019-12-07 12:55:12,888 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:55:12,892 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 12:55:12,901 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 12:55:12,916 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:55:12,916 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:55:12,916 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:55:12,916 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:55:12,916 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:55:12,916 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:55:12,916 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:55:12,916 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:55:12,926 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2019-12-07 12:55:12,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 12:55:12,930 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:12,930 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 12:55:12,930 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:12,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:12,934 INFO L82 PathProgramCache]: Analyzing trace with hash 458325173, now seen corresponding path program 1 times [2019-12-07 12:55:12,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:12,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564732945] [2019-12-07 12:55:12,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:13,064 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 12:55:13,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564732945] [2019-12-07 12:55:13,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:13,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:13,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111557012] [2019-12-07 12:55:13,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:13,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:13,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:13,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:13,078 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 3 states. [2019-12-07 12:55:13,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:13,113 INFO L93 Difference]: Finished difference Result 106 states and 192 transitions. [2019-12-07 12:55:13,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:13,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 12:55:13,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:13,122 INFO L225 Difference]: With dead ends: 106 [2019-12-07 12:55:13,122 INFO L226 Difference]: Without dead ends: 92 [2019-12-07 12:55:13,124 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 12:55:13,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-12-07 12:55:13,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 62. [2019-12-07 12:55:13,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 12:55:13,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 117 transitions. [2019-12-07 12:55:13,152 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 117 transitions. Word has length 20 [2019-12-07 12:55:13,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:13,152 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 117 transitions. [2019-12-07 12:55:13,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:13,152 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 117 transitions. [2019-12-07 12:55:13,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 12:55:13,153 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:13,153 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 12:55:13,153 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:13,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:13,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1130022729, now seen corresponding path program 1 times [2019-12-07 12:55:13,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:13,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995619519] [2019-12-07 12:55:13,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:13,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:13,199 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 12:55:13,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995619519] [2019-12-07 12:55:13,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:13,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:13,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255649543] [2019-12-07 12:55:13,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:13,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:13,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:13,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:13,202 INFO L87 Difference]: Start difference. First operand 62 states and 117 transitions. Second operand 3 states. [2019-12-07 12:55:13,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:13,223 INFO L93 Difference]: Finished difference Result 153 states and 288 transitions. [2019-12-07 12:55:13,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:13,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 12:55:13,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:13,224 INFO L225 Difference]: With dead ends: 153 [2019-12-07 12:55:13,224 INFO L226 Difference]: Without dead ends: 92 [2019-12-07 12:55:13,225 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 12:55:13,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-12-07 12:55:13,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2019-12-07 12:55:13,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-12-07 12:55:13,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 169 transitions. [2019-12-07 12:55:13,233 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 169 transitions. Word has length 20 [2019-12-07 12:55:13,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:13,233 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 169 transitions. [2019-12-07 12:55:13,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:13,233 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 169 transitions. [2019-12-07 12:55:13,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 12:55:13,234 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:13,234 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 12:55:13,234 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:13,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:13,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1323390526, now seen corresponding path program 1 times [2019-12-07 12:55:13,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:13,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692708311] [2019-12-07 12:55:13,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:13,266 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 12:55:13,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692708311] [2019-12-07 12:55:13,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:13,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:13,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947034607] [2019-12-07 12:55:13,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:13,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:13,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:13,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:13,267 INFO L87 Difference]: Start difference. First operand 90 states and 169 transitions. Second operand 3 states. [2019-12-07 12:55:13,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:13,280 INFO L93 Difference]: Finished difference Result 140 states and 257 transitions. [2019-12-07 12:55:13,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:13,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 12:55:13,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:13,281 INFO L225 Difference]: With dead ends: 140 [2019-12-07 12:55:13,281 INFO L226 Difference]: Without dead ends: 95 [2019-12-07 12:55:13,282 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 12:55:13,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-12-07 12:55:13,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2019-12-07 12:55:13,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-12-07 12:55:13,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 171 transitions. [2019-12-07 12:55:13,288 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 171 transitions. Word has length 21 [2019-12-07 12:55:13,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:13,288 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 171 transitions. [2019-12-07 12:55:13,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:13,288 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 171 transitions. [2019-12-07 12:55:13,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 12:55:13,289 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:13,289 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 12:55:13,289 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:13,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:13,289 INFO L82 PathProgramCache]: Analyzing trace with hash -670754180, now seen corresponding path program 1 times [2019-12-07 12:55:13,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:13,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865798678] [2019-12-07 12:55:13,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:13,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:13,311 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 12:55:13,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865798678] [2019-12-07 12:55:13,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:13,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:13,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254502522] [2019-12-07 12:55:13,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:13,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:13,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:13,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:13,313 INFO L87 Difference]: Start difference. First operand 93 states and 171 transitions. Second operand 3 states. [2019-12-07 12:55:13,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:13,324 INFO L93 Difference]: Finished difference Result 180 states and 332 transitions. [2019-12-07 12:55:13,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:13,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 12:55:13,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:13,326 INFO L225 Difference]: With dead ends: 180 [2019-12-07 12:55:13,326 INFO L226 Difference]: Without dead ends: 178 [2019-12-07 12:55:13,326 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 12:55:13,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-12-07 12:55:13,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 124. [2019-12-07 12:55:13,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-12-07 12:55:13,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 228 transitions. [2019-12-07 12:55:13,334 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 228 transitions. Word has length 21 [2019-12-07 12:55:13,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:13,334 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 228 transitions. [2019-12-07 12:55:13,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:13,334 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 228 transitions. [2019-12-07 12:55:13,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 12:55:13,335 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:13,335 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 12:55:13,335 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:13,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:13,335 INFO L82 PathProgramCache]: Analyzing trace with hash 2035865214, now seen corresponding path program 1 times [2019-12-07 12:55:13,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:13,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055309967] [2019-12-07 12:55:13,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:13,355 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 12:55:13,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055309967] [2019-12-07 12:55:13,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:13,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:13,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45656710] [2019-12-07 12:55:13,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:13,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:13,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:13,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:13,356 INFO L87 Difference]: Start difference. First operand 124 states and 228 transitions. Second operand 3 states. [2019-12-07 12:55:13,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:13,368 INFO L93 Difference]: Finished difference Result 300 states and 554 transitions. [2019-12-07 12:55:13,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:13,368 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 12:55:13,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:13,370 INFO L225 Difference]: With dead ends: 300 [2019-12-07 12:55:13,370 INFO L226 Difference]: Without dead ends: 180 [2019-12-07 12:55:13,370 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 12:55:13,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-12-07 12:55:13,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2019-12-07 12:55:13,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-12-07 12:55:13,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 326 transitions. [2019-12-07 12:55:13,379 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 326 transitions. Word has length 21 [2019-12-07 12:55:13,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:13,379 INFO L462 AbstractCegarLoop]: Abstraction has 178 states and 326 transitions. [2019-12-07 12:55:13,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:13,379 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 326 transitions. [2019-12-07 12:55:13,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 12:55:13,380 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:13,380 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 12:55:13,380 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:13,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:13,380 INFO L82 PathProgramCache]: Analyzing trace with hash 681669292, now seen corresponding path program 1 times [2019-12-07 12:55:13,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:13,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972510485] [2019-12-07 12:55:13,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:13,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:13,404 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 12:55:13,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972510485] [2019-12-07 12:55:13,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:13,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:13,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822093287] [2019-12-07 12:55:13,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:13,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:13,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:13,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:13,406 INFO L87 Difference]: Start difference. First operand 178 states and 326 transitions. Second operand 3 states. [2019-12-07 12:55:13,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:13,419 INFO L93 Difference]: Finished difference Result 269 states and 489 transitions. [2019-12-07 12:55:13,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:13,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-07 12:55:13,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:13,420 INFO L225 Difference]: With dead ends: 269 [2019-12-07 12:55:13,420 INFO L226 Difference]: Without dead ends: 182 [2019-12-07 12:55:13,421 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 12:55:13,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-12-07 12:55:13,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2019-12-07 12:55:13,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-12-07 12:55:13,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 326 transitions. [2019-12-07 12:55:13,430 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 326 transitions. Word has length 22 [2019-12-07 12:55:13,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:13,431 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 326 transitions. [2019-12-07 12:55:13,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:13,431 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 326 transitions. [2019-12-07 12:55:13,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 12:55:13,432 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:13,432 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 12:55:13,433 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:13,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:13,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1312475414, now seen corresponding path program 1 times [2019-12-07 12:55:13,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:13,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083469119] [2019-12-07 12:55:13,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:13,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:13,454 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 12:55:13,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083469119] [2019-12-07 12:55:13,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:13,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:13,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838450206] [2019-12-07 12:55:13,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:13,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:13,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:13,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:13,456 INFO L87 Difference]: Start difference. First operand 180 states and 326 transitions. Second operand 3 states. [2019-12-07 12:55:13,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:13,472 INFO L93 Difference]: Finished difference Result 524 states and 952 transitions. [2019-12-07 12:55:13,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:13,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-07 12:55:13,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:13,475 INFO L225 Difference]: With dead ends: 524 [2019-12-07 12:55:13,475 INFO L226 Difference]: Without dead ends: 350 [2019-12-07 12:55:13,476 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 12:55:13,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-12-07 12:55:13,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 348. [2019-12-07 12:55:13,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-12-07 12:55:13,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 626 transitions. [2019-12-07 12:55:13,488 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 626 transitions. Word has length 22 [2019-12-07 12:55:13,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:13,489 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 626 transitions. [2019-12-07 12:55:13,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:13,489 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 626 transitions. [2019-12-07 12:55:13,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 12:55:13,490 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:13,490 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 12:55:13,491 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:13,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:13,491 INFO L82 PathProgramCache]: Analyzing trace with hash 275872488, now seen corresponding path program 1 times [2019-12-07 12:55:13,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:13,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383879225] [2019-12-07 12:55:13,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:13,509 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 12:55:13,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383879225] [2019-12-07 12:55:13,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:13,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:13,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201554111] [2019-12-07 12:55:13,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:13,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:13,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:13,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:13,511 INFO L87 Difference]: Start difference. First operand 348 states and 626 transitions. Second operand 3 states. [2019-12-07 12:55:13,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:13,524 INFO L93 Difference]: Finished difference Result 448 states and 812 transitions. [2019-12-07 12:55:13,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:13,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-07 12:55:13,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:13,528 INFO L225 Difference]: With dead ends: 448 [2019-12-07 12:55:13,528 INFO L226 Difference]: Without dead ends: 446 [2019-12-07 12:55:13,528 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 12:55:13,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-12-07 12:55:13,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 348. [2019-12-07 12:55:13,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-12-07 12:55:13,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 622 transitions. [2019-12-07 12:55:13,538 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 622 transitions. Word has length 22 [2019-12-07 12:55:13,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:13,539 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 622 transitions. [2019-12-07 12:55:13,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:13,539 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 622 transitions. [2019-12-07 12:55:13,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 12:55:13,540 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:13,540 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 12:55:13,540 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:13,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:13,540 INFO L82 PathProgramCache]: Analyzing trace with hash -2031819437, now seen corresponding path program 1 times [2019-12-07 12:55:13,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:13,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820283347] [2019-12-07 12:55:13,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:13,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:13,559 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 12:55:13,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820283347] [2019-12-07 12:55:13,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:13,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:13,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157055094] [2019-12-07 12:55:13,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:13,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:13,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:13,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:13,560 INFO L87 Difference]: Start difference. First operand 348 states and 622 transitions. Second operand 3 states. [2019-12-07 12:55:13,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:13,577 INFO L93 Difference]: Finished difference Result 660 states and 1192 transitions. [2019-12-07 12:55:13,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:13,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-07 12:55:13,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:13,582 INFO L225 Difference]: With dead ends: 660 [2019-12-07 12:55:13,582 INFO L226 Difference]: Without dead ends: 658 [2019-12-07 12:55:13,582 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 12:55:13,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2019-12-07 12:55:13,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 480. [2019-12-07 12:55:13,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-12-07 12:55:13,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 846 transitions. [2019-12-07 12:55:13,596 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 846 transitions. Word has length 23 [2019-12-07 12:55:13,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:13,596 INFO L462 AbstractCegarLoop]: Abstraction has 480 states and 846 transitions. [2019-12-07 12:55:13,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:13,597 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 846 transitions. [2019-12-07 12:55:13,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 12:55:13,597 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:13,598 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 12:55:13,598 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:13,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:13,598 INFO L82 PathProgramCache]: Analyzing trace with hash 674799957, now seen corresponding path program 1 times [2019-12-07 12:55:13,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:13,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531294870] [2019-12-07 12:55:13,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:13,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:13,612 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 12:55:13,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531294870] [2019-12-07 12:55:13,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:13,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:13,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766280926] [2019-12-07 12:55:13,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:13,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:13,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:13,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:13,613 INFO L87 Difference]: Start difference. First operand 480 states and 846 transitions. Second operand 3 states. [2019-12-07 12:55:13,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:13,633 INFO L93 Difference]: Finished difference Result 1156 states and 2048 transitions. [2019-12-07 12:55:13,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:13,633 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-12-07 12:55:13,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:13,637 INFO L225 Difference]: With dead ends: 1156 [2019-12-07 12:55:13,637 INFO L226 Difference]: Without dead ends: 682 [2019-12-07 12:55:13,639 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 12:55:13,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-12-07 12:55:13,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 680. [2019-12-07 12:55:13,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2019-12-07 12:55:13,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1194 transitions. [2019-12-07 12:55:13,657 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1194 transitions. Word has length 23 [2019-12-07 12:55:13,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:13,657 INFO L462 AbstractCegarLoop]: Abstraction has 680 states and 1194 transitions. [2019-12-07 12:55:13,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:13,657 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1194 transitions. [2019-12-07 12:55:13,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 12:55:13,658 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:13,658 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 12:55:13,658 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:13,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:13,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1438319967, now seen corresponding path program 1 times [2019-12-07 12:55:13,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:13,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908514488] [2019-12-07 12:55:13,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:13,671 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 12:55:13,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908514488] [2019-12-07 12:55:13,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:13,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:13,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515194329] [2019-12-07 12:55:13,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:13,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:13,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:13,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:13,672 INFO L87 Difference]: Start difference. First operand 680 states and 1194 transitions. Second operand 3 states. [2019-12-07 12:55:13,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:13,686 INFO L93 Difference]: Finished difference Result 1028 states and 1800 transitions. [2019-12-07 12:55:13,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:13,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-12-07 12:55:13,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:13,689 INFO L225 Difference]: With dead ends: 1028 [2019-12-07 12:55:13,689 INFO L226 Difference]: Without dead ends: 694 [2019-12-07 12:55:13,690 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 12:55:13,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2019-12-07 12:55:13,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 692. [2019-12-07 12:55:13,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2019-12-07 12:55:13,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1202 transitions. [2019-12-07 12:55:13,702 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1202 transitions. Word has length 24 [2019-12-07 12:55:13,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:13,702 INFO L462 AbstractCegarLoop]: Abstraction has 692 states and 1202 transitions. [2019-12-07 12:55:13,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:13,702 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1202 transitions. [2019-12-07 12:55:13,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 12:55:13,703 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:13,703 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 12:55:13,703 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:13,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:13,703 INFO L82 PathProgramCache]: Analyzing trace with hash -555824739, now seen corresponding path program 1 times [2019-12-07 12:55:13,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:13,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520312770] [2019-12-07 12:55:13,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:13,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:13,716 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 12:55:13,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520312770] [2019-12-07 12:55:13,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:13,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:13,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795600322] [2019-12-07 12:55:13,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:13,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:13,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:13,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:13,717 INFO L87 Difference]: Start difference. First operand 692 states and 1202 transitions. Second operand 3 states. [2019-12-07 12:55:13,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:13,739 INFO L93 Difference]: Finished difference Result 1288 states and 2268 transitions. [2019-12-07 12:55:13,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:13,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-12-07 12:55:13,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:13,745 INFO L225 Difference]: With dead ends: 1288 [2019-12-07 12:55:13,746 INFO L226 Difference]: Without dead ends: 1286 [2019-12-07 12:55:13,746 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 12:55:13,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2019-12-07 12:55:13,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 964. [2019-12-07 12:55:13,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 964 states. [2019-12-07 12:55:13,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1642 transitions. [2019-12-07 12:55:13,769 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1642 transitions. Word has length 24 [2019-12-07 12:55:13,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:13,769 INFO L462 AbstractCegarLoop]: Abstraction has 964 states and 1642 transitions. [2019-12-07 12:55:13,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:13,769 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1642 transitions. [2019-12-07 12:55:13,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 12:55:13,770 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:13,771 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 12:55:13,771 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:13,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:13,771 INFO L82 PathProgramCache]: Analyzing trace with hash -2144172641, now seen corresponding path program 1 times [2019-12-07 12:55:13,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:13,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973819244] [2019-12-07 12:55:13,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:13,788 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 12:55:13,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973819244] [2019-12-07 12:55:13,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:13,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:13,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661865307] [2019-12-07 12:55:13,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:13,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:13,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:13,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:13,790 INFO L87 Difference]: Start difference. First operand 964 states and 1642 transitions. Second operand 3 states. [2019-12-07 12:55:13,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:13,817 INFO L93 Difference]: Finished difference Result 2296 states and 3932 transitions. [2019-12-07 12:55:13,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:13,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-12-07 12:55:13,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:13,825 INFO L225 Difference]: With dead ends: 2296 [2019-12-07 12:55:13,825 INFO L226 Difference]: Without dead ends: 1350 [2019-12-07 12:55:13,827 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 12:55:13,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2019-12-07 12:55:13,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1348. [2019-12-07 12:55:13,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1348 states. [2019-12-07 12:55:13,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 2290 transitions. [2019-12-07 12:55:13,865 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 2290 transitions. Word has length 24 [2019-12-07 12:55:13,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:13,865 INFO L462 AbstractCegarLoop]: Abstraction has 1348 states and 2290 transitions. [2019-12-07 12:55:13,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:13,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 2290 transitions. [2019-12-07 12:55:13,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 12:55:13,867 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:13,867 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 12:55:13,867 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:13,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:13,868 INFO L82 PathProgramCache]: Analyzing trace with hash -50484310, now seen corresponding path program 1 times [2019-12-07 12:55:13,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:13,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43749025] [2019-12-07 12:55:13,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:13,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:13,884 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 12:55:13,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43749025] [2019-12-07 12:55:13,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:13,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:13,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286162171] [2019-12-07 12:55:13,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:13,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:13,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:13,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:13,886 INFO L87 Difference]: Start difference. First operand 1348 states and 2290 transitions. Second operand 3 states. [2019-12-07 12:55:13,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:13,906 INFO L93 Difference]: Finished difference Result 2024 states and 3428 transitions. [2019-12-07 12:55:13,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:13,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-07 12:55:13,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:13,912 INFO L225 Difference]: With dead ends: 2024 [2019-12-07 12:55:13,912 INFO L226 Difference]: Without dead ends: 1366 [2019-12-07 12:55:13,913 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 12:55:13,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2019-12-07 12:55:13,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1364. [2019-12-07 12:55:13,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1364 states. [2019-12-07 12:55:13,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 2290 transitions. [2019-12-07 12:55:13,943 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 2290 transitions. Word has length 25 [2019-12-07 12:55:13,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:13,943 INFO L462 AbstractCegarLoop]: Abstraction has 1364 states and 2290 transitions. [2019-12-07 12:55:13,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:13,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 2290 transitions. [2019-12-07 12:55:13,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 12:55:13,944 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:13,944 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 12:55:13,945 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:13,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:13,945 INFO L82 PathProgramCache]: Analyzing trace with hash -2044629016, now seen corresponding path program 1 times [2019-12-07 12:55:13,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:13,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232254975] [2019-12-07 12:55:13,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:13,963 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 12:55:13,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232254975] [2019-12-07 12:55:13,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:13,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:13,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781128737] [2019-12-07 12:55:13,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:13,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:13,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:13,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:13,965 INFO L87 Difference]: Start difference. First operand 1364 states and 2290 transitions. Second operand 3 states. [2019-12-07 12:55:14,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:14,001 INFO L93 Difference]: Finished difference Result 2504 states and 4276 transitions. [2019-12-07 12:55:14,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:14,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-07 12:55:14,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:14,015 INFO L225 Difference]: With dead ends: 2504 [2019-12-07 12:55:14,015 INFO L226 Difference]: Without dead ends: 2502 [2019-12-07 12:55:14,016 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 12:55:14,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2502 states. [2019-12-07 12:55:14,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2502 to 1924. [2019-12-07 12:55:14,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1924 states. [2019-12-07 12:55:14,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 3154 transitions. [2019-12-07 12:55:14,074 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 3154 transitions. Word has length 25 [2019-12-07 12:55:14,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:14,075 INFO L462 AbstractCegarLoop]: Abstraction has 1924 states and 3154 transitions. [2019-12-07 12:55:14,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:14,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 3154 transitions. [2019-12-07 12:55:14,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 12:55:14,076 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:14,076 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 12:55:14,077 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:14,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:14,077 INFO L82 PathProgramCache]: Analyzing trace with hash 661990378, now seen corresponding path program 1 times [2019-12-07 12:55:14,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:14,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588250034] [2019-12-07 12:55:14,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:14,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:14,089 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 12:55:14,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588250034] [2019-12-07 12:55:14,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:14,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:14,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821441751] [2019-12-07 12:55:14,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:14,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:14,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:14,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:14,090 INFO L87 Difference]: Start difference. First operand 1924 states and 3154 transitions. Second operand 3 states. [2019-12-07 12:55:14,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:14,120 INFO L93 Difference]: Finished difference Result 4552 states and 7508 transitions. [2019-12-07 12:55:14,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:14,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-07 12:55:14,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:14,131 INFO L225 Difference]: With dead ends: 4552 [2019-12-07 12:55:14,131 INFO L226 Difference]: Without dead ends: 2662 [2019-12-07 12:55:14,133 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 12:55:14,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2662 states. [2019-12-07 12:55:14,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2662 to 2660. [2019-12-07 12:55:14,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2660 states. [2019-12-07 12:55:14,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2660 states to 2660 states and 4354 transitions. [2019-12-07 12:55:14,180 INFO L78 Accepts]: Start accepts. Automaton has 2660 states and 4354 transitions. Word has length 25 [2019-12-07 12:55:14,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:14,180 INFO L462 AbstractCegarLoop]: Abstraction has 2660 states and 4354 transitions. [2019-12-07 12:55:14,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:14,181 INFO L276 IsEmpty]: Start isEmpty. Operand 2660 states and 4354 transitions. [2019-12-07 12:55:14,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 12:55:14,182 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:14,182 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 12:55:14,183 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:14,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:14,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1041223700, now seen corresponding path program 1 times [2019-12-07 12:55:14,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:14,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396250444] [2019-12-07 12:55:14,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:14,194 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 12:55:14,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396250444] [2019-12-07 12:55:14,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:14,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:14,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360124641] [2019-12-07 12:55:14,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:14,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:14,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:14,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:14,195 INFO L87 Difference]: Start difference. First operand 2660 states and 4354 transitions. Second operand 3 states. [2019-12-07 12:55:14,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:14,226 INFO L93 Difference]: Finished difference Result 3992 states and 6516 transitions. [2019-12-07 12:55:14,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:14,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-07 12:55:14,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:14,236 INFO L225 Difference]: With dead ends: 3992 [2019-12-07 12:55:14,236 INFO L226 Difference]: Without dead ends: 2694 [2019-12-07 12:55:14,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 12:55:14,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2694 states. [2019-12-07 12:55:14,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2694 to 2692. [2019-12-07 12:55:14,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2692 states. [2019-12-07 12:55:14,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2692 states to 2692 states and 4354 transitions. [2019-12-07 12:55:14,287 INFO L78 Accepts]: Start accepts. Automaton has 2692 states and 4354 transitions. Word has length 26 [2019-12-07 12:55:14,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:14,287 INFO L462 AbstractCegarLoop]: Abstraction has 2692 states and 4354 transitions. [2019-12-07 12:55:14,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:14,287 INFO L276 IsEmpty]: Start isEmpty. Operand 2692 states and 4354 transitions. [2019-12-07 12:55:14,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 12:55:14,289 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:14,289 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 12:55:14,290 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:14,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:14,290 INFO L82 PathProgramCache]: Analyzing trace with hash -952921006, now seen corresponding path program 1 times [2019-12-07 12:55:14,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:14,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202959302] [2019-12-07 12:55:14,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:14,301 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 12:55:14,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202959302] [2019-12-07 12:55:14,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:14,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:14,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956638188] [2019-12-07 12:55:14,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:14,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:14,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:14,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:14,302 INFO L87 Difference]: Start difference. First operand 2692 states and 4354 transitions. Second operand 3 states. [2019-12-07 12:55:14,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:14,342 INFO L93 Difference]: Finished difference Result 4872 states and 8036 transitions. [2019-12-07 12:55:14,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:14,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-07 12:55:14,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:14,361 INFO L225 Difference]: With dead ends: 4872 [2019-12-07 12:55:14,362 INFO L226 Difference]: Without dead ends: 4870 [2019-12-07 12:55:14,363 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 12:55:14,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4870 states. [2019-12-07 12:55:14,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4870 to 3844. [2019-12-07 12:55:14,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3844 states. [2019-12-07 12:55:14,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3844 states to 3844 states and 6050 transitions. [2019-12-07 12:55:14,442 INFO L78 Accepts]: Start accepts. Automaton has 3844 states and 6050 transitions. Word has length 26 [2019-12-07 12:55:14,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:14,442 INFO L462 AbstractCegarLoop]: Abstraction has 3844 states and 6050 transitions. [2019-12-07 12:55:14,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:14,442 INFO L276 IsEmpty]: Start isEmpty. Operand 3844 states and 6050 transitions. [2019-12-07 12:55:14,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 12:55:14,446 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:14,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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:55:14,446 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:14,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:14,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1753698388, now seen corresponding path program 1 times [2019-12-07 12:55:14,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:14,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538307551] [2019-12-07 12:55:14,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:14,458 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 12:55:14,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538307551] [2019-12-07 12:55:14,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:14,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:14,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605753971] [2019-12-07 12:55:14,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:14,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:14,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:14,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:14,459 INFO L87 Difference]: Start difference. First operand 3844 states and 6050 transitions. Second operand 3 states. [2019-12-07 12:55:14,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:14,515 INFO L93 Difference]: Finished difference Result 9032 states and 14308 transitions. [2019-12-07 12:55:14,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:14,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-07 12:55:14,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:14,535 INFO L225 Difference]: With dead ends: 9032 [2019-12-07 12:55:14,535 INFO L226 Difference]: Without dead ends: 5254 [2019-12-07 12:55:14,539 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 12:55:14,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5254 states. [2019-12-07 12:55:14,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5254 to 5252. [2019-12-07 12:55:14,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5252 states. [2019-12-07 12:55:14,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5252 states to 5252 states and 8258 transitions. [2019-12-07 12:55:14,633 INFO L78 Accepts]: Start accepts. Automaton has 5252 states and 8258 transitions. Word has length 26 [2019-12-07 12:55:14,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:14,633 INFO L462 AbstractCegarLoop]: Abstraction has 5252 states and 8258 transitions. [2019-12-07 12:55:14,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:14,633 INFO L276 IsEmpty]: Start isEmpty. Operand 5252 states and 8258 transitions. [2019-12-07 12:55:14,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 12:55:14,636 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:14,637 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 12:55:14,637 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:14,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:14,637 INFO L82 PathProgramCache]: Analyzing trace with hash 524433983, now seen corresponding path program 1 times [2019-12-07 12:55:14,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:14,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711882030] [2019-12-07 12:55:14,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:14,648 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 12:55:14,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711882030] [2019-12-07 12:55:14,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:14,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:14,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583854608] [2019-12-07 12:55:14,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:14,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:14,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:14,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:14,649 INFO L87 Difference]: Start difference. First operand 5252 states and 8258 transitions. Second operand 3 states. [2019-12-07 12:55:14,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:14,702 INFO L93 Difference]: Finished difference Result 7880 states and 12356 transitions. [2019-12-07 12:55:14,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:14,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 12:55:14,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:14,709 INFO L225 Difference]: With dead ends: 7880 [2019-12-07 12:55:14,709 INFO L226 Difference]: Without dead ends: 5318 [2019-12-07 12:55:14,711 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 12:55:14,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5318 states. [2019-12-07 12:55:14,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5318 to 5316. [2019-12-07 12:55:14,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5316 states. [2019-12-07 12:55:14,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5316 states to 5316 states and 8258 transitions. [2019-12-07 12:55:14,789 INFO L78 Accepts]: Start accepts. Automaton has 5316 states and 8258 transitions. Word has length 27 [2019-12-07 12:55:14,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:14,789 INFO L462 AbstractCegarLoop]: Abstraction has 5316 states and 8258 transitions. [2019-12-07 12:55:14,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:14,789 INFO L276 IsEmpty]: Start isEmpty. Operand 5316 states and 8258 transitions. [2019-12-07 12:55:14,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 12:55:14,792 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:14,793 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 12:55:14,793 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:14,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:14,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1469710723, now seen corresponding path program 1 times [2019-12-07 12:55:14,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:14,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304809468] [2019-12-07 12:55:14,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:14,805 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 12:55:14,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304809468] [2019-12-07 12:55:14,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:14,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:14,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761966542] [2019-12-07 12:55:14,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:14,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:14,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:14,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:14,806 INFO L87 Difference]: Start difference. First operand 5316 states and 8258 transitions. Second operand 3 states. [2019-12-07 12:55:14,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:14,862 INFO L93 Difference]: Finished difference Result 9480 states and 15044 transitions. [2019-12-07 12:55:14,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:14,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 12:55:14,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:14,874 INFO L225 Difference]: With dead ends: 9480 [2019-12-07 12:55:14,874 INFO L226 Difference]: Without dead ends: 9478 [2019-12-07 12:55:14,876 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 12:55:14,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9478 states. [2019-12-07 12:55:14,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9478 to 7684. [2019-12-07 12:55:14,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7684 states. [2019-12-07 12:55:14,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7684 states to 7684 states and 11586 transitions. [2019-12-07 12:55:14,987 INFO L78 Accepts]: Start accepts. Automaton has 7684 states and 11586 transitions. Word has length 27 [2019-12-07 12:55:14,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:14,987 INFO L462 AbstractCegarLoop]: Abstraction has 7684 states and 11586 transitions. [2019-12-07 12:55:14,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:14,987 INFO L276 IsEmpty]: Start isEmpty. Operand 7684 states and 11586 transitions. [2019-12-07 12:55:14,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 12:55:14,994 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:14,994 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 12:55:14,994 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:14,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:14,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1236908671, now seen corresponding path program 1 times [2019-12-07 12:55:14,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:14,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603179621] [2019-12-07 12:55:14,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:15,006 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 12:55:15,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603179621] [2019-12-07 12:55:15,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:15,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:15,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683278660] [2019-12-07 12:55:15,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:15,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:15,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:15,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:15,007 INFO L87 Difference]: Start difference. First operand 7684 states and 11586 transitions. Second operand 3 states. [2019-12-07 12:55:15,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:15,109 INFO L93 Difference]: Finished difference Result 17928 states and 27204 transitions. [2019-12-07 12:55:15,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:15,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 12:55:15,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:15,122 INFO L225 Difference]: With dead ends: 17928 [2019-12-07 12:55:15,122 INFO L226 Difference]: Without dead ends: 10374 [2019-12-07 12:55:15,129 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 12:55:15,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10374 states. [2019-12-07 12:55:15,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10374 to 10372. [2019-12-07 12:55:15,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10372 states. [2019-12-07 12:55:15,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10372 states to 10372 states and 15618 transitions. [2019-12-07 12:55:15,268 INFO L78 Accepts]: Start accepts. Automaton has 10372 states and 15618 transitions. Word has length 27 [2019-12-07 12:55:15,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:15,268 INFO L462 AbstractCegarLoop]: Abstraction has 10372 states and 15618 transitions. [2019-12-07 12:55:15,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:15,268 INFO L276 IsEmpty]: Start isEmpty. Operand 10372 states and 15618 transitions. [2019-12-07 12:55:15,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 12:55:15,305 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:15,305 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 12:55:15,306 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:15,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:15,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1683822281, now seen corresponding path program 1 times [2019-12-07 12:55:15,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:15,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112251368] [2019-12-07 12:55:15,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:15,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:15,318 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 12:55:15,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112251368] [2019-12-07 12:55:15,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:15,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:15,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436371578] [2019-12-07 12:55:15,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:15,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:15,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:15,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:15,319 INFO L87 Difference]: Start difference. First operand 10372 states and 15618 transitions. Second operand 3 states. [2019-12-07 12:55:15,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:15,408 INFO L93 Difference]: Finished difference Result 15560 states and 23364 transitions. [2019-12-07 12:55:15,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:15,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-07 12:55:15,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:15,424 INFO L225 Difference]: With dead ends: 15560 [2019-12-07 12:55:15,425 INFO L226 Difference]: Without dead ends: 10502 [2019-12-07 12:55:15,431 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 12:55:15,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10502 states. [2019-12-07 12:55:15,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10502 to 10500. [2019-12-07 12:55:15,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10500 states. [2019-12-07 12:55:15,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10500 states to 10500 states and 15618 transitions. [2019-12-07 12:55:15,547 INFO L78 Accepts]: Start accepts. Automaton has 10500 states and 15618 transitions. Word has length 28 [2019-12-07 12:55:15,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:15,548 INFO L462 AbstractCegarLoop]: Abstraction has 10500 states and 15618 transitions. [2019-12-07 12:55:15,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:15,548 INFO L276 IsEmpty]: Start isEmpty. Operand 10500 states and 15618 transitions. [2019-12-07 12:55:15,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 12:55:15,554 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:15,554 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 12:55:15,554 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:15,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:15,555 INFO L82 PathProgramCache]: Analyzing trace with hash -310322425, now seen corresponding path program 1 times [2019-12-07 12:55:15,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:15,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950921692] [2019-12-07 12:55:15,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:15,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:15,565 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 12:55:15,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950921692] [2019-12-07 12:55:15,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:15,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:15,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499765588] [2019-12-07 12:55:15,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:15,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:15,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:15,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:15,566 INFO L87 Difference]: Start difference. First operand 10500 states and 15618 transitions. Second operand 3 states. [2019-12-07 12:55:15,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:15,660 INFO L93 Difference]: Finished difference Result 18440 states and 28036 transitions. [2019-12-07 12:55:15,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:15,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-07 12:55:15,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:15,683 INFO L225 Difference]: With dead ends: 18440 [2019-12-07 12:55:15,683 INFO L226 Difference]: Without dead ends: 18438 [2019-12-07 12:55:15,688 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 12:55:15,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18438 states. [2019-12-07 12:55:15,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18438 to 15364. [2019-12-07 12:55:15,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15364 states. [2019-12-07 12:55:15,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15364 states to 15364 states and 22146 transitions. [2019-12-07 12:55:15,886 INFO L78 Accepts]: Start accepts. Automaton has 15364 states and 22146 transitions. Word has length 28 [2019-12-07 12:55:15,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:15,887 INFO L462 AbstractCegarLoop]: Abstraction has 15364 states and 22146 transitions. [2019-12-07 12:55:15,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:15,887 INFO L276 IsEmpty]: Start isEmpty. Operand 15364 states and 22146 transitions. [2019-12-07 12:55:15,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 12:55:15,900 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:15,900 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 12:55:15,900 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:15,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:15,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1898670327, now seen corresponding path program 1 times [2019-12-07 12:55:15,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:15,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333143177] [2019-12-07 12:55:15,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:15,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 12:55:15,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333143177] [2019-12-07 12:55:15,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:15,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:15,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326061692] [2019-12-07 12:55:15,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:15,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:15,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:15,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:15,911 INFO L87 Difference]: Start difference. First operand 15364 states and 22146 transitions. Second operand 3 states. [2019-12-07 12:55:16,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:16,027 INFO L93 Difference]: Finished difference Result 35592 states and 51588 transitions. [2019-12-07 12:55:16,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:16,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-07 12:55:16,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:16,047 INFO L225 Difference]: With dead ends: 35592 [2019-12-07 12:55:16,047 INFO L226 Difference]: Without dead ends: 20486 [2019-12-07 12:55:16,058 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 12:55:16,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20486 states. [2019-12-07 12:55:16,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20486 to 20484. [2019-12-07 12:55:16,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20484 states. [2019-12-07 12:55:16,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20484 states to 20484 states and 29442 transitions. [2019-12-07 12:55:16,286 INFO L78 Accepts]: Start accepts. Automaton has 20484 states and 29442 transitions. Word has length 28 [2019-12-07 12:55:16,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:16,286 INFO L462 AbstractCegarLoop]: Abstraction has 20484 states and 29442 transitions. [2019-12-07 12:55:16,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:16,286 INFO L276 IsEmpty]: Start isEmpty. Operand 20484 states and 29442 transitions. [2019-12-07 12:55:16,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 12:55:16,298 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:16,298 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 12:55:16,298 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:16,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:16,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1029845804, now seen corresponding path program 1 times [2019-12-07 12:55:16,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:16,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690214654] [2019-12-07 12:55:16,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:16,312 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 12:55:16,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690214654] [2019-12-07 12:55:16,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:16,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:16,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550749487] [2019-12-07 12:55:16,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:16,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:16,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:16,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:16,313 INFO L87 Difference]: Start difference. First operand 20484 states and 29442 transitions. Second operand 3 states. [2019-12-07 12:55:16,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:16,445 INFO L93 Difference]: Finished difference Result 30728 states and 44036 transitions. [2019-12-07 12:55:16,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:16,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 12:55:16,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:16,468 INFO L225 Difference]: With dead ends: 30728 [2019-12-07 12:55:16,468 INFO L226 Difference]: Without dead ends: 20742 [2019-12-07 12:55:16,514 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 12:55:16,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20742 states. [2019-12-07 12:55:16,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20742 to 20740. [2019-12-07 12:55:16,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20740 states. [2019-12-07 12:55:16,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20740 states to 20740 states and 29442 transitions. [2019-12-07 12:55:16,715 INFO L78 Accepts]: Start accepts. Automaton has 20740 states and 29442 transitions. Word has length 29 [2019-12-07 12:55:16,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:16,715 INFO L462 AbstractCegarLoop]: Abstraction has 20740 states and 29442 transitions. [2019-12-07 12:55:16,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:16,715 INFO L276 IsEmpty]: Start isEmpty. Operand 20740 states and 29442 transitions. [2019-12-07 12:55:16,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 12:55:16,725 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:16,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, 1, 1, 1, 1] [2019-12-07 12:55:16,725 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:16,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:16,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1270976786, now seen corresponding path program 1 times [2019-12-07 12:55:16,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:16,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649774230] [2019-12-07 12:55:16,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:16,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:16,737 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 12:55:16,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649774230] [2019-12-07 12:55:16,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:16,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:16,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388818148] [2019-12-07 12:55:16,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:16,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:16,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:16,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:16,738 INFO L87 Difference]: Start difference. First operand 20740 states and 29442 transitions. Second operand 3 states. [2019-12-07 12:55:16,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:16,878 INFO L93 Difference]: Finished difference Result 35848 states and 51972 transitions. [2019-12-07 12:55:16,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:16,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 12:55:16,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:16,908 INFO L225 Difference]: With dead ends: 35848 [2019-12-07 12:55:16,908 INFO L226 Difference]: Without dead ends: 35846 [2019-12-07 12:55:16,914 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 12:55:16,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35846 states. [2019-12-07 12:55:17,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35846 to 30724. [2019-12-07 12:55:17,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30724 states. [2019-12-07 12:55:17,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30724 states to 30724 states and 42242 transitions. [2019-12-07 12:55:17,273 INFO L78 Accepts]: Start accepts. Automaton has 30724 states and 42242 transitions. Word has length 29 [2019-12-07 12:55:17,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:17,274 INFO L462 AbstractCegarLoop]: Abstraction has 30724 states and 42242 transitions. [2019-12-07 12:55:17,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:17,274 INFO L276 IsEmpty]: Start isEmpty. Operand 30724 states and 42242 transitions. [2019-12-07 12:55:17,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 12:55:17,289 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:17,289 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 12:55:17,289 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:17,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:17,289 INFO L82 PathProgramCache]: Analyzing trace with hash -317371116, now seen corresponding path program 1 times [2019-12-07 12:55:17,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:17,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776271600] [2019-12-07 12:55:17,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:17,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:17,300 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 12:55:17,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776271600] [2019-12-07 12:55:17,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:17,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:17,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892220374] [2019-12-07 12:55:17,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:17,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:17,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:17,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:17,301 INFO L87 Difference]: Start difference. First operand 30724 states and 42242 transitions. Second operand 3 states. [2019-12-07 12:55:17,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:17,511 INFO L93 Difference]: Finished difference Result 70664 states and 97540 transitions. [2019-12-07 12:55:17,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:17,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 12:55:17,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:17,539 INFO L225 Difference]: With dead ends: 70664 [2019-12-07 12:55:17,540 INFO L226 Difference]: Without dead ends: 40454 [2019-12-07 12:55:17,557 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 12:55:17,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40454 states. [2019-12-07 12:55:18,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40454 to 40452. [2019-12-07 12:55:18,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40452 states. [2019-12-07 12:55:18,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40452 states to 40452 states and 55298 transitions. [2019-12-07 12:55:18,057 INFO L78 Accepts]: Start accepts. Automaton has 40452 states and 55298 transitions. Word has length 29 [2019-12-07 12:55:18,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:18,058 INFO L462 AbstractCegarLoop]: Abstraction has 40452 states and 55298 transitions. [2019-12-07 12:55:18,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:18,058 INFO L276 IsEmpty]: Start isEmpty. Operand 40452 states and 55298 transitions. [2019-12-07 12:55:18,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 12:55:18,069 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:18,069 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 12:55:18,069 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:18,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:18,069 INFO L82 PathProgramCache]: Analyzing trace with hash 745789822, now seen corresponding path program 1 times [2019-12-07 12:55:18,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:18,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160210819] [2019-12-07 12:55:18,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:18,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:18,080 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 12:55:18,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160210819] [2019-12-07 12:55:18,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:18,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:18,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721243256] [2019-12-07 12:55:18,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:18,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:18,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:18,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:18,081 INFO L87 Difference]: Start difference. First operand 40452 states and 55298 transitions. Second operand 3 states. [2019-12-07 12:55:18,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:18,274 INFO L93 Difference]: Finished difference Result 60680 states and 82692 transitions. [2019-12-07 12:55:18,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:18,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-07 12:55:18,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:18,303 INFO L225 Difference]: With dead ends: 60680 [2019-12-07 12:55:18,303 INFO L226 Difference]: Without dead ends: 40966 [2019-12-07 12:55:18,314 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 12:55:18,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40966 states. [2019-12-07 12:55:18,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40966 to 40964. [2019-12-07 12:55:18,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40964 states. [2019-12-07 12:55:18,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40964 states to 40964 states and 55298 transitions. [2019-12-07 12:55:18,817 INFO L78 Accepts]: Start accepts. Automaton has 40964 states and 55298 transitions. Word has length 30 [2019-12-07 12:55:18,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:18,817 INFO L462 AbstractCegarLoop]: Abstraction has 40964 states and 55298 transitions. [2019-12-07 12:55:18,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:18,817 INFO L276 IsEmpty]: Start isEmpty. Operand 40964 states and 55298 transitions. [2019-12-07 12:55:18,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 12:55:18,829 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:18,829 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 12:55:18,830 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:18,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:18,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1248354884, now seen corresponding path program 1 times [2019-12-07 12:55:18,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:18,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173439375] [2019-12-07 12:55:18,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:18,842 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 12:55:18,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173439375] [2019-12-07 12:55:18,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:18,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:18,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725580551] [2019-12-07 12:55:18,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:18,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:18,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:18,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:18,843 INFO L87 Difference]: Start difference. First operand 40964 states and 55298 transitions. Second operand 3 states. [2019-12-07 12:55:19,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:19,238 INFO L93 Difference]: Finished difference Result 119816 states and 159748 transitions. [2019-12-07 12:55:19,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:19,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-07 12:55:19,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:19,305 INFO L225 Difference]: With dead ends: 119816 [2019-12-07 12:55:19,305 INFO L226 Difference]: Without dead ends: 79878 [2019-12-07 12:55:19,330 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 12:55:19,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79878 states. [2019-12-07 12:55:20,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79878 to 79876. [2019-12-07 12:55:20,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79876 states. [2019-12-07 12:55:20,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79876 states to 79876 states and 104450 transitions. [2019-12-07 12:55:20,279 INFO L78 Accepts]: Start accepts. Automaton has 79876 states and 104450 transitions. Word has length 30 [2019-12-07 12:55:20,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:20,279 INFO L462 AbstractCegarLoop]: Abstraction has 79876 states and 104450 transitions. [2019-12-07 12:55:20,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:20,279 INFO L276 IsEmpty]: Start isEmpty. Operand 79876 states and 104450 transitions. [2019-12-07 12:55:20,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 12:55:20,312 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:20,312 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 12:55:20,312 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:20,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:20,312 INFO L82 PathProgramCache]: Analyzing trace with hash 339993018, now seen corresponding path program 1 times [2019-12-07 12:55:20,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:20,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264640811] [2019-12-07 12:55:20,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:20,324 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 12:55:20,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264640811] [2019-12-07 12:55:20,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:20,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:20,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307682042] [2019-12-07 12:55:20,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:20,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:20,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:20,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:20,325 INFO L87 Difference]: Start difference. First operand 79876 states and 104450 transitions. Second operand 3 states. [2019-12-07 12:55:20,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:20,757 INFO L93 Difference]: Finished difference Result 88072 states and 118788 transitions. [2019-12-07 12:55:20,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:20,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-07 12:55:20,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:20,821 INFO L225 Difference]: With dead ends: 88072 [2019-12-07 12:55:20,821 INFO L226 Difference]: Without dead ends: 88070 [2019-12-07 12:55:20,835 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 12:55:20,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88070 states. [2019-12-07 12:55:21,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88070 to 79876. [2019-12-07 12:55:21,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79876 states. [2019-12-07 12:55:21,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79876 states to 79876 states and 103426 transitions. [2019-12-07 12:55:21,791 INFO L78 Accepts]: Start accepts. Automaton has 79876 states and 103426 transitions. Word has length 30 [2019-12-07 12:55:21,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:21,792 INFO L462 AbstractCegarLoop]: Abstraction has 79876 states and 103426 transitions. [2019-12-07 12:55:21,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:21,792 INFO L276 IsEmpty]: Start isEmpty. Operand 79876 states and 103426 transitions. [2019-12-07 12:55:21,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 12:55:21,817 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:21,817 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 12:55:21,817 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:21,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:21,817 INFO L82 PathProgramCache]: Analyzing trace with hash -44080279, now seen corresponding path program 1 times [2019-12-07 12:55:21,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:21,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771712928] [2019-12-07 12:55:21,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:21,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:21,831 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 12:55:21,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771712928] [2019-12-07 12:55:21,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:21,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:21,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184170847] [2019-12-07 12:55:21,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:21,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:21,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:21,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:21,832 INFO L87 Difference]: Start difference. First operand 79876 states and 103426 transitions. Second operand 3 states. [2019-12-07 12:55:22,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:22,589 INFO L93 Difference]: Finished difference Result 134152 states and 176132 transitions. [2019-12-07 12:55:22,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:22,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-07 12:55:22,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:22,686 INFO L225 Difference]: With dead ends: 134152 [2019-12-07 12:55:22,686 INFO L226 Difference]: Without dead ends: 134150 [2019-12-07 12:55:22,697 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 12:55:22,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134150 states. [2019-12-07 12:55:23,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134150 to 121860. [2019-12-07 12:55:23,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121860 states. [2019-12-07 12:55:24,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121860 states to 121860 states and 153602 transitions. [2019-12-07 12:55:24,924 INFO L78 Accepts]: Start accepts. Automaton has 121860 states and 153602 transitions. Word has length 31 [2019-12-07 12:55:24,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:24,924 INFO L462 AbstractCegarLoop]: Abstraction has 121860 states and 153602 transitions. [2019-12-07 12:55:24,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:24,924 INFO L276 IsEmpty]: Start isEmpty. Operand 121860 states and 153602 transitions. [2019-12-07 12:55:24,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 12:55:24,973 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:24,973 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 12:55:24,973 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:24,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:24,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1632428181, now seen corresponding path program 1 times [2019-12-07 12:55:24,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:24,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683916037] [2019-12-07 12:55:24,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:24,989 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 12:55:24,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683916037] [2019-12-07 12:55:24,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:24,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:24,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365028274] [2019-12-07 12:55:24,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:24,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:24,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:24,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:24,991 INFO L87 Difference]: Start difference. First operand 121860 states and 153602 transitions. Second operand 3 states. [2019-12-07 12:55:25,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:25,843 INFO L93 Difference]: Finished difference Result 277512 states and 350212 transitions. [2019-12-07 12:55:25,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:25,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-07 12:55:25,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:25,963 INFO L225 Difference]: With dead ends: 277512 [2019-12-07 12:55:25,963 INFO L226 Difference]: Without dead ends: 156678 [2019-12-07 12:55:26,013 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 12:55:26,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156678 states. [2019-12-07 12:55:27,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156678 to 156676. [2019-12-07 12:55:27,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156676 states. [2019-12-07 12:55:27,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156676 states to 156676 states and 194562 transitions. [2019-12-07 12:55:27,704 INFO L78 Accepts]: Start accepts. Automaton has 156676 states and 194562 transitions. Word has length 31 [2019-12-07 12:55:27,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:27,704 INFO L462 AbstractCegarLoop]: Abstraction has 156676 states and 194562 transitions. [2019-12-07 12:55:27,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:27,704 INFO L276 IsEmpty]: Start isEmpty. Operand 156676 states and 194562 transitions. [2019-12-07 12:55:27,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 12:55:27,761 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:27,761 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:55:27,761 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:27,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:27,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1366272847, now seen corresponding path program 1 times [2019-12-07 12:55:27,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:27,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433602268] [2019-12-07 12:55:27,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:27,775 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 12:55:27,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433602268] [2019-12-07 12:55:27,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:27,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:27,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179904912] [2019-12-07 12:55:27,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:27,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:27,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:27,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:27,777 INFO L87 Difference]: Start difference. First operand 156676 states and 194562 transitions. Second operand 3 states. [2019-12-07 12:55:28,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:28,622 INFO L93 Difference]: Finished difference Result 236552 states and 293892 transitions. [2019-12-07 12:55:28,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:28,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-07 12:55:28,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:28,752 INFO L225 Difference]: With dead ends: 236552 [2019-12-07 12:55:28,752 INFO L226 Difference]: Without dead ends: 159750 [2019-12-07 12:55:28,794 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 12:55:28,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159750 states. [2019-12-07 12:55:30,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159750 to 159748. [2019-12-07 12:55:30,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159748 states. [2019-12-07 12:55:30,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159748 states to 159748 states and 196610 transitions. [2019-12-07 12:55:30,562 INFO L78 Accepts]: Start accepts. Automaton has 159748 states and 196610 transitions. Word has length 32 [2019-12-07 12:55:30,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:30,563 INFO L462 AbstractCegarLoop]: Abstraction has 159748 states and 196610 transitions. [2019-12-07 12:55:30,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:30,563 INFO L276 IsEmpty]: Start isEmpty. Operand 159748 states and 196610 transitions. [2019-12-07 12:55:30,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 12:55:30,621 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:30,621 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:55:30,621 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:30,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:30,621 INFO L82 PathProgramCache]: Analyzing trace with hash 934549743, now seen corresponding path program 1 times [2019-12-07 12:55:30,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:30,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974376164] [2019-12-07 12:55:30,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:30,637 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 12:55:30,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974376164] [2019-12-07 12:55:30,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:30,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:30,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336461596] [2019-12-07 12:55:30,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:30,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:30,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:30,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:30,638 INFO L87 Difference]: Start difference. First operand 159748 states and 196610 transitions. Second operand 3 states. [2019-12-07 12:55:32,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:32,176 INFO L93 Difference]: Finished difference Result 262152 states and 323588 transitions. [2019-12-07 12:55:32,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:32,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-07 12:55:32,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:32,382 INFO L225 Difference]: With dead ends: 262152 [2019-12-07 12:55:32,382 INFO L226 Difference]: Without dead ends: 262150 [2019-12-07 12:55:32,407 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 12:55:32,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262150 states. [2019-12-07 12:55:34,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262150 to 245764. [2019-12-07 12:55:34,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245764 states. [2019-12-07 12:55:34,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245764 states to 245764 states and 294914 transitions. [2019-12-07 12:55:34,759 INFO L78 Accepts]: Start accepts. Automaton has 245764 states and 294914 transitions. Word has length 32 [2019-12-07 12:55:34,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:34,760 INFO L462 AbstractCegarLoop]: Abstraction has 245764 states and 294914 transitions. [2019-12-07 12:55:34,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:34,760 INFO L276 IsEmpty]: Start isEmpty. Operand 245764 states and 294914 transitions. [2019-12-07 12:55:35,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 12:55:35,106 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:35,106 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:55:35,106 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:35,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:35,107 INFO L82 PathProgramCache]: Analyzing trace with hash -653798159, now seen corresponding path program 1 times [2019-12-07 12:55:35,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:35,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262767191] [2019-12-07 12:55:35,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:35,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:35,119 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 12:55:35,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262767191] [2019-12-07 12:55:35,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:35,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:35,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018133762] [2019-12-07 12:55:35,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:35,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:35,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:35,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:35,120 INFO L87 Difference]: Start difference. First operand 245764 states and 294914 transitions. Second operand 3 states. [2019-12-07 12:55:36,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:36,958 INFO L93 Difference]: Finished difference Result 552968 states and 659460 transitions. [2019-12-07 12:55:36,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:36,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-07 12:55:36,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:37,223 INFO L225 Difference]: With dead ends: 552968 [2019-12-07 12:55:37,224 INFO L226 Difference]: Without dead ends: 311302 [2019-12-07 12:55:37,321 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 12:55:37,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311302 states. [2019-12-07 12:55:40,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311302 to 311300. [2019-12-07 12:55:40,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311300 states. [2019-12-07 12:55:40,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311300 states to 311300 states and 364546 transitions. [2019-12-07 12:55:40,820 INFO L78 Accepts]: Start accepts. Automaton has 311300 states and 364546 transitions. Word has length 32 [2019-12-07 12:55:40,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:40,820 INFO L462 AbstractCegarLoop]: Abstraction has 311300 states and 364546 transitions. [2019-12-07 12:55:40,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:40,820 INFO L276 IsEmpty]: Start isEmpty. Operand 311300 states and 364546 transitions. [2019-12-07 12:55:40,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 12:55:40,947 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:40,947 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:55:40,948 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:40,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:40,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1093512896, now seen corresponding path program 1 times [2019-12-07 12:55:40,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:40,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817050836] [2019-12-07 12:55:40,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:40,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 12:55:40,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817050836] [2019-12-07 12:55:40,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:40,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:40,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043382600] [2019-12-07 12:55:40,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:40,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:40,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:40,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:40,975 INFO L87 Difference]: Start difference. First operand 311300 states and 364546 transitions. Second operand 3 states. [2019-12-07 12:55:42,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:42,937 INFO L93 Difference]: Finished difference Result 466952 states and 544772 transitions. [2019-12-07 12:55:42,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:42,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-07 12:55:42,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:43,207 INFO L225 Difference]: With dead ends: 466952 [2019-12-07 12:55:43,207 INFO L226 Difference]: Without dead ends: 315398 [2019-12-07 12:55:43,271 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 12:55:43,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315398 states. [2019-12-07 12:55:48,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315398 to 315396. [2019-12-07 12:55:48,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315396 states. [2019-12-07 12:55:48,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315396 states to 315396 states and 364546 transitions. [2019-12-07 12:55:48,778 INFO L78 Accepts]: Start accepts. Automaton has 315396 states and 364546 transitions. Word has length 33 [2019-12-07 12:55:48,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:48,778 INFO L462 AbstractCegarLoop]: Abstraction has 315396 states and 364546 transitions. [2019-12-07 12:55:48,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:48,778 INFO L276 IsEmpty]: Start isEmpty. Operand 315396 states and 364546 transitions. [2019-12-07 12:55:48,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 12:55:48,907 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:48,907 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:55:48,907 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:48,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:48,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1207309694, now seen corresponding path program 1 times [2019-12-07 12:55:48,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:48,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763496639] [2019-12-07 12:55:48,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:48,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:48,919 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 12:55:48,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763496639] [2019-12-07 12:55:48,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:48,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:48,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110956347] [2019-12-07 12:55:48,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:48,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:48,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:48,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:48,920 INFO L87 Difference]: Start difference. First operand 315396 states and 364546 transitions. Second operand 3 states. [2019-12-07 12:55:51,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:51,791 INFO L93 Difference]: Finished difference Result 507910 states and 581635 transitions. [2019-12-07 12:55:51,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:55:51,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-07 12:55:51,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:52,229 INFO L225 Difference]: With dead ends: 507910 [2019-12-07 12:55:52,230 INFO L226 Difference]: Without dead ends: 507908 [2019-12-07 12:55:52,279 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 12:55:52,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507908 states. [2019-12-07 12:55:56,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507908 to 491524. [2019-12-07 12:55:56,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491524 states. [2019-12-07 12:55:57,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491524 states to 491524 states and 557058 transitions. [2019-12-07 12:55:57,196 INFO L78 Accepts]: Start accepts. Automaton has 491524 states and 557058 transitions. Word has length 33 [2019-12-07 12:55:57,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:57,196 INFO L462 AbstractCegarLoop]: Abstraction has 491524 states and 557058 transitions. [2019-12-07 12:55:57,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:55:57,196 INFO L276 IsEmpty]: Start isEmpty. Operand 491524 states and 557058 transitions. [2019-12-07 12:55:57,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 12:55:57,791 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:57,791 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:55:57,791 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:57,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:57,791 INFO L82 PathProgramCache]: Analyzing trace with hash -381038208, now seen corresponding path program 1 times [2019-12-07 12:55:57,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:55:57,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293687650] [2019-12-07 12:55:57,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:55:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:57,802 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 12:55:57,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293687650] [2019-12-07 12:55:57,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:57,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:55:57,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993435339] [2019-12-07 12:55:57,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:55:57,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:55:57,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:55:57,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:55:57,803 INFO L87 Difference]: Start difference. First operand 491524 states and 557058 transitions. Second operand 3 states. [2019-12-07 12:56:03,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:56:03,657 INFO L93 Difference]: Finished difference Result 1097732 states and 1228802 transitions. [2019-12-07 12:56:03,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:56:03,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-07 12:56:03,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:56:03,657 INFO L225 Difference]: With dead ends: 1097732 [2019-12-07 12:56:03,657 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 12:56:03,832 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 12:56:03,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 12:56:03,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 12:56:03,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 12:56:03,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 12:56:03,832 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2019-12-07 12:56:03,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:56:03,832 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 12:56:03,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:56:03,833 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 12:56:03,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 12:56:03,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 12:56:03,881 INFO L246 CegarLoopResult]: For program point L184-1(lines 51 214) no Hoare annotation was computed. [2019-12-07 12:56:03,881 INFO L246 CegarLoopResult]: For program point L118-1(lines 51 214) no Hoare annotation was computed. [2019-12-07 12:56:03,881 INFO L246 CegarLoopResult]: For program point L102-1(lines 51 214) no Hoare annotation was computed. [2019-12-07 12:56:03,881 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 12:56:03,881 INFO L249 CegarLoopResult]: At program point L218(lines 4 219) the Hoare annotation is: true [2019-12-07 12:56:03,881 INFO L246 CegarLoopResult]: For program point L185(line 185) no Hoare annotation was computed. [2019-12-07 12:56:03,882 INFO L246 CegarLoopResult]: For program point L86(lines 86 88) no Hoare annotation was computed. [2019-12-07 12:56:03,882 INFO L246 CegarLoopResult]: For program point L53(lines 53 55) no Hoare annotation was computed. [2019-12-07 12:56:03,882 INFO L246 CegarLoopResult]: For program point L86-2(lines 51 214) no Hoare annotation was computed. [2019-12-07 12:56:03,882 INFO L246 CegarLoopResult]: For program point L169-1(lines 51 214) no Hoare annotation was computed. [2019-12-07 12:56:03,882 INFO L246 CegarLoopResult]: For program point L170(line 170) no Hoare annotation was computed. [2019-12-07 12:56:03,882 INFO L246 CegarLoopResult]: For program point L154-1(lines 51 214) no Hoare annotation was computed. [2019-12-07 12:56:03,882 INFO L246 CegarLoopResult]: For program point L204-1(lines 51 214) no Hoare annotation was computed. [2019-12-07 12:56:03,882 INFO L246 CegarLoopResult]: For program point L138-1(lines 51 214) no Hoare annotation was computed. [2019-12-07 12:56:03,882 INFO L246 CegarLoopResult]: For program point L155(line 155) no Hoare annotation was computed. [2019-12-07 12:56:03,882 INFO L246 CegarLoopResult]: For program point L122-1(lines 51 214) no Hoare annotation was computed. [2019-12-07 12:56:03,883 INFO L246 CegarLoopResult]: For program point L205(line 205) no Hoare annotation was computed. [2019-12-07 12:56:03,883 INFO L246 CegarLoopResult]: For program point L106-1(lines 51 214) no Hoare annotation was computed. [2019-12-07 12:56:03,883 INFO L246 CegarLoopResult]: For program point L189-1(lines 51 214) no Hoare annotation was computed. [2019-12-07 12:56:03,883 INFO L246 CegarLoopResult]: For program point L90-1(lines 51 214) no Hoare annotation was computed. [2019-12-07 12:56:03,883 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 12:56:03,883 INFO L246 CegarLoopResult]: For program point L190(line 190) no Hoare annotation was computed. [2019-12-07 12:56:03,883 INFO L246 CegarLoopResult]: For program point L174-1(lines 51 214) no Hoare annotation was computed. [2019-12-07 12:56:03,883 INFO L246 CegarLoopResult]: For program point L175(line 175) no Hoare annotation was computed. [2019-12-07 12:56:03,883 INFO L246 CegarLoopResult]: For program point L159-1(lines 51 214) no Hoare annotation was computed. [2019-12-07 12:56:03,883 INFO L246 CegarLoopResult]: For program point L126-1(lines 51 214) no Hoare annotation was computed. [2019-12-07 12:56:03,883 INFO L249 CegarLoopResult]: At program point L209-1(lines 51 214) the Hoare annotation is: true [2019-12-07 12:56:03,884 INFO L246 CegarLoopResult]: For program point L110-1(lines 51 214) no Hoare annotation was computed. [2019-12-07 12:56:03,884 INFO L246 CegarLoopResult]: For program point L160(line 160) no Hoare annotation was computed. [2019-12-07 12:56:03,884 INFO L246 CegarLoopResult]: For program point L94-1(lines 51 214) no Hoare annotation was computed. [2019-12-07 12:56:03,884 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 12:56:03,884 INFO L246 CegarLoopResult]: For program point L210(line 210) no Hoare annotation was computed. [2019-12-07 12:56:03,884 INFO L242 CegarLoopResult]: At program point L210-1(lines 5 219) the Hoare annotation is: false [2019-12-07 12:56:03,884 INFO L246 CegarLoopResult]: For program point L144-1(lines 51 214) no Hoare annotation was computed. [2019-12-07 12:56:03,884 INFO L246 CegarLoopResult]: For program point L194-1(lines 51 214) no Hoare annotation was computed. [2019-12-07 12:56:03,884 INFO L246 CegarLoopResult]: For program point L145(line 145) no Hoare annotation was computed. [2019-12-07 12:56:03,884 INFO L246 CegarLoopResult]: For program point L195(line 195) no Hoare annotation was computed. [2019-12-07 12:56:03,885 INFO L246 CegarLoopResult]: For program point L179-1(lines 51 214) no Hoare annotation was computed. [2019-12-07 12:56:03,885 INFO L246 CegarLoopResult]: For program point L130-1(lines 51 214) no Hoare annotation was computed. [2019-12-07 12:56:03,885 INFO L246 CegarLoopResult]: For program point L180(line 180) no Hoare annotation was computed. [2019-12-07 12:56:03,885 INFO L246 CegarLoopResult]: For program point L114-1(lines 51 214) no Hoare annotation was computed. [2019-12-07 12:56:03,885 INFO L246 CegarLoopResult]: For program point L164-1(lines 51 214) no Hoare annotation was computed. [2019-12-07 12:56:03,885 INFO L246 CegarLoopResult]: For program point L98-1(lines 51 214) no Hoare annotation was computed. [2019-12-07 12:56:03,885 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 217) no Hoare annotation was computed. [2019-12-07 12:56:03,885 INFO L246 CegarLoopResult]: For program point L165(line 165) no Hoare annotation was computed. [2019-12-07 12:56:03,885 INFO L249 CegarLoopResult]: At program point L215(lines 5 219) the Hoare annotation is: true [2019-12-07 12:56:03,885 INFO L246 CegarLoopResult]: For program point L149-1(lines 51 214) no Hoare annotation was computed. [2019-12-07 12:56:03,886 INFO L246 CegarLoopResult]: For program point L199-1(lines 51 214) no Hoare annotation was computed. [2019-12-07 12:56:03,886 INFO L246 CegarLoopResult]: For program point L150(line 150) no Hoare annotation was computed. [2019-12-07 12:56:03,886 INFO L246 CegarLoopResult]: For program point L200(line 200) no Hoare annotation was computed. [2019-12-07 12:56:03,886 INFO L246 CegarLoopResult]: For program point L134-1(lines 51 214) no Hoare annotation was computed. [2019-12-07 12:56:03,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:56:03 BoogieIcfgContainer [2019-12-07 12:56:03,896 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:56:03,897 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:56:03,897 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:56:03,897 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:56:03,897 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:55:12" (3/4) ... [2019-12-07 12:56:03,900 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 12:56:03,910 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-07 12:56:03,910 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 12:56:03,956 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c988a84f-023e-4365-b447-c6a71f1add9c/bin/uautomizer/witness.graphml [2019-12-07 12:56:03,956 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:56:03,958 INFO L168 Benchmark]: Toolchain (without parser) took 51588.25 ms. Allocated memory was 1.0 GB in the beginning and 6.4 GB in the end (delta: 5.4 GB). Free memory was 947.8 MB in the beginning and 4.5 GB in the end (delta: -3.6 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-12-07 12:56:03,958 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:56:03,959 INFO L168 Benchmark]: CACSL2BoogieTranslator took 223.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 947.8 MB in the beginning and 1.1 GB in the end (delta: -161.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:56:03,959 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.88 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 12:56:03,959 INFO L168 Benchmark]: Boogie Preprocessor took 16.89 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 12:56:03,959 INFO L168 Benchmark]: RCFGBuilder took 238.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2019-12-07 12:56:03,960 INFO L168 Benchmark]: TraceAbstraction took 51018.42 ms. Allocated memory was 1.1 GB in the beginning and 6.4 GB in the end (delta: 5.3 GB). Free memory was 1.1 GB in the beginning and 4.6 GB in the end (delta: -3.5 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-12-07 12:56:03,960 INFO L168 Benchmark]: Witness Printer took 59.89 ms. Allocated memory is still 6.4 GB. Free memory was 4.6 GB in the beginning and 4.5 GB in the end (delta: 67.5 MB). Peak memory consumption was 67.5 MB. Max. memory is 11.5 GB. [2019-12-07 12:56:03,962 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 223.75 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 947.8 MB in the beginning and 1.1 GB in the end (delta: -161.8 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.88 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 16.89 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 238.17 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 51018.42 ms. Allocated memory was 1.1 GB in the beginning and 6.4 GB in the end (delta: 5.3 GB). Free memory was 1.1 GB in the beginning and 4.6 GB in the end (delta: -3.5 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 59.89 ms. Allocated memory is still 6.4 GB. Free memory was 4.6 GB in the beginning and 4.5 GB in the end (delta: 67.5 MB). Peak memory consumption was 67.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 217]: 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: 51]: 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, 51 locations, 1 error locations. Result: SAFE, OverallTime: 50.9s, OverallIterations: 39, TraceHistogramMax: 1, AutomataDifference: 21.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4378 SDtfs, 2248 SDslu, 2956 SDs, 0 SdLazy, 207 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=491524occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 26.8s AutomataMinimizationTime, 39 MinimizatonAttempts, 65578 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 16393 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.4s InterpolantComputationTime, 1039 NumberOfCodeBlocks, 1039 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1000 ConstructedInterpolants, 0 QuantifiedInterpolants, 58966 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 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...