./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 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_5950aa31-2755-4f96-a0b2-f7c81beed7e5/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5950aa31-2755-4f96-a0b2-f7c81beed7e5/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5950aa31-2755-4f96-a0b2-f7c81beed7e5/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5950aa31-2755-4f96-a0b2-f7c81beed7e5/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_14-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_5950aa31-2755-4f96-a0b2-f7c81beed7e5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5950aa31-2755-4f96-a0b2-f7c81beed7e5/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.24-678e011 [2019-11-19 22:00:18,867 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:00:18,869 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:00:18,884 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:00:18,884 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:00:18,885 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:00:18,887 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:00:18,895 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:00:18,900 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:00:18,904 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:00:18,905 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:00:18,907 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:00:18,907 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:00:18,909 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:00:18,910 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:00:18,911 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:00:18,912 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:00:18,913 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:00:18,915 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:00:18,919 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:00:18,923 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:00:18,925 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:00:18,928 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:00:18,929 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:00:18,931 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:00:18,931 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:00:18,932 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:00:18,933 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:00:18,933 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:00:18,934 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:00:18,935 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:00:18,935 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:00:18,936 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:00:18,937 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:00:18,938 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:00:18,938 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:00:18,939 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:00:18,939 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:00:18,939 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:00:18,940 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:00:18,942 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:00:18,943 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5950aa31-2755-4f96-a0b2-f7c81beed7e5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 22:00:18,963 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:00:18,963 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:00:18,964 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:00:18,964 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:00:18,965 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:00:18,965 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:00:18,965 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 22:00:18,965 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 22:00:18,965 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 22:00:18,965 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:00:18,966 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 22:00:18,966 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 22:00:18,966 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 22:00:18,966 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 22:00:18,966 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 22:00:18,966 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:00:18,967 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 22:00:18,967 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:00:18,967 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:00:18,967 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 22:00:18,967 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 22:00:18,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 22:00:18,968 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:00:18,968 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 22:00:18,968 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 22:00:18,968 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 22:00:18,969 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 22:00:18,969 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 22:00:18,969 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_5950aa31-2755-4f96-a0b2-f7c81beed7e5/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-11-19 22:00:19,124 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:00:19,134 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:00:19,138 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:00:19,145 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:00:19,146 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:00:19,148 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5950aa31-2755-4f96-a0b2-f7c81beed7e5/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_14-1.c [2019-11-19 22:00:19,207 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5950aa31-2755-4f96-a0b2-f7c81beed7e5/bin/uautomizer/data/59b074a87/3ee8256fe6fb4ae7b070cb5b4f9b5949/FLAG63ef38f5d [2019-11-19 22:00:19,591 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:00:19,591 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5950aa31-2755-4f96-a0b2-f7c81beed7e5/sv-benchmarks/c/locks/test_locks_14-1.c [2019-11-19 22:00:19,599 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5950aa31-2755-4f96-a0b2-f7c81beed7e5/bin/uautomizer/data/59b074a87/3ee8256fe6fb4ae7b070cb5b4f9b5949/FLAG63ef38f5d [2019-11-19 22:00:19,610 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5950aa31-2755-4f96-a0b2-f7c81beed7e5/bin/uautomizer/data/59b074a87/3ee8256fe6fb4ae7b070cb5b4f9b5949 [2019-11-19 22:00:19,612 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:00:19,614 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 22:00:19,615 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:00:19,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:00:19,618 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:00:19,618 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:00:19" (1/1) ... [2019-11-19 22:00:19,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fd64ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:00:19, skipping insertion in model container [2019-11-19 22:00:19,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:00:19" (1/1) ... [2019-11-19 22:00:19,626 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:00:19,647 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:00:19,958 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:00:19,966 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:00:20,015 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:00:20,032 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:00:20,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:00:20 WrapperNode [2019-11-19 22:00:20,033 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:00:20,034 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 22:00:20,034 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 22:00:20,034 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 22:00:20,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:00:20" (1/1) ... [2019-11-19 22:00:20,060 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:00:20" (1/1) ... [2019-11-19 22:00:20,087 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 22:00:20,089 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:00:20,090 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:00:20,090 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:00:20,096 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:00:20" (1/1) ... [2019-11-19 22:00:20,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:00:20" (1/1) ... [2019-11-19 22:00:20,098 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:00:20" (1/1) ... [2019-11-19 22:00:20,098 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:00:20" (1/1) ... [2019-11-19 22:00:20,102 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:00:20" (1/1) ... [2019-11-19 22:00:20,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:00:20" (1/1) ... [2019-11-19 22:00:20,114 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:00:20" (1/1) ... [2019-11-19 22:00:20,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:00:20,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:00:20,118 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:00:20,118 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:00:20,119 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:00:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5950aa31-2755-4f96-a0b2-f7c81beed7e5/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-11-19 22:00:20,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:00:20,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:00:20,691 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:00:20,691 INFO L285 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-19 22:00:20,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:00:20 BoogieIcfgContainer [2019-11-19 22:00:20,693 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:00:20,693 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 22:00:20,694 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 22:00:20,696 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 22:00:20,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:00:19" (1/3) ... [2019-11-19 22:00:20,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@305afa62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:00:20, skipping insertion in model container [2019-11-19 22:00:20,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:00:20" (2/3) ... [2019-11-19 22:00:20,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@305afa62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:00:20, skipping insertion in model container [2019-11-19 22:00:20,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:00:20" (3/3) ... [2019-11-19 22:00:20,700 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_14-1.c [2019-11-19 22:00:20,709 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 22:00:20,714 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 22:00:20,722 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 22:00:20,742 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 22:00:20,742 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 22:00:20,742 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 22:00:20,742 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:00:20,742 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:00:20,742 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 22:00:20,742 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:00:20,743 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 22:00:20,755 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2019-11-19 22:00:20,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-19 22:00:20,761 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:20,762 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-11-19 22:00:20,762 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:20,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:20,768 INFO L82 PathProgramCache]: Analyzing trace with hash 458325173, now seen corresponding path program 1 times [2019-11-19 22:00:20,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:20,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161840861] [2019-11-19 22:00:20,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:20,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:20,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:00:20,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161840861] [2019-11-19 22:00:20,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:20,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:00:20,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478475517] [2019-11-19 22:00:20,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:00:20,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:20,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:00:20,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:20,973 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 3 states. [2019-11-19 22:00:21,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:21,028 INFO L93 Difference]: Finished difference Result 106 states and 192 transitions. [2019-11-19 22:00:21,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:00:21,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-19 22:00:21,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:21,047 INFO L225 Difference]: With dead ends: 106 [2019-11-19 22:00:21,047 INFO L226 Difference]: Without dead ends: 92 [2019-11-19 22:00:21,050 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:21,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-19 22:00:21,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 62. [2019-11-19 22:00:21,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-19 22:00:21,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 117 transitions. [2019-11-19 22:00:21,090 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 117 transitions. Word has length 20 [2019-11-19 22:00:21,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:21,091 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 117 transitions. [2019-11-19 22:00:21,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:00:21,091 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 117 transitions. [2019-11-19 22:00:21,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-19 22:00:21,092 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:21,092 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-11-19 22:00:21,092 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:21,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:21,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1130022729, now seen corresponding path program 1 times [2019-11-19 22:00:21,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:21,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83716392] [2019-11-19 22:00:21,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:21,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:21,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:00:21,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83716392] [2019-11-19 22:00:21,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:21,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:00:21,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114291835] [2019-11-19 22:00:21,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:00:21,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:21,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:00:21,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:21,183 INFO L87 Difference]: Start difference. First operand 62 states and 117 transitions. Second operand 3 states. [2019-11-19 22:00:21,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:21,206 INFO L93 Difference]: Finished difference Result 153 states and 288 transitions. [2019-11-19 22:00:21,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:00:21,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-19 22:00:21,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:21,208 INFO L225 Difference]: With dead ends: 153 [2019-11-19 22:00:21,208 INFO L226 Difference]: Without dead ends: 92 [2019-11-19 22:00:21,210 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:21,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-19 22:00:21,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2019-11-19 22:00:21,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-11-19 22:00:21,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 169 transitions. [2019-11-19 22:00:21,222 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 169 transitions. Word has length 20 [2019-11-19 22:00:21,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:21,222 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 169 transitions. [2019-11-19 22:00:21,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:00:21,222 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 169 transitions. [2019-11-19 22:00:21,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-19 22:00:21,223 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:21,224 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-11-19 22:00:21,224 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:21,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:21,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1323390526, now seen corresponding path program 1 times [2019-11-19 22:00:21,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:21,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98161792] [2019-11-19 22:00:21,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:21,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:00:21,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98161792] [2019-11-19 22:00:21,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:21,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:00:21,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330628236] [2019-11-19 22:00:21,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:00:21,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:21,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:00:21,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:21,285 INFO L87 Difference]: Start difference. First operand 90 states and 169 transitions. Second operand 3 states. [2019-11-19 22:00:21,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:21,310 INFO L93 Difference]: Finished difference Result 140 states and 257 transitions. [2019-11-19 22:00:21,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:00:21,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-19 22:00:21,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:21,312 INFO L225 Difference]: With dead ends: 140 [2019-11-19 22:00:21,312 INFO L226 Difference]: Without dead ends: 95 [2019-11-19 22:00:21,313 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:21,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-11-19 22:00:21,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2019-11-19 22:00:21,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-19 22:00:21,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 171 transitions. [2019-11-19 22:00:21,324 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 171 transitions. Word has length 21 [2019-11-19 22:00:21,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:21,324 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 171 transitions. [2019-11-19 22:00:21,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:00:21,324 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 171 transitions. [2019-11-19 22:00:21,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-19 22:00:21,326 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:21,326 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-11-19 22:00:21,326 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:21,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:21,326 INFO L82 PathProgramCache]: Analyzing trace with hash -670754180, now seen corresponding path program 1 times [2019-11-19 22:00:21,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:21,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210193761] [2019-11-19 22:00:21,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:21,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:00:21,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210193761] [2019-11-19 22:00:21,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:21,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:00:21,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70938429] [2019-11-19 22:00:21,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:00:21,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:21,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:00:21,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:21,368 INFO L87 Difference]: Start difference. First operand 93 states and 171 transitions. Second operand 3 states. [2019-11-19 22:00:21,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:21,387 INFO L93 Difference]: Finished difference Result 180 states and 332 transitions. [2019-11-19 22:00:21,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:00:21,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-19 22:00:21,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:21,392 INFO L225 Difference]: With dead ends: 180 [2019-11-19 22:00:21,392 INFO L226 Difference]: Without dead ends: 178 [2019-11-19 22:00:21,393 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:21,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-19 22:00:21,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 124. [2019-11-19 22:00:21,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-19 22:00:21,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 228 transitions. [2019-11-19 22:00:21,405 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 228 transitions. Word has length 21 [2019-11-19 22:00:21,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:21,406 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 228 transitions. [2019-11-19 22:00:21,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:00:21,406 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 228 transitions. [2019-11-19 22:00:21,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-19 22:00:21,408 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:21,408 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-11-19 22:00:21,408 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:21,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:21,409 INFO L82 PathProgramCache]: Analyzing trace with hash 2035865214, now seen corresponding path program 1 times [2019-11-19 22:00:21,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:21,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905216322] [2019-11-19 22:00:21,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:21,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:00:21,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905216322] [2019-11-19 22:00:21,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:21,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:00:21,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112845989] [2019-11-19 22:00:21,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:00:21,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:21,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:00:21,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:21,461 INFO L87 Difference]: Start difference. First operand 124 states and 228 transitions. Second operand 3 states. [2019-11-19 22:00:21,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:21,480 INFO L93 Difference]: Finished difference Result 300 states and 554 transitions. [2019-11-19 22:00:21,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:00:21,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-19 22:00:21,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:21,482 INFO L225 Difference]: With dead ends: 300 [2019-11-19 22:00:21,483 INFO L226 Difference]: Without dead ends: 180 [2019-11-19 22:00:21,484 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:21,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-19 22:00:21,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2019-11-19 22:00:21,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-11-19 22:00:21,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 326 transitions. [2019-11-19 22:00:21,498 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 326 transitions. Word has length 21 [2019-11-19 22:00:21,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:21,498 INFO L462 AbstractCegarLoop]: Abstraction has 178 states and 326 transitions. [2019-11-19 22:00:21,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:00:21,498 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 326 transitions. [2019-11-19 22:00:21,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 22:00:21,500 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:21,500 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-11-19 22:00:21,500 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:21,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:21,501 INFO L82 PathProgramCache]: Analyzing trace with hash 681669292, now seen corresponding path program 1 times [2019-11-19 22:00:21,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:21,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091986933] [2019-11-19 22:00:21,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:21,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:00:21,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091986933] [2019-11-19 22:00:21,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:21,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:00:21,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448158461] [2019-11-19 22:00:21,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:00:21,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:21,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:00:21,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:21,548 INFO L87 Difference]: Start difference. First operand 178 states and 326 transitions. Second operand 3 states. [2019-11-19 22:00:21,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:21,572 INFO L93 Difference]: Finished difference Result 269 states and 489 transitions. [2019-11-19 22:00:21,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:00:21,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-19 22:00:21,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:21,574 INFO L225 Difference]: With dead ends: 269 [2019-11-19 22:00:21,574 INFO L226 Difference]: Without dead ends: 182 [2019-11-19 22:00:21,575 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:21,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-19 22:00:21,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2019-11-19 22:00:21,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-19 22:00:21,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 326 transitions. [2019-11-19 22:00:21,587 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 326 transitions. Word has length 22 [2019-11-19 22:00:21,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:21,588 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 326 transitions. [2019-11-19 22:00:21,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:00:21,588 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 326 transitions. [2019-11-19 22:00:21,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 22:00:21,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:21,589 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-11-19 22:00:21,590 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:21,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:21,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1312475414, now seen corresponding path program 1 times [2019-11-19 22:00:21,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:21,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287879036] [2019-11-19 22:00:21,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:21,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:00:21,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287879036] [2019-11-19 22:00:21,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:21,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:00:21,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537045949] [2019-11-19 22:00:21,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:00:21,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:21,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:00:21,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:21,635 INFO L87 Difference]: Start difference. First operand 180 states and 326 transitions. Second operand 3 states. [2019-11-19 22:00:21,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:21,669 INFO L93 Difference]: Finished difference Result 524 states and 952 transitions. [2019-11-19 22:00:21,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:00:21,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-19 22:00:21,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:21,672 INFO L225 Difference]: With dead ends: 524 [2019-11-19 22:00:21,672 INFO L226 Difference]: Without dead ends: 350 [2019-11-19 22:00:21,673 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:21,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-11-19 22:00:21,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 348. [2019-11-19 22:00:21,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-11-19 22:00:21,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 626 transitions. [2019-11-19 22:00:21,707 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 626 transitions. Word has length 22 [2019-11-19 22:00:21,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:21,707 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 626 transitions. [2019-11-19 22:00:21,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:00:21,707 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 626 transitions. [2019-11-19 22:00:21,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 22:00:21,709 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:21,710 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-11-19 22:00:21,710 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:21,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:21,710 INFO L82 PathProgramCache]: Analyzing trace with hash 275872488, now seen corresponding path program 1 times [2019-11-19 22:00:21,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:21,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201128074] [2019-11-19 22:00:21,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:21,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-11-19 22:00:21,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201128074] [2019-11-19 22:00:21,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:21,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:00:21,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159569683] [2019-11-19 22:00:21,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:00:21,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:21,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:00:21,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:21,739 INFO L87 Difference]: Start difference. First operand 348 states and 626 transitions. Second operand 3 states. [2019-11-19 22:00:21,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:21,756 INFO L93 Difference]: Finished difference Result 448 states and 812 transitions. [2019-11-19 22:00:21,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:00:21,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-19 22:00:21,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:21,759 INFO L225 Difference]: With dead ends: 448 [2019-11-19 22:00:21,760 INFO L226 Difference]: Without dead ends: 446 [2019-11-19 22:00:21,760 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:21,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-11-19 22:00:21,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 348. [2019-11-19 22:00:21,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-11-19 22:00:21,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 622 transitions. [2019-11-19 22:00:21,775 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 622 transitions. Word has length 22 [2019-11-19 22:00:21,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:21,775 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 622 transitions. [2019-11-19 22:00:21,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:00:21,776 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 622 transitions. [2019-11-19 22:00:21,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-19 22:00:21,778 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:21,778 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-11-19 22:00:21,778 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:21,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:21,779 INFO L82 PathProgramCache]: Analyzing trace with hash -2031819437, now seen corresponding path program 1 times [2019-11-19 22:00:21,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:21,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689345943] [2019-11-19 22:00:21,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:21,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:21,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-11-19 22:00:21,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689345943] [2019-11-19 22:00:21,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:21,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:00:21,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738515777] [2019-11-19 22:00:21,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:00:21,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:21,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:00:21,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:21,804 INFO L87 Difference]: Start difference. First operand 348 states and 622 transitions. Second operand 3 states. [2019-11-19 22:00:21,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:21,822 INFO L93 Difference]: Finished difference Result 660 states and 1192 transitions. [2019-11-19 22:00:21,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:00:21,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-19 22:00:21,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:21,827 INFO L225 Difference]: With dead ends: 660 [2019-11-19 22:00:21,827 INFO L226 Difference]: Without dead ends: 658 [2019-11-19 22:00:21,828 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:21,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2019-11-19 22:00:21,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 480. [2019-11-19 22:00:21,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2019-11-19 22:00:21,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 846 transitions. [2019-11-19 22:00:21,847 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 846 transitions. Word has length 23 [2019-11-19 22:00:21,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:21,848 INFO L462 AbstractCegarLoop]: Abstraction has 480 states and 846 transitions. [2019-11-19 22:00:21,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:00:21,848 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 846 transitions. [2019-11-19 22:00:21,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-19 22:00:21,850 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:21,850 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-11-19 22:00:21,850 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:21,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:21,851 INFO L82 PathProgramCache]: Analyzing trace with hash 674799957, now seen corresponding path program 1 times [2019-11-19 22:00:21,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:21,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489266975] [2019-11-19 22:00:21,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:21,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:21,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:00:21,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489266975] [2019-11-19 22:00:21,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:21,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:00:21,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248087742] [2019-11-19 22:00:21,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:00:21,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:21,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:00:21,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:21,875 INFO L87 Difference]: Start difference. First operand 480 states and 846 transitions. Second operand 3 states. [2019-11-19 22:00:21,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:21,904 INFO L93 Difference]: Finished difference Result 1156 states and 2048 transitions. [2019-11-19 22:00:21,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:00:21,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-19 22:00:21,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:21,913 INFO L225 Difference]: With dead ends: 1156 [2019-11-19 22:00:21,913 INFO L226 Difference]: Without dead ends: 682 [2019-11-19 22:00:21,917 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:21,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-11-19 22:00:21,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 680. [2019-11-19 22:00:21,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2019-11-19 22:00:21,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1194 transitions. [2019-11-19 22:00:21,943 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1194 transitions. Word has length 23 [2019-11-19 22:00:21,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:21,944 INFO L462 AbstractCegarLoop]: Abstraction has 680 states and 1194 transitions. [2019-11-19 22:00:21,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:00:21,944 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1194 transitions. [2019-11-19 22:00:21,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-19 22:00:21,945 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:21,945 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-11-19 22:00:21,945 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:21,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:21,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1438319967, now seen corresponding path program 1 times [2019-11-19 22:00:21,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:21,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759846582] [2019-11-19 22:00:21,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:21,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:00:21,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759846582] [2019-11-19 22:00:21,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:21,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:00:21,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658297772] [2019-11-19 22:00:21,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:00:21,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:21,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:00:21,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:21,968 INFO L87 Difference]: Start difference. First operand 680 states and 1194 transitions. Second operand 3 states. [2019-11-19 22:00:21,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:21,988 INFO L93 Difference]: Finished difference Result 1028 states and 1800 transitions. [2019-11-19 22:00:21,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:00:21,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-19 22:00:21,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:21,993 INFO L225 Difference]: With dead ends: 1028 [2019-11-19 22:00:21,993 INFO L226 Difference]: Without dead ends: 694 [2019-11-19 22:00:21,994 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:21,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2019-11-19 22:00:22,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 692. [2019-11-19 22:00:22,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2019-11-19 22:00:22,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1202 transitions. [2019-11-19 22:00:22,015 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1202 transitions. Word has length 24 [2019-11-19 22:00:22,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:22,015 INFO L462 AbstractCegarLoop]: Abstraction has 692 states and 1202 transitions. [2019-11-19 22:00:22,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:00:22,015 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1202 transitions. [2019-11-19 22:00:22,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-19 22:00:22,017 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:22,017 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-11-19 22:00:22,017 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:22,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:22,017 INFO L82 PathProgramCache]: Analyzing trace with hash -555824739, now seen corresponding path program 1 times [2019-11-19 22:00:22,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:22,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205415285] [2019-11-19 22:00:22,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:22,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:00:22,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205415285] [2019-11-19 22:00:22,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:22,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:00:22,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459024407] [2019-11-19 22:00:22,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:00:22,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:22,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:00:22,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:22,046 INFO L87 Difference]: Start difference. First operand 692 states and 1202 transitions. Second operand 3 states. [2019-11-19 22:00:22,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:22,076 INFO L93 Difference]: Finished difference Result 1288 states and 2268 transitions. [2019-11-19 22:00:22,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:00:22,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-19 22:00:22,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:22,085 INFO L225 Difference]: With dead ends: 1288 [2019-11-19 22:00:22,085 INFO L226 Difference]: Without dead ends: 1286 [2019-11-19 22:00:22,086 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:22,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2019-11-19 22:00:22,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 964. [2019-11-19 22:00:22,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 964 states. [2019-11-19 22:00:22,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1642 transitions. [2019-11-19 22:00:22,122 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1642 transitions. Word has length 24 [2019-11-19 22:00:22,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:22,122 INFO L462 AbstractCegarLoop]: Abstraction has 964 states and 1642 transitions. [2019-11-19 22:00:22,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:00:22,123 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1642 transitions. [2019-11-19 22:00:22,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-19 22:00:22,125 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:22,125 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-11-19 22:00:22,125 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:22,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:22,126 INFO L82 PathProgramCache]: Analyzing trace with hash -2144172641, now seen corresponding path program 1 times [2019-11-19 22:00:22,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:22,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34668595] [2019-11-19 22:00:22,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:22,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:22,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:00:22,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34668595] [2019-11-19 22:00:22,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:22,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:00:22,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051612048] [2019-11-19 22:00:22,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:00:22,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:22,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:00:22,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:22,161 INFO L87 Difference]: Start difference. First operand 964 states and 1642 transitions. Second operand 3 states. [2019-11-19 22:00:22,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:22,197 INFO L93 Difference]: Finished difference Result 2296 states and 3932 transitions. [2019-11-19 22:00:22,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:00:22,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-19 22:00:22,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:22,207 INFO L225 Difference]: With dead ends: 2296 [2019-11-19 22:00:22,208 INFO L226 Difference]: Without dead ends: 1350 [2019-11-19 22:00:22,210 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:22,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2019-11-19 22:00:22,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1348. [2019-11-19 22:00:22,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1348 states. [2019-11-19 22:00:22,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 2290 transitions. [2019-11-19 22:00:22,253 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 2290 transitions. Word has length 24 [2019-11-19 22:00:22,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:22,254 INFO L462 AbstractCegarLoop]: Abstraction has 1348 states and 2290 transitions. [2019-11-19 22:00:22,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:00:22,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 2290 transitions. [2019-11-19 22:00:22,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-19 22:00:22,261 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:22,261 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-11-19 22:00:22,261 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:22,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:22,262 INFO L82 PathProgramCache]: Analyzing trace with hash -50484310, now seen corresponding path program 1 times [2019-11-19 22:00:22,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:22,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866895323] [2019-11-19 22:00:22,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:22,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:00:22,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866895323] [2019-11-19 22:00:22,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:22,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:00:22,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450520140] [2019-11-19 22:00:22,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:00:22,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:22,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:00:22,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:22,292 INFO L87 Difference]: Start difference. First operand 1348 states and 2290 transitions. Second operand 3 states. [2019-11-19 22:00:22,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:22,325 INFO L93 Difference]: Finished difference Result 2024 states and 3428 transitions. [2019-11-19 22:00:22,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:00:22,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-19 22:00:22,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:22,333 INFO L225 Difference]: With dead ends: 2024 [2019-11-19 22:00:22,333 INFO L226 Difference]: Without dead ends: 1366 [2019-11-19 22:00:22,335 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:22,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2019-11-19 22:00:22,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1364. [2019-11-19 22:00:22,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1364 states. [2019-11-19 22:00:22,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 2290 transitions. [2019-11-19 22:00:22,377 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 2290 transitions. Word has length 25 [2019-11-19 22:00:22,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:22,377 INFO L462 AbstractCegarLoop]: Abstraction has 1364 states and 2290 transitions. [2019-11-19 22:00:22,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:00:22,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 2290 transitions. [2019-11-19 22:00:22,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-19 22:00:22,380 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:22,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, 1, 1, 1] [2019-11-19 22:00:22,380 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:22,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:22,380 INFO L82 PathProgramCache]: Analyzing trace with hash -2044629016, now seen corresponding path program 1 times [2019-11-19 22:00:22,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:22,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203252953] [2019-11-19 22:00:22,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:22,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:22,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:00:22,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203252953] [2019-11-19 22:00:22,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:22,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:00:22,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583068651] [2019-11-19 22:00:22,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:00:22,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:22,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:00:22,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:22,414 INFO L87 Difference]: Start difference. First operand 1364 states and 2290 transitions. Second operand 3 states. [2019-11-19 22:00:22,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:22,454 INFO L93 Difference]: Finished difference Result 2504 states and 4276 transitions. [2019-11-19 22:00:22,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:00:22,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-19 22:00:22,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:22,469 INFO L225 Difference]: With dead ends: 2504 [2019-11-19 22:00:22,470 INFO L226 Difference]: Without dead ends: 2502 [2019-11-19 22:00:22,472 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:22,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2502 states. [2019-11-19 22:00:22,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2502 to 1924. [2019-11-19 22:00:22,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1924 states. [2019-11-19 22:00:22,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 3154 transitions. [2019-11-19 22:00:22,561 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 3154 transitions. Word has length 25 [2019-11-19 22:00:22,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:22,561 INFO L462 AbstractCegarLoop]: Abstraction has 1924 states and 3154 transitions. [2019-11-19 22:00:22,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:00:22,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 3154 transitions. [2019-11-19 22:00:22,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-19 22:00:22,565 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:22,565 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-11-19 22:00:22,566 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:22,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:22,566 INFO L82 PathProgramCache]: Analyzing trace with hash 661990378, now seen corresponding path program 1 times [2019-11-19 22:00:22,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:22,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309399639] [2019-11-19 22:00:22,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:22,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:22,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:00:22,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309399639] [2019-11-19 22:00:22,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:22,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:00:22,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688739476] [2019-11-19 22:00:22,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:00:22,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:22,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:00:22,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:22,599 INFO L87 Difference]: Start difference. First operand 1924 states and 3154 transitions. Second operand 3 states. [2019-11-19 22:00:22,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:22,652 INFO L93 Difference]: Finished difference Result 4552 states and 7508 transitions. [2019-11-19 22:00:22,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:00:22,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-19 22:00:22,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:22,667 INFO L225 Difference]: With dead ends: 4552 [2019-11-19 22:00:22,667 INFO L226 Difference]: Without dead ends: 2662 [2019-11-19 22:00:22,670 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:22,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2662 states. [2019-11-19 22:00:22,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2662 to 2660. [2019-11-19 22:00:22,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2660 states. [2019-11-19 22:00:22,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2660 states to 2660 states and 4354 transitions. [2019-11-19 22:00:22,746 INFO L78 Accepts]: Start accepts. Automaton has 2660 states and 4354 transitions. Word has length 25 [2019-11-19 22:00:22,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:22,746 INFO L462 AbstractCegarLoop]: Abstraction has 2660 states and 4354 transitions. [2019-11-19 22:00:22,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:00:22,746 INFO L276 IsEmpty]: Start isEmpty. Operand 2660 states and 4354 transitions. [2019-11-19 22:00:22,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-19 22:00:22,749 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:22,749 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:00:22,749 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:22,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:22,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1041223700, now seen corresponding path program 1 times [2019-11-19 22:00:22,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:22,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540175128] [2019-11-19 22:00:22,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:22,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:00:22,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540175128] [2019-11-19 22:00:22,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:22,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:00:22,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091087869] [2019-11-19 22:00:22,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:00:22,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:22,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:00:22,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:22,780 INFO L87 Difference]: Start difference. First operand 2660 states and 4354 transitions. Second operand 3 states. [2019-11-19 22:00:22,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:22,828 INFO L93 Difference]: Finished difference Result 3992 states and 6516 transitions. [2019-11-19 22:00:22,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:00:22,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-19 22:00:22,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:22,843 INFO L225 Difference]: With dead ends: 3992 [2019-11-19 22:00:22,843 INFO L226 Difference]: Without dead ends: 2694 [2019-11-19 22:00:22,846 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:22,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2694 states. [2019-11-19 22:00:22,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2694 to 2692. [2019-11-19 22:00:22,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2692 states. [2019-11-19 22:00:22,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2692 states to 2692 states and 4354 transitions. [2019-11-19 22:00:22,918 INFO L78 Accepts]: Start accepts. Automaton has 2692 states and 4354 transitions. Word has length 26 [2019-11-19 22:00:22,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:22,918 INFO L462 AbstractCegarLoop]: Abstraction has 2692 states and 4354 transitions. [2019-11-19 22:00:22,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:00:22,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2692 states and 4354 transitions. [2019-11-19 22:00:22,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-19 22:00:22,923 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:22,924 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-11-19 22:00:22,924 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:22,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:22,924 INFO L82 PathProgramCache]: Analyzing trace with hash -952921006, now seen corresponding path program 1 times [2019-11-19 22:00:22,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:22,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548094587] [2019-11-19 22:00:22,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:22,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:22,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:00:22,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548094587] [2019-11-19 22:00:22,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:22,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:00:22,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510111502] [2019-11-19 22:00:22,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:00:22,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:22,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:00:22,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:22,956 INFO L87 Difference]: Start difference. First operand 2692 states and 4354 transitions. Second operand 3 states. [2019-11-19 22:00:23,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:23,025 INFO L93 Difference]: Finished difference Result 4872 states and 8036 transitions. [2019-11-19 22:00:23,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:00:23,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-19 22:00:23,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:23,052 INFO L225 Difference]: With dead ends: 4872 [2019-11-19 22:00:23,052 INFO L226 Difference]: Without dead ends: 4870 [2019-11-19 22:00:23,054 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:23,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4870 states. [2019-11-19 22:00:23,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4870 to 3844. [2019-11-19 22:00:23,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3844 states. [2019-11-19 22:00:23,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3844 states to 3844 states and 6050 transitions. [2019-11-19 22:00:23,174 INFO L78 Accepts]: Start accepts. Automaton has 3844 states and 6050 transitions. Word has length 26 [2019-11-19 22:00:23,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:23,174 INFO L462 AbstractCegarLoop]: Abstraction has 3844 states and 6050 transitions. [2019-11-19 22:00:23,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:00:23,174 INFO L276 IsEmpty]: Start isEmpty. Operand 3844 states and 6050 transitions. [2019-11-19 22:00:23,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-19 22:00:23,180 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:23,180 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-11-19 22:00:23,181 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:23,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:23,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1753698388, now seen corresponding path program 1 times [2019-11-19 22:00:23,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:23,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065069469] [2019-11-19 22:00:23,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:23,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:23,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:00:23,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065069469] [2019-11-19 22:00:23,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:23,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:00:23,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510786137] [2019-11-19 22:00:23,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:00:23,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:23,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:00:23,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:23,206 INFO L87 Difference]: Start difference. First operand 3844 states and 6050 transitions. Second operand 3 states. [2019-11-19 22:00:23,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:23,297 INFO L93 Difference]: Finished difference Result 9032 states and 14308 transitions. [2019-11-19 22:00:23,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:00:23,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-19 22:00:23,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:23,322 INFO L225 Difference]: With dead ends: 9032 [2019-11-19 22:00:23,322 INFO L226 Difference]: Without dead ends: 5254 [2019-11-19 22:00:23,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-11-19 22:00:23,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5254 states. [2019-11-19 22:00:23,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5254 to 5252. [2019-11-19 22:00:23,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5252 states. [2019-11-19 22:00:23,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5252 states to 5252 states and 8258 transitions. [2019-11-19 22:00:23,473 INFO L78 Accepts]: Start accepts. Automaton has 5252 states and 8258 transitions. Word has length 26 [2019-11-19 22:00:23,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:23,473 INFO L462 AbstractCegarLoop]: Abstraction has 5252 states and 8258 transitions. [2019-11-19 22:00:23,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:00:23,473 INFO L276 IsEmpty]: Start isEmpty. Operand 5252 states and 8258 transitions. [2019-11-19 22:00:23,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-19 22:00:23,479 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:23,479 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-11-19 22:00:23,479 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:23,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:23,479 INFO L82 PathProgramCache]: Analyzing trace with hash 524433983, now seen corresponding path program 1 times [2019-11-19 22:00:23,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:23,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315900398] [2019-11-19 22:00:23,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:23,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:23,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:00:23,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315900398] [2019-11-19 22:00:23,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:23,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:00:23,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452921795] [2019-11-19 22:00:23,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:00:23,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:23,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:00:23,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:23,502 INFO L87 Difference]: Start difference. First operand 5252 states and 8258 transitions. Second operand 3 states. [2019-11-19 22:00:23,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:23,609 INFO L93 Difference]: Finished difference Result 7880 states and 12356 transitions. [2019-11-19 22:00:23,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:00:23,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-19 22:00:23,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:23,619 INFO L225 Difference]: With dead ends: 7880 [2019-11-19 22:00:23,620 INFO L226 Difference]: Without dead ends: 5318 [2019-11-19 22:00:23,623 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:23,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5318 states. [2019-11-19 22:00:23,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5318 to 5316. [2019-11-19 22:00:23,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5316 states. [2019-11-19 22:00:23,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5316 states to 5316 states and 8258 transitions. [2019-11-19 22:00:23,746 INFO L78 Accepts]: Start accepts. Automaton has 5316 states and 8258 transitions. Word has length 27 [2019-11-19 22:00:23,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:23,746 INFO L462 AbstractCegarLoop]: Abstraction has 5316 states and 8258 transitions. [2019-11-19 22:00:23,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:00:23,747 INFO L276 IsEmpty]: Start isEmpty. Operand 5316 states and 8258 transitions. [2019-11-19 22:00:23,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-19 22:00:23,753 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:23,753 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:00:23,753 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:23,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:23,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1469710723, now seen corresponding path program 1 times [2019-11-19 22:00:23,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:23,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159932697] [2019-11-19 22:00:23,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:23,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:00:23,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159932697] [2019-11-19 22:00:23,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:23,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:00:23,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755897010] [2019-11-19 22:00:23,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:00:23,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:23,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:00:23,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:23,782 INFO L87 Difference]: Start difference. First operand 5316 states and 8258 transitions. Second operand 3 states. [2019-11-19 22:00:23,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:23,874 INFO L93 Difference]: Finished difference Result 9480 states and 15044 transitions. [2019-11-19 22:00:23,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:00:23,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-19 22:00:23,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:23,894 INFO L225 Difference]: With dead ends: 9480 [2019-11-19 22:00:23,894 INFO L226 Difference]: Without dead ends: 9478 [2019-11-19 22:00:23,897 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:23,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9478 states. [2019-11-19 22:00:24,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9478 to 7684. [2019-11-19 22:00:24,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7684 states. [2019-11-19 22:00:24,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7684 states to 7684 states and 11586 transitions. [2019-11-19 22:00:24,067 INFO L78 Accepts]: Start accepts. Automaton has 7684 states and 11586 transitions. Word has length 27 [2019-11-19 22:00:24,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:24,068 INFO L462 AbstractCegarLoop]: Abstraction has 7684 states and 11586 transitions. [2019-11-19 22:00:24,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:00:24,068 INFO L276 IsEmpty]: Start isEmpty. Operand 7684 states and 11586 transitions. [2019-11-19 22:00:24,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-19 22:00:24,080 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:24,081 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-11-19 22:00:24,081 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:24,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:24,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1236908671, now seen corresponding path program 1 times [2019-11-19 22:00:24,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:24,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576499497] [2019-11-19 22:00:24,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:24,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:00:24,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576499497] [2019-11-19 22:00:24,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:24,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:00:24,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516507366] [2019-11-19 22:00:24,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:00:24,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:24,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:00:24,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:24,105 INFO L87 Difference]: Start difference. First operand 7684 states and 11586 transitions. Second operand 3 states. [2019-11-19 22:00:24,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:24,214 INFO L93 Difference]: Finished difference Result 17928 states and 27204 transitions. [2019-11-19 22:00:24,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:00:24,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-19 22:00:24,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:24,234 INFO L225 Difference]: With dead ends: 17928 [2019-11-19 22:00:24,234 INFO L226 Difference]: Without dead ends: 10374 [2019-11-19 22:00:24,244 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:24,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10374 states. [2019-11-19 22:00:24,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10374 to 10372. [2019-11-19 22:00:24,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10372 states. [2019-11-19 22:00:24,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10372 states to 10372 states and 15618 transitions. [2019-11-19 22:00:24,543 INFO L78 Accepts]: Start accepts. Automaton has 10372 states and 15618 transitions. Word has length 27 [2019-11-19 22:00:24,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:24,543 INFO L462 AbstractCegarLoop]: Abstraction has 10372 states and 15618 transitions. [2019-11-19 22:00:24,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:00:24,543 INFO L276 IsEmpty]: Start isEmpty. Operand 10372 states and 15618 transitions. [2019-11-19 22:00:24,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-19 22:00:24,555 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:24,555 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-11-19 22:00:24,557 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:24,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:24,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1683822281, now seen corresponding path program 1 times [2019-11-19 22:00:24,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:24,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791844968] [2019-11-19 22:00:24,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:24,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:00:24,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791844968] [2019-11-19 22:00:24,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:24,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:00:24,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660616233] [2019-11-19 22:00:24,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:00:24,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:24,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:00:24,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:24,581 INFO L87 Difference]: Start difference. First operand 10372 states and 15618 transitions. Second operand 3 states. [2019-11-19 22:00:24,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:24,688 INFO L93 Difference]: Finished difference Result 15560 states and 23364 transitions. [2019-11-19 22:00:24,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:00:24,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-19 22:00:24,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:24,707 INFO L225 Difference]: With dead ends: 15560 [2019-11-19 22:00:24,707 INFO L226 Difference]: Without dead ends: 10502 [2019-11-19 22:00:24,715 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:24,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10502 states. [2019-11-19 22:00:24,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10502 to 10500. [2019-11-19 22:00:24,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10500 states. [2019-11-19 22:00:24,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10500 states to 10500 states and 15618 transitions. [2019-11-19 22:00:24,919 INFO L78 Accepts]: Start accepts. Automaton has 10500 states and 15618 transitions. Word has length 28 [2019-11-19 22:00:24,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:24,919 INFO L462 AbstractCegarLoop]: Abstraction has 10500 states and 15618 transitions. [2019-11-19 22:00:24,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:00:24,920 INFO L276 IsEmpty]: Start isEmpty. Operand 10500 states and 15618 transitions. [2019-11-19 22:00:24,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-19 22:00:24,930 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:24,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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:00:24,931 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:24,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:24,931 INFO L82 PathProgramCache]: Analyzing trace with hash -310322425, now seen corresponding path program 1 times [2019-11-19 22:00:24,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:24,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914005486] [2019-11-19 22:00:24,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:24,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:00:24,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914005486] [2019-11-19 22:00:24,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:24,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:00:24,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610107443] [2019-11-19 22:00:24,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:00:24,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:24,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:00:24,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:24,951 INFO L87 Difference]: Start difference. First operand 10500 states and 15618 transitions. Second operand 3 states. [2019-11-19 22:00:25,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:25,117 INFO L93 Difference]: Finished difference Result 18440 states and 28036 transitions. [2019-11-19 22:00:25,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:00:25,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-19 22:00:25,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:25,151 INFO L225 Difference]: With dead ends: 18440 [2019-11-19 22:00:25,152 INFO L226 Difference]: Without dead ends: 18438 [2019-11-19 22:00:25,158 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:25,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18438 states. [2019-11-19 22:00:25,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18438 to 15364. [2019-11-19 22:00:25,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15364 states. [2019-11-19 22:00:25,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15364 states to 15364 states and 22146 transitions. [2019-11-19 22:00:25,510 INFO L78 Accepts]: Start accepts. Automaton has 15364 states and 22146 transitions. Word has length 28 [2019-11-19 22:00:25,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:25,510 INFO L462 AbstractCegarLoop]: Abstraction has 15364 states and 22146 transitions. [2019-11-19 22:00:25,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:00:25,511 INFO L276 IsEmpty]: Start isEmpty. Operand 15364 states and 22146 transitions. [2019-11-19 22:00:25,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-19 22:00:25,530 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:25,531 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-11-19 22:00:25,531 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:25,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:25,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1898670327, now seen corresponding path program 1 times [2019-11-19 22:00:25,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:25,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587454072] [2019-11-19 22:00:25,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:25,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:00:25,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587454072] [2019-11-19 22:00:25,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:25,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:00:25,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479517690] [2019-11-19 22:00:25,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:00:25,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:25,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:00:25,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:25,553 INFO L87 Difference]: Start difference. First operand 15364 states and 22146 transitions. Second operand 3 states. [2019-11-19 22:00:25,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:25,766 INFO L93 Difference]: Finished difference Result 35592 states and 51588 transitions. [2019-11-19 22:00:25,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:00:25,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-19 22:00:25,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:25,800 INFO L225 Difference]: With dead ends: 35592 [2019-11-19 22:00:25,800 INFO L226 Difference]: Without dead ends: 20486 [2019-11-19 22:00:25,818 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:25,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20486 states. [2019-11-19 22:00:26,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20486 to 20484. [2019-11-19 22:00:26,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20484 states. [2019-11-19 22:00:26,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20484 states to 20484 states and 29442 transitions. [2019-11-19 22:00:26,228 INFO L78 Accepts]: Start accepts. Automaton has 20484 states and 29442 transitions. Word has length 28 [2019-11-19 22:00:26,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:26,229 INFO L462 AbstractCegarLoop]: Abstraction has 20484 states and 29442 transitions. [2019-11-19 22:00:26,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:00:26,229 INFO L276 IsEmpty]: Start isEmpty. Operand 20484 states and 29442 transitions. [2019-11-19 22:00:26,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-19 22:00:26,253 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:26,254 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-11-19 22:00:26,254 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:26,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:26,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1029845804, now seen corresponding path program 1 times [2019-11-19 22:00:26,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:26,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165633256] [2019-11-19 22:00:26,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:26,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:26,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:00:26,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165633256] [2019-11-19 22:00:26,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:26,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:00:26,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901211103] [2019-11-19 22:00:26,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:00:26,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:26,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:00:26,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:26,282 INFO L87 Difference]: Start difference. First operand 20484 states and 29442 transitions. Second operand 3 states. [2019-11-19 22:00:26,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:26,576 INFO L93 Difference]: Finished difference Result 30728 states and 44036 transitions. [2019-11-19 22:00:26,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:00:26,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-19 22:00:26,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:26,611 INFO L225 Difference]: With dead ends: 30728 [2019-11-19 22:00:26,612 INFO L226 Difference]: Without dead ends: 20742 [2019-11-19 22:00:26,623 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:26,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20742 states. [2019-11-19 22:00:26,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20742 to 20740. [2019-11-19 22:00:26,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20740 states. [2019-11-19 22:00:26,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20740 states to 20740 states and 29442 transitions. [2019-11-19 22:00:26,983 INFO L78 Accepts]: Start accepts. Automaton has 20740 states and 29442 transitions. Word has length 29 [2019-11-19 22:00:26,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:26,983 INFO L462 AbstractCegarLoop]: Abstraction has 20740 states and 29442 transitions. [2019-11-19 22:00:26,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:00:26,983 INFO L276 IsEmpty]: Start isEmpty. Operand 20740 states and 29442 transitions. [2019-11-19 22:00:27,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-19 22:00:27,005 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:27,005 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-11-19 22:00:27,006 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:27,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:27,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1270976786, now seen corresponding path program 1 times [2019-11-19 22:00:27,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:27,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238421675] [2019-11-19 22:00:27,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:27,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:00:27,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238421675] [2019-11-19 22:00:27,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:27,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:00:27,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986834828] [2019-11-19 22:00:27,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:00:27,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:27,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:00:27,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:27,050 INFO L87 Difference]: Start difference. First operand 20740 states and 29442 transitions. Second operand 3 states. [2019-11-19 22:00:27,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:27,317 INFO L93 Difference]: Finished difference Result 35848 states and 51972 transitions. [2019-11-19 22:00:27,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:00:27,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-19 22:00:27,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:27,359 INFO L225 Difference]: With dead ends: 35848 [2019-11-19 22:00:27,359 INFO L226 Difference]: Without dead ends: 35846 [2019-11-19 22:00:27,367 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:27,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35846 states. [2019-11-19 22:00:27,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35846 to 30724. [2019-11-19 22:00:27,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30724 states. [2019-11-19 22:00:28,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30724 states to 30724 states and 42242 transitions. [2019-11-19 22:00:28,023 INFO L78 Accepts]: Start accepts. Automaton has 30724 states and 42242 transitions. Word has length 29 [2019-11-19 22:00:28,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:28,023 INFO L462 AbstractCegarLoop]: Abstraction has 30724 states and 42242 transitions. [2019-11-19 22:00:28,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:00:28,023 INFO L276 IsEmpty]: Start isEmpty. Operand 30724 states and 42242 transitions. [2019-11-19 22:00:28,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-19 22:00:28,059 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:28,060 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-11-19 22:00:28,060 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:28,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:28,060 INFO L82 PathProgramCache]: Analyzing trace with hash -317371116, now seen corresponding path program 1 times [2019-11-19 22:00:28,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:28,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104697379] [2019-11-19 22:00:28,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:28,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:28,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:00:28,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104697379] [2019-11-19 22:00:28,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:28,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:00:28,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679703610] [2019-11-19 22:00:28,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:00:28,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:28,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:00:28,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:28,079 INFO L87 Difference]: Start difference. First operand 30724 states and 42242 transitions. Second operand 3 states. [2019-11-19 22:00:28,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:28,450 INFO L93 Difference]: Finished difference Result 70664 states and 97540 transitions. [2019-11-19 22:00:28,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:00:28,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-19 22:00:28,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:28,503 INFO L225 Difference]: With dead ends: 70664 [2019-11-19 22:00:28,503 INFO L226 Difference]: Without dead ends: 40454 [2019-11-19 22:00:28,532 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:28,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40454 states. [2019-11-19 22:00:29,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40454 to 40452. [2019-11-19 22:00:29,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40452 states. [2019-11-19 22:00:29,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40452 states to 40452 states and 55298 transitions. [2019-11-19 22:00:29,461 INFO L78 Accepts]: Start accepts. Automaton has 40452 states and 55298 transitions. Word has length 29 [2019-11-19 22:00:29,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:29,462 INFO L462 AbstractCegarLoop]: Abstraction has 40452 states and 55298 transitions. [2019-11-19 22:00:29,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:00:29,462 INFO L276 IsEmpty]: Start isEmpty. Operand 40452 states and 55298 transitions. [2019-11-19 22:00:29,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-19 22:00:29,485 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:29,485 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-11-19 22:00:29,486 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:29,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:29,486 INFO L82 PathProgramCache]: Analyzing trace with hash 745789822, now seen corresponding path program 1 times [2019-11-19 22:00:29,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:29,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950346236] [2019-11-19 22:00:29,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:29,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:29,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:00:29,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950346236] [2019-11-19 22:00:29,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:29,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:00:29,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671765041] [2019-11-19 22:00:29,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:00:29,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:29,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:00:29,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:29,512 INFO L87 Difference]: Start difference. First operand 40452 states and 55298 transitions. Second operand 3 states. [2019-11-19 22:00:29,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:29,848 INFO L93 Difference]: Finished difference Result 60680 states and 82692 transitions. [2019-11-19 22:00:29,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:00:29,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-19 22:00:29,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:29,901 INFO L225 Difference]: With dead ends: 60680 [2019-11-19 22:00:29,901 INFO L226 Difference]: Without dead ends: 40966 [2019-11-19 22:00:29,917 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:29,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40966 states. [2019-11-19 22:00:30,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40966 to 40964. [2019-11-19 22:00:30,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40964 states. [2019-11-19 22:00:30,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40964 states to 40964 states and 55298 transitions. [2019-11-19 22:00:30,855 INFO L78 Accepts]: Start accepts. Automaton has 40964 states and 55298 transitions. Word has length 30 [2019-11-19 22:00:30,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:30,855 INFO L462 AbstractCegarLoop]: Abstraction has 40964 states and 55298 transitions. [2019-11-19 22:00:30,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:00:30,855 INFO L276 IsEmpty]: Start isEmpty. Operand 40964 states and 55298 transitions. [2019-11-19 22:00:30,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-19 22:00:30,877 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:30,877 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-11-19 22:00:30,877 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:30,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:30,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1248354884, now seen corresponding path program 1 times [2019-11-19 22:00:30,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:30,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772065575] [2019-11-19 22:00:30,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:30,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:30,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:00:30,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772065575] [2019-11-19 22:00:30,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:30,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:00:30,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792578410] [2019-11-19 22:00:30,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:00:30,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:30,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:00:30,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:30,901 INFO L87 Difference]: Start difference. First operand 40964 states and 55298 transitions. Second operand 3 states. [2019-11-19 22:00:31,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:31,530 INFO L93 Difference]: Finished difference Result 119816 states and 159748 transitions. [2019-11-19 22:00:31,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:00:31,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-19 22:00:31,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:31,625 INFO L225 Difference]: With dead ends: 119816 [2019-11-19 22:00:31,625 INFO L226 Difference]: Without dead ends: 79878 [2019-11-19 22:00:31,656 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:31,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79878 states. [2019-11-19 22:00:33,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79878 to 79876. [2019-11-19 22:00:33,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79876 states. [2019-11-19 22:00:33,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79876 states to 79876 states and 104450 transitions. [2019-11-19 22:00:33,342 INFO L78 Accepts]: Start accepts. Automaton has 79876 states and 104450 transitions. Word has length 30 [2019-11-19 22:00:33,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:33,342 INFO L462 AbstractCegarLoop]: Abstraction has 79876 states and 104450 transitions. [2019-11-19 22:00:33,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:00:33,342 INFO L276 IsEmpty]: Start isEmpty. Operand 79876 states and 104450 transitions. [2019-11-19 22:00:33,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-19 22:00:33,388 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:33,389 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-11-19 22:00:33,389 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:33,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:33,389 INFO L82 PathProgramCache]: Analyzing trace with hash 339993018, now seen corresponding path program 1 times [2019-11-19 22:00:33,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:33,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611573240] [2019-11-19 22:00:33,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:33,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:00:33,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611573240] [2019-11-19 22:00:33,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:33,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:00:33,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420156855] [2019-11-19 22:00:33,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:00:33,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:33,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:00:33,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:33,408 INFO L87 Difference]: Start difference. First operand 79876 states and 104450 transitions. Second operand 3 states. [2019-11-19 22:00:34,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:34,163 INFO L93 Difference]: Finished difference Result 88072 states and 118788 transitions. [2019-11-19 22:00:34,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:00:34,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-19 22:00:34,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:34,265 INFO L225 Difference]: With dead ends: 88072 [2019-11-19 22:00:34,265 INFO L226 Difference]: Without dead ends: 88070 [2019-11-19 22:00:34,284 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:34,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88070 states. [2019-11-19 22:00:36,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88070 to 79876. [2019-11-19 22:00:36,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79876 states. [2019-11-19 22:00:36,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79876 states to 79876 states and 103426 transitions. [2019-11-19 22:00:36,125 INFO L78 Accepts]: Start accepts. Automaton has 79876 states and 103426 transitions. Word has length 30 [2019-11-19 22:00:36,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:36,125 INFO L462 AbstractCegarLoop]: Abstraction has 79876 states and 103426 transitions. [2019-11-19 22:00:36,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:00:36,125 INFO L276 IsEmpty]: Start isEmpty. Operand 79876 states and 103426 transitions. [2019-11-19 22:00:36,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-19 22:00:36,162 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:36,162 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-11-19 22:00:36,162 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:36,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:36,163 INFO L82 PathProgramCache]: Analyzing trace with hash -44080279, now seen corresponding path program 1 times [2019-11-19 22:00:36,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:36,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458369149] [2019-11-19 22:00:36,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:36,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:00:36,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458369149] [2019-11-19 22:00:36,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:36,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:00:36,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760696772] [2019-11-19 22:00:36,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:00:36,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:36,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:00:36,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:36,186 INFO L87 Difference]: Start difference. First operand 79876 states and 103426 transitions. Second operand 3 states. [2019-11-19 22:00:37,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:37,824 INFO L93 Difference]: Finished difference Result 134152 states and 176132 transitions. [2019-11-19 22:00:37,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:00:37,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-19 22:00:37,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:37,926 INFO L225 Difference]: With dead ends: 134152 [2019-11-19 22:00:37,926 INFO L226 Difference]: Without dead ends: 134150 [2019-11-19 22:00:37,935 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:38,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134150 states. [2019-11-19 22:00:39,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134150 to 121860. [2019-11-19 22:00:39,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121860 states. [2019-11-19 22:00:42,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121860 states to 121860 states and 153602 transitions. [2019-11-19 22:00:42,601 INFO L78 Accepts]: Start accepts. Automaton has 121860 states and 153602 transitions. Word has length 31 [2019-11-19 22:00:42,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:42,602 INFO L462 AbstractCegarLoop]: Abstraction has 121860 states and 153602 transitions. [2019-11-19 22:00:42,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:00:42,602 INFO L276 IsEmpty]: Start isEmpty. Operand 121860 states and 153602 transitions. [2019-11-19 22:00:42,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-19 22:00:42,663 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:42,663 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-11-19 22:00:42,663 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:42,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:42,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1632428181, now seen corresponding path program 1 times [2019-11-19 22:00:42,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:42,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361771155] [2019-11-19 22:00:42,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:42,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:00:42,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361771155] [2019-11-19 22:00:42,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:42,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:00:42,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830002523] [2019-11-19 22:00:42,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:00:42,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:42,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:00:42,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:42,682 INFO L87 Difference]: Start difference. First operand 121860 states and 153602 transitions. Second operand 3 states. [2019-11-19 22:00:43,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:43,649 INFO L93 Difference]: Finished difference Result 277512 states and 350212 transitions. [2019-11-19 22:00:43,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:00:43,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-19 22:00:43,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:43,786 INFO L225 Difference]: With dead ends: 277512 [2019-11-19 22:00:43,786 INFO L226 Difference]: Without dead ends: 156678 [2019-11-19 22:00:43,842 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:43,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156678 states. [2019-11-19 22:00:45,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156678 to 156676. [2019-11-19 22:00:45,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156676 states. [2019-11-19 22:00:46,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156676 states to 156676 states and 194562 transitions. [2019-11-19 22:00:46,042 INFO L78 Accepts]: Start accepts. Automaton has 156676 states and 194562 transitions. Word has length 31 [2019-11-19 22:00:46,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:46,042 INFO L462 AbstractCegarLoop]: Abstraction has 156676 states and 194562 transitions. [2019-11-19 22:00:46,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:00:46,042 INFO L276 IsEmpty]: Start isEmpty. Operand 156676 states and 194562 transitions. [2019-11-19 22:00:46,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-19 22:00:46,107 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:46,107 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-11-19 22:00:46,107 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:46,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:46,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1366272847, now seen corresponding path program 1 times [2019-11-19 22:00:46,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:46,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481675875] [2019-11-19 22:00:46,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:46,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:46,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:00:46,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481675875] [2019-11-19 22:00:46,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:46,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:00:46,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137539397] [2019-11-19 22:00:46,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:00:46,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:46,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:00:46,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:46,130 INFO L87 Difference]: Start difference. First operand 156676 states and 194562 transitions. Second operand 3 states. [2019-11-19 22:00:47,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:47,144 INFO L93 Difference]: Finished difference Result 236552 states and 293892 transitions. [2019-11-19 22:00:47,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:00:47,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-19 22:00:47,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:47,314 INFO L225 Difference]: With dead ends: 236552 [2019-11-19 22:00:47,315 INFO L226 Difference]: Without dead ends: 159750 [2019-11-19 22:00:47,358 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:47,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159750 states. [2019-11-19 22:00:49,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159750 to 159748. [2019-11-19 22:00:49,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159748 states. [2019-11-19 22:00:49,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159748 states to 159748 states and 196610 transitions. [2019-11-19 22:00:49,746 INFO L78 Accepts]: Start accepts. Automaton has 159748 states and 196610 transitions. Word has length 32 [2019-11-19 22:00:49,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:49,746 INFO L462 AbstractCegarLoop]: Abstraction has 159748 states and 196610 transitions. [2019-11-19 22:00:49,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:00:49,747 INFO L276 IsEmpty]: Start isEmpty. Operand 159748 states and 196610 transitions. [2019-11-19 22:00:49,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-19 22:00:49,814 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:49,814 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-11-19 22:00:49,814 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:49,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:49,814 INFO L82 PathProgramCache]: Analyzing trace with hash 934549743, now seen corresponding path program 1 times [2019-11-19 22:00:49,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:49,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145375550] [2019-11-19 22:00:49,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:49,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-11-19 22:00:49,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145375550] [2019-11-19 22:00:49,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:49,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:00:49,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722060059] [2019-11-19 22:00:49,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:00:49,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:49,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:00:49,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:49,832 INFO L87 Difference]: Start difference. First operand 159748 states and 196610 transitions. Second operand 3 states. [2019-11-19 22:00:51,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:51,298 INFO L93 Difference]: Finished difference Result 262152 states and 323588 transitions. [2019-11-19 22:00:51,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:00:51,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-19 22:00:51,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:51,569 INFO L225 Difference]: With dead ends: 262152 [2019-11-19 22:00:51,569 INFO L226 Difference]: Without dead ends: 262150 [2019-11-19 22:00:51,613 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:51,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262150 states. [2019-11-19 22:00:54,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262150 to 245764. [2019-11-19 22:00:54,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245764 states. [2019-11-19 22:00:54,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245764 states to 245764 states and 294914 transitions. [2019-11-19 22:00:54,964 INFO L78 Accepts]: Start accepts. Automaton has 245764 states and 294914 transitions. Word has length 32 [2019-11-19 22:00:54,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:54,965 INFO L462 AbstractCegarLoop]: Abstraction has 245764 states and 294914 transitions. [2019-11-19 22:00:54,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:00:54,965 INFO L276 IsEmpty]: Start isEmpty. Operand 245764 states and 294914 transitions. [2019-11-19 22:00:55,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-19 22:00:55,090 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:55,091 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-11-19 22:00:55,091 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:55,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:55,091 INFO L82 PathProgramCache]: Analyzing trace with hash -653798159, now seen corresponding path program 1 times [2019-11-19 22:00:55,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:55,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599127263] [2019-11-19 22:00:55,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:55,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:55,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:00:55,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599127263] [2019-11-19 22:00:55,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:55,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:00:55,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315148698] [2019-11-19 22:00:55,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:00:55,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:55,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:00:55,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:55,113 INFO L87 Difference]: Start difference. First operand 245764 states and 294914 transitions. Second operand 3 states. [2019-11-19 22:00:57,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:57,747 INFO L93 Difference]: Finished difference Result 552968 states and 659460 transitions. [2019-11-19 22:00:57,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:00:57,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-19 22:00:57,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:58,013 INFO L225 Difference]: With dead ends: 552968 [2019-11-19 22:00:58,013 INFO L226 Difference]: Without dead ends: 311302 [2019-11-19 22:00:58,090 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:58,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311302 states. [2019-11-19 22:01:02,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311302 to 311300. [2019-11-19 22:01:02,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311300 states. [2019-11-19 22:01:02,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311300 states to 311300 states and 364546 transitions. [2019-11-19 22:01:02,632 INFO L78 Accepts]: Start accepts. Automaton has 311300 states and 364546 transitions. Word has length 32 [2019-11-19 22:01:02,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:01:02,633 INFO L462 AbstractCegarLoop]: Abstraction has 311300 states and 364546 transitions. [2019-11-19 22:01:02,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:01:02,633 INFO L276 IsEmpty]: Start isEmpty. Operand 311300 states and 364546 transitions. [2019-11-19 22:01:02,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-19 22:01:02,767 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:01:02,767 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-11-19 22:01:02,768 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:01:02,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:01:02,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1093512896, now seen corresponding path program 1 times [2019-11-19 22:01:02,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:01:02,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478438744] [2019-11-19 22:01:02,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:01:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:02,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:01:02,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478438744] [2019-11-19 22:01:02,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:01:02,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:01:02,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165723207] [2019-11-19 22:01:02,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:01:02,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:01:02,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:01:02,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:01:02,790 INFO L87 Difference]: Start difference. First operand 311300 states and 364546 transitions. Second operand 3 states. [2019-11-19 22:01:10,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:01:10,146 INFO L93 Difference]: Finished difference Result 466952 states and 544772 transitions. [2019-11-19 22:01:10,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:01:10,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-19 22:01:10,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:01:10,420 INFO L225 Difference]: With dead ends: 466952 [2019-11-19 22:01:10,420 INFO L226 Difference]: Without dead ends: 315398 [2019-11-19 22:01:10,451 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:01:10,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315398 states. [2019-11-19 22:01:14,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315398 to 315396. [2019-11-19 22:01:14,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315396 states. [2019-11-19 22:01:14,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315396 states to 315396 states and 364546 transitions. [2019-11-19 22:01:14,379 INFO L78 Accepts]: Start accepts. Automaton has 315396 states and 364546 transitions. Word has length 33 [2019-11-19 22:01:14,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:01:14,379 INFO L462 AbstractCegarLoop]: Abstraction has 315396 states and 364546 transitions. [2019-11-19 22:01:14,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:01:14,379 INFO L276 IsEmpty]: Start isEmpty. Operand 315396 states and 364546 transitions. [2019-11-19 22:01:14,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-19 22:01:14,513 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:01:14,513 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-11-19 22:01:14,514 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:01:14,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:01:14,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1207309694, now seen corresponding path program 1 times [2019-11-19 22:01:14,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:01:14,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128433583] [2019-11-19 22:01:14,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:01:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:14,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:01:14,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128433583] [2019-11-19 22:01:14,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:01:14,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:01:14,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179804694] [2019-11-19 22:01:14,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:01:14,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:01:14,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:01:14,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:01:14,541 INFO L87 Difference]: Start difference. First operand 315396 states and 364546 transitions. Second operand 3 states. [2019-11-19 22:01:18,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:01:18,569 INFO L93 Difference]: Finished difference Result 507910 states and 581635 transitions. [2019-11-19 22:01:18,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:01:18,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-19 22:01:18,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:01:18,985 INFO L225 Difference]: With dead ends: 507910 [2019-11-19 22:01:18,985 INFO L226 Difference]: Without dead ends: 507908 [2019-11-19 22:01:19,022 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:01:19,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507908 states. [2019-11-19 22:01:24,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507908 to 491524. [2019-11-19 22:01:24,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491524 states. [2019-11-19 22:01:25,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491524 states to 491524 states and 557058 transitions. [2019-11-19 22:01:25,767 INFO L78 Accepts]: Start accepts. Automaton has 491524 states and 557058 transitions. Word has length 33 [2019-11-19 22:01:25,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:01:25,767 INFO L462 AbstractCegarLoop]: Abstraction has 491524 states and 557058 transitions. [2019-11-19 22:01:25,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:01:25,767 INFO L276 IsEmpty]: Start isEmpty. Operand 491524 states and 557058 transitions. [2019-11-19 22:01:26,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-19 22:01:26,014 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:01:26,015 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-11-19 22:01:26,015 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:01:26,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:01:26,015 INFO L82 PathProgramCache]: Analyzing trace with hash -381038208, now seen corresponding path program 1 times [2019-11-19 22:01:26,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:01:26,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373790816] [2019-11-19 22:01:26,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:01:26,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:26,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:01:26,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373790816] [2019-11-19 22:01:26,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:01:26,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:01:26,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653991652] [2019-11-19 22:01:26,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:01:26,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:01:26,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:01:26,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:01:26,033 INFO L87 Difference]: Start difference. First operand 491524 states and 557058 transitions. Second operand 3 states. [2019-11-19 22:01:36,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:01:36,535 INFO L93 Difference]: Finished difference Result 1097732 states and 1228802 transitions. [2019-11-19 22:01:36,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:01:36,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-19 22:01:36,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:01:36,536 INFO L225 Difference]: With dead ends: 1097732 [2019-11-19 22:01:36,536 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 22:01:36,710 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:01:36,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 22:01:36,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 22:01:36,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 22:01:36,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 22:01:36,711 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2019-11-19 22:01:36,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:01:36,712 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 22:01:36,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:01:36,712 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 22:01:36,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 22:01:36,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 22:01:36,775 INFO L444 ceAbstractionStarter]: For program point L184-1(lines 51 214) no Hoare annotation was computed. [2019-11-19 22:01:36,775 INFO L444 ceAbstractionStarter]: For program point L118-1(lines 51 214) no Hoare annotation was computed. [2019-11-19 22:01:36,775 INFO L444 ceAbstractionStarter]: For program point L102-1(lines 51 214) no Hoare annotation was computed. [2019-11-19 22:01:36,775 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 22:01:36,775 INFO L447 ceAbstractionStarter]: At program point L218(lines 4 219) the Hoare annotation is: true [2019-11-19 22:01:36,776 INFO L444 ceAbstractionStarter]: For program point L185(line 185) no Hoare annotation was computed. [2019-11-19 22:01:36,776 INFO L444 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2019-11-19 22:01:36,776 INFO L444 ceAbstractionStarter]: For program point L53(lines 53 55) no Hoare annotation was computed. [2019-11-19 22:01:36,776 INFO L444 ceAbstractionStarter]: For program point L86-2(lines 51 214) no Hoare annotation was computed. [2019-11-19 22:01:36,776 INFO L444 ceAbstractionStarter]: For program point L169-1(lines 51 214) no Hoare annotation was computed. [2019-11-19 22:01:36,776 INFO L444 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2019-11-19 22:01:36,776 INFO L444 ceAbstractionStarter]: For program point L154-1(lines 51 214) no Hoare annotation was computed. [2019-11-19 22:01:36,776 INFO L444 ceAbstractionStarter]: For program point L204-1(lines 51 214) no Hoare annotation was computed. [2019-11-19 22:01:36,776 INFO L444 ceAbstractionStarter]: For program point L138-1(lines 51 214) no Hoare annotation was computed. [2019-11-19 22:01:36,776 INFO L444 ceAbstractionStarter]: For program point L155(line 155) no Hoare annotation was computed. [2019-11-19 22:01:36,776 INFO L444 ceAbstractionStarter]: For program point L122-1(lines 51 214) no Hoare annotation was computed. [2019-11-19 22:01:36,776 INFO L444 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-11-19 22:01:36,777 INFO L444 ceAbstractionStarter]: For program point L106-1(lines 51 214) no Hoare annotation was computed. [2019-11-19 22:01:36,777 INFO L444 ceAbstractionStarter]: For program point L189-1(lines 51 214) no Hoare annotation was computed. [2019-11-19 22:01:36,777 INFO L444 ceAbstractionStarter]: For program point L90-1(lines 51 214) no Hoare annotation was computed. [2019-11-19 22:01:36,777 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 22:01:36,777 INFO L444 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-19 22:01:36,777 INFO L444 ceAbstractionStarter]: For program point L174-1(lines 51 214) no Hoare annotation was computed. [2019-11-19 22:01:36,777 INFO L444 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-19 22:01:36,777 INFO L444 ceAbstractionStarter]: For program point L159-1(lines 51 214) no Hoare annotation was computed. [2019-11-19 22:01:36,777 INFO L444 ceAbstractionStarter]: For program point L126-1(lines 51 214) no Hoare annotation was computed. [2019-11-19 22:01:36,777 INFO L447 ceAbstractionStarter]: At program point L209-1(lines 51 214) the Hoare annotation is: true [2019-11-19 22:01:36,777 INFO L444 ceAbstractionStarter]: For program point L110-1(lines 51 214) no Hoare annotation was computed. [2019-11-19 22:01:36,777 INFO L444 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-19 22:01:36,778 INFO L444 ceAbstractionStarter]: For program point L94-1(lines 51 214) no Hoare annotation was computed. [2019-11-19 22:01:36,778 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 22:01:36,778 INFO L444 ceAbstractionStarter]: For program point L210(line 210) no Hoare annotation was computed. [2019-11-19 22:01:36,778 INFO L440 ceAbstractionStarter]: At program point L210-1(lines 5 219) the Hoare annotation is: false [2019-11-19 22:01:36,778 INFO L444 ceAbstractionStarter]: For program point L144-1(lines 51 214) no Hoare annotation was computed. [2019-11-19 22:01:36,778 INFO L444 ceAbstractionStarter]: For program point L194-1(lines 51 214) no Hoare annotation was computed. [2019-11-19 22:01:36,778 INFO L444 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-19 22:01:36,778 INFO L444 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-11-19 22:01:36,778 INFO L444 ceAbstractionStarter]: For program point L179-1(lines 51 214) no Hoare annotation was computed. [2019-11-19 22:01:36,778 INFO L444 ceAbstractionStarter]: For program point L130-1(lines 51 214) no Hoare annotation was computed. [2019-11-19 22:01:36,778 INFO L444 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-11-19 22:01:36,779 INFO L444 ceAbstractionStarter]: For program point L114-1(lines 51 214) no Hoare annotation was computed. [2019-11-19 22:01:36,779 INFO L444 ceAbstractionStarter]: For program point L164-1(lines 51 214) no Hoare annotation was computed. [2019-11-19 22:01:36,779 INFO L444 ceAbstractionStarter]: For program point L98-1(lines 51 214) no Hoare annotation was computed. [2019-11-19 22:01:36,779 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 217) no Hoare annotation was computed. [2019-11-19 22:01:36,779 INFO L444 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-11-19 22:01:36,779 INFO L447 ceAbstractionStarter]: At program point L215(lines 5 219) the Hoare annotation is: true [2019-11-19 22:01:36,779 INFO L444 ceAbstractionStarter]: For program point L149-1(lines 51 214) no Hoare annotation was computed. [2019-11-19 22:01:36,779 INFO L444 ceAbstractionStarter]: For program point L199-1(lines 51 214) no Hoare annotation was computed. [2019-11-19 22:01:36,779 INFO L444 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-11-19 22:01:36,779 INFO L444 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2019-11-19 22:01:36,779 INFO L444 ceAbstractionStarter]: For program point L134-1(lines 51 214) no Hoare annotation was computed. [2019-11-19 22:01:36,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:01:36 BoogieIcfgContainer [2019-11-19 22:01:36,789 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 22:01:36,790 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 22:01:36,790 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 22:01:36,790 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 22:01:36,791 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:00:20" (3/4) ... [2019-11-19 22:01:36,794 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 22:01:36,810 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-19 22:01:36,810 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 22:01:36,911 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_5950aa31-2755-4f96-a0b2-f7c81beed7e5/bin/uautomizer/witness.graphml [2019-11-19 22:01:36,911 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 22:01:36,914 INFO L168 Benchmark]: Toolchain (without parser) took 77298.82 ms. Allocated memory was 1.0 GB in the beginning and 6.3 GB in the end (delta: 5.3 GB). Free memory was 951.5 MB in the beginning and 4.0 GB in the end (delta: -3.0 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2019-11-19 22:01:36,914 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:01:36,915 INFO L168 Benchmark]: CACSL2BoogieTranslator took 418.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 951.5 MB in the beginning and 1.1 GB in the end (delta: -173.9 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2019-11-19 22:01:36,915 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:01:36,915 INFO L168 Benchmark]: Boogie Preprocessor took 27.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-19 22:01:36,916 INFO L168 Benchmark]: RCFGBuilder took 575.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2019-11-19 22:01:36,916 INFO L168 Benchmark]: TraceAbstraction took 76095.90 ms. Allocated memory was 1.2 GB in the beginning and 6.3 GB in the end (delta: 5.2 GB). Free memory was 1.1 GB in the beginning and 4.0 GB in the end (delta: -2.9 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2019-11-19 22:01:36,916 INFO L168 Benchmark]: Witness Printer took 121.32 ms. Allocated memory is still 6.3 GB. Free memory was 4.0 GB in the beginning and 4.0 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-19 22:01:36,918 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.36 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 418.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 951.5 MB in the beginning and 1.1 GB in the end (delta: -173.9 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 575.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 76095.90 ms. Allocated memory was 1.2 GB in the beginning and 6.3 GB in the end (delta: 5.2 GB). Free memory was 1.1 GB in the beginning and 4.0 GB in the end (delta: -2.9 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. * Witness Printer took 121.32 ms. Allocated memory is still 6.3 GB. Free memory was 4.0 GB in the beginning and 4.0 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 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: 76.0s, OverallIterations: 39, TraceHistogramMax: 1, AutomataDifference: 36.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4378 SDtfs, 2248 SDslu, 2956 SDs, 0 SdLazy, 207 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s 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: 36.6s 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.2s SatisfiabilityAnalysisTime, 0.7s 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...