./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_8.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a4b29d10-2b05-42fe-a2e4-adcff5aa8192/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a4b29d10-2b05-42fe-a2e4-adcff5aa8192/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a4b29d10-2b05-42fe-a2e4-adcff5aa8192/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a4b29d10-2b05-42fe-a2e4-adcff5aa8192/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_8.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a4b29d10-2b05-42fe-a2e4-adcff5aa8192/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a4b29d10-2b05-42fe-a2e4-adcff5aa8192/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 f2cbbf56a13532141372a32a461d64a9d1351c0e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:25:59,170 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:25:59,171 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:25:59,178 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:25:59,179 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:25:59,179 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:25:59,180 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:25:59,182 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:25:59,183 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:25:59,183 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:25:59,184 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:25:59,185 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:25:59,185 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:25:59,186 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:25:59,186 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:25:59,187 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:25:59,188 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:25:59,188 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:25:59,189 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:25:59,191 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:25:59,192 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:25:59,193 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:25:59,193 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:25:59,194 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:25:59,195 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:25:59,196 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:25:59,196 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:25:59,196 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:25:59,196 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:25:59,197 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:25:59,197 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:25:59,198 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:25:59,198 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:25:59,198 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:25:59,199 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:25:59,199 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:25:59,200 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:25:59,200 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:25:59,200 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:25:59,200 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:25:59,201 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:25:59,201 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a4b29d10-2b05-42fe-a2e4-adcff5aa8192/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:25:59,210 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:25:59,211 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:25:59,211 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:25:59,211 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:25:59,212 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:25:59,212 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:25:59,212 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:25:59,212 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:25:59,212 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:25:59,212 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:25:59,212 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:25:59,212 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:25:59,213 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:25:59,213 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:25:59,213 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:25:59,213 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:25:59,213 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:25:59,213 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:25:59,213 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:25:59,213 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:25:59,214 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:25:59,214 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:25:59,214 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:25:59,214 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:25:59,214 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:25:59,214 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:25:59,214 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:25:59,214 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:25:59,215 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:25:59,215 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_a4b29d10-2b05-42fe-a2e4-adcff5aa8192/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 -> f2cbbf56a13532141372a32a461d64a9d1351c0e [2019-12-07 17:25:59,313 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:25:59,320 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:25:59,322 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:25:59,323 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:25:59,323 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:25:59,324 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a4b29d10-2b05-42fe-a2e4-adcff5aa8192/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_8.c [2019-12-07 17:25:59,360 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a4b29d10-2b05-42fe-a2e4-adcff5aa8192/bin/uautomizer/data/e285c09b0/90a46e4afc5349b99dc95b0cb0532c3f/FLAG115b69087 [2019-12-07 17:25:59,785 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:25:59,785 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a4b29d10-2b05-42fe-a2e4-adcff5aa8192/sv-benchmarks/c/locks/test_locks_8.c [2019-12-07 17:25:59,790 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a4b29d10-2b05-42fe-a2e4-adcff5aa8192/bin/uautomizer/data/e285c09b0/90a46e4afc5349b99dc95b0cb0532c3f/FLAG115b69087 [2019-12-07 17:25:59,799 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a4b29d10-2b05-42fe-a2e4-adcff5aa8192/bin/uautomizer/data/e285c09b0/90a46e4afc5349b99dc95b0cb0532c3f [2019-12-07 17:25:59,801 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:25:59,802 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:25:59,802 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:25:59,802 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:25:59,804 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:25:59,805 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:25:59" (1/1) ... [2019-12-07 17:25:59,807 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20cc73ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:25:59, skipping insertion in model container [2019-12-07 17:25:59,807 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:25:59" (1/1) ... [2019-12-07 17:25:59,812 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:25:59,825 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:25:59,929 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:25:59,931 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:25:59,982 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:25:59,992 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:25:59,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:25:59 WrapperNode [2019-12-07 17:25:59,993 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:25:59,993 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:25:59,993 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:25:59,994 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:25:59,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:25:59" (1/1) ... [2019-12-07 17:26:00,003 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:25:59" (1/1) ... [2019-12-07 17:26:00,018 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:26:00,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:26:00,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:26:00,019 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:26:00,025 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:25:59" (1/1) ... [2019-12-07 17:26:00,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:25:59" (1/1) ... [2019-12-07 17:26:00,026 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:25:59" (1/1) ... [2019-12-07 17:26:00,026 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:25:59" (1/1) ... [2019-12-07 17:26:00,028 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:25:59" (1/1) ... [2019-12-07 17:26:00,033 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:25:59" (1/1) ... [2019-12-07 17:26:00,034 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:25:59" (1/1) ... [2019-12-07 17:26:00,036 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:26:00,036 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:26:00,037 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:26:00,037 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:26:00,037 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:25:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4b29d10-2b05-42fe-a2e4-adcff5aa8192/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:26:00,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:26:00,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:26:00,243 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:26:00,244 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-12-07 17:26:00,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:26:00 BoogieIcfgContainer [2019-12-07 17:26:00,245 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:26:00,245 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:26:00,245 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:26:00,247 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:26:00,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:25:59" (1/3) ... [2019-12-07 17:26:00,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45dd6c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:26:00, skipping insertion in model container [2019-12-07 17:26:00,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:25:59" (2/3) ... [2019-12-07 17:26:00,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45dd6c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:26:00, skipping insertion in model container [2019-12-07 17:26:00,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:26:00" (3/3) ... [2019-12-07 17:26:00,249 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2019-12-07 17:26:00,256 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:26:00,260 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 17:26:00,267 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 17:26:00,282 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:26:00,282 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:26:00,282 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:26:00,282 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:26:00,282 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:26:00,282 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:26:00,282 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:26:00,282 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:26:00,293 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-12-07 17:26:00,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:26:00,297 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:26:00,298 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:26:00,298 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:26:00,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:26:00,301 INFO L82 PathProgramCache]: Analyzing trace with hash -2043472865, now seen corresponding path program 1 times [2019-12-07 17:26:00,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:26:00,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219735775] [2019-12-07 17:26:00,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:26:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:00,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:26:00,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219735775] [2019-12-07 17:26:00,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:26:00,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:26:00,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483296927] [2019-12-07 17:26:00,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:26:00,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:26:00,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:26:00,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:00,430 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2019-12-07 17:26:00,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:26:00,458 INFO L93 Difference]: Finished difference Result 70 states and 120 transitions. [2019-12-07 17:26:00,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:26:00,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 17:26:00,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:26:00,466 INFO L225 Difference]: With dead ends: 70 [2019-12-07 17:26:00,467 INFO L226 Difference]: Without dead ends: 56 [2019-12-07 17:26:00,468 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:00,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-12-07 17:26:00,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 38. [2019-12-07 17:26:00,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-07 17:26:00,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 69 transitions. [2019-12-07 17:26:00,493 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 69 transitions. Word has length 14 [2019-12-07 17:26:00,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:26:00,494 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 69 transitions. [2019-12-07 17:26:00,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:26:00,494 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 69 transitions. [2019-12-07 17:26:00,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:26:00,494 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:26:00,494 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:26:00,495 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:26:00,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:26:00,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1342408287, now seen corresponding path program 1 times [2019-12-07 17:26:00,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:26:00,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166595321] [2019-12-07 17:26:00,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:26:00,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:00,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:26:00,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166595321] [2019-12-07 17:26:00,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:26:00,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:26:00,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388531009] [2019-12-07 17:26:00,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:26:00,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:26:00,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:26:00,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:00,526 INFO L87 Difference]: Start difference. First operand 38 states and 69 transitions. Second operand 3 states. [2019-12-07 17:26:00,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:26:00,541 INFO L93 Difference]: Finished difference Result 93 states and 168 transitions. [2019-12-07 17:26:00,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:26:00,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 17:26:00,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:26:00,542 INFO L225 Difference]: With dead ends: 93 [2019-12-07 17:26:00,542 INFO L226 Difference]: Without dead ends: 56 [2019-12-07 17:26:00,543 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:00,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-12-07 17:26:00,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2019-12-07 17:26:00,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-07 17:26:00,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 97 transitions. [2019-12-07 17:26:00,548 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 97 transitions. Word has length 14 [2019-12-07 17:26:00,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:26:00,549 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 97 transitions. [2019-12-07 17:26:00,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:26:00,549 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 97 transitions. [2019-12-07 17:26:00,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 17:26:00,549 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:26:00,549 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:26:00,550 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:26:00,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:26:00,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1077064620, now seen corresponding path program 1 times [2019-12-07 17:26:00,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:26:00,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425080333] [2019-12-07 17:26:00,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:26:00,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:00,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:26:00,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425080333] [2019-12-07 17:26:00,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:26:00,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:26:00,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299360845] [2019-12-07 17:26:00,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:26:00,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:26:00,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:26:00,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:00,575 INFO L87 Difference]: Start difference. First operand 54 states and 97 transitions. Second operand 3 states. [2019-12-07 17:26:00,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:26:00,588 INFO L93 Difference]: Finished difference Result 86 states and 149 transitions. [2019-12-07 17:26:00,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:26:00,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 17:26:00,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:26:00,589 INFO L225 Difference]: With dead ends: 86 [2019-12-07 17:26:00,589 INFO L226 Difference]: Without dead ends: 59 [2019-12-07 17:26:00,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:00,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-12-07 17:26:00,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2019-12-07 17:26:00,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-12-07 17:26:00,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 99 transitions. [2019-12-07 17:26:00,595 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 99 transitions. Word has length 15 [2019-12-07 17:26:00,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:26:00,595 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 99 transitions. [2019-12-07 17:26:00,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:26:00,595 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 99 transitions. [2019-12-07 17:26:00,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 17:26:00,596 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:26:00,596 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:26:00,596 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:26:00,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:26:00,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1335230058, now seen corresponding path program 1 times [2019-12-07 17:26:00,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:26:00,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69764527] [2019-12-07 17:26:00,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:26:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:00,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:26:00,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69764527] [2019-12-07 17:26:00,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:26:00,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:26:00,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115536694] [2019-12-07 17:26:00,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:26:00,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:26:00,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:26:00,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:00,618 INFO L87 Difference]: Start difference. First operand 57 states and 99 transitions. Second operand 3 states. [2019-12-07 17:26:00,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:26:00,630 INFO L93 Difference]: Finished difference Result 108 states and 188 transitions. [2019-12-07 17:26:00,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:26:00,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 17:26:00,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:26:00,631 INFO L225 Difference]: With dead ends: 108 [2019-12-07 17:26:00,631 INFO L226 Difference]: Without dead ends: 106 [2019-12-07 17:26:00,632 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:00,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-12-07 17:26:00,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 76. [2019-12-07 17:26:00,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-12-07 17:26:00,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 132 transitions. [2019-12-07 17:26:00,639 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 132 transitions. Word has length 15 [2019-12-07 17:26:00,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:26:00,639 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 132 transitions. [2019-12-07 17:26:00,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:26:00,639 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 132 transitions. [2019-12-07 17:26:00,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 17:26:00,640 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:26:00,640 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:26:00,640 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:26:00,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:26:00,640 INFO L82 PathProgramCache]: Analyzing trace with hash 2036294636, now seen corresponding path program 1 times [2019-12-07 17:26:00,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:26:00,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875908800] [2019-12-07 17:26:00,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:26:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:00,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:26:00,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875908800] [2019-12-07 17:26:00,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:26:00,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:26:00,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486071034] [2019-12-07 17:26:00,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:26:00,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:26:00,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:26:00,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:00,659 INFO L87 Difference]: Start difference. First operand 76 states and 132 transitions. Second operand 3 states. [2019-12-07 17:26:00,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:26:00,670 INFO L93 Difference]: Finished difference Result 180 states and 314 transitions. [2019-12-07 17:26:00,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:26:00,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 17:26:00,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:26:00,671 INFO L225 Difference]: With dead ends: 180 [2019-12-07 17:26:00,671 INFO L226 Difference]: Without dead ends: 108 [2019-12-07 17:26:00,672 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:00,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-12-07 17:26:00,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2019-12-07 17:26:00,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-12-07 17:26:00,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 182 transitions. [2019-12-07 17:26:00,679 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 182 transitions. Word has length 15 [2019-12-07 17:26:00,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:26:00,679 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 182 transitions. [2019-12-07 17:26:00,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:26:00,679 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 182 transitions. [2019-12-07 17:26:00,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:26:00,680 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:26:00,680 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:26:00,680 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:26:00,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:26:00,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1557326826, now seen corresponding path program 1 times [2019-12-07 17:26:00,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:26:00,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514160624] [2019-12-07 17:26:00,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:26:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:00,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:26:00,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514160624] [2019-12-07 17:26:00,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:26:00,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:26:00,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667557525] [2019-12-07 17:26:00,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:26:00,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:26:00,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:26:00,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:00,697 INFO L87 Difference]: Start difference. First operand 106 states and 182 transitions. Second operand 3 states. [2019-12-07 17:26:00,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:26:00,708 INFO L93 Difference]: Finished difference Result 161 states and 273 transitions. [2019-12-07 17:26:00,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:26:00,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 17:26:00,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:26:00,710 INFO L225 Difference]: With dead ends: 161 [2019-12-07 17:26:00,710 INFO L226 Difference]: Without dead ends: 110 [2019-12-07 17:26:00,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-12-07 17:26:00,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-12-07 17:26:00,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2019-12-07 17:26:00,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-12-07 17:26:00,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 182 transitions. [2019-12-07 17:26:00,719 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 182 transitions. Word has length 16 [2019-12-07 17:26:00,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:26:00,719 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 182 transitions. [2019-12-07 17:26:00,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:26:00,719 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 182 transitions. [2019-12-07 17:26:00,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:26:00,720 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:26:00,721 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:26:00,721 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:26:00,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:26:00,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1299161388, now seen corresponding path program 1 times [2019-12-07 17:26:00,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:26:00,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741084073] [2019-12-07 17:26:00,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:26:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:00,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:26:00,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741084073] [2019-12-07 17:26:00,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:26:00,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:26:00,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072135744] [2019-12-07 17:26:00,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:26:00,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:26:00,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:26:00,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:00,743 INFO L87 Difference]: Start difference. First operand 108 states and 182 transitions. Second operand 3 states. [2019-12-07 17:26:00,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:26:00,755 INFO L93 Difference]: Finished difference Result 308 states and 520 transitions. [2019-12-07 17:26:00,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:26:00,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 17:26:00,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:26:00,756 INFO L225 Difference]: With dead ends: 308 [2019-12-07 17:26:00,756 INFO L226 Difference]: Without dead ends: 206 [2019-12-07 17:26:00,757 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:00,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-12-07 17:26:00,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2019-12-07 17:26:00,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-12-07 17:26:00,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 338 transitions. [2019-12-07 17:26:00,767 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 338 transitions. Word has length 16 [2019-12-07 17:26:00,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:26:00,767 INFO L462 AbstractCegarLoop]: Abstraction has 204 states and 338 transitions. [2019-12-07 17:26:00,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:26:00,767 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 338 transitions. [2019-12-07 17:26:00,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:26:00,768 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:26:00,768 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:26:00,768 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:26:00,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:26:00,769 INFO L82 PathProgramCache]: Analyzing trace with hash -2000225966, now seen corresponding path program 1 times [2019-12-07 17:26:00,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:26:00,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364931765] [2019-12-07 17:26:00,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:26:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:00,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:26:00,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364931765] [2019-12-07 17:26:00,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:26:00,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:26:00,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21728369] [2019-12-07 17:26:00,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:26:00,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:26:00,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:26:00,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:00,785 INFO L87 Difference]: Start difference. First operand 204 states and 338 transitions. Second operand 3 states. [2019-12-07 17:26:00,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:26:00,795 INFO L93 Difference]: Finished difference Result 256 states and 428 transitions. [2019-12-07 17:26:00,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:26:00,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 17:26:00,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:26:00,797 INFO L225 Difference]: With dead ends: 256 [2019-12-07 17:26:00,797 INFO L226 Difference]: Without dead ends: 254 [2019-12-07 17:26:00,797 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:00,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-12-07 17:26:00,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 204. [2019-12-07 17:26:00,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-12-07 17:26:00,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 334 transitions. [2019-12-07 17:26:00,805 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 334 transitions. Word has length 16 [2019-12-07 17:26:00,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:26:00,805 INFO L462 AbstractCegarLoop]: Abstraction has 204 states and 334 transitions. [2019-12-07 17:26:00,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:26:00,805 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 334 transitions. [2019-12-07 17:26:00,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:26:00,806 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:26:00,806 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:26:00,806 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:26:00,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:26:00,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1619082687, now seen corresponding path program 1 times [2019-12-07 17:26:00,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:26:00,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838002466] [2019-12-07 17:26:00,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:26:00,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:00,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:26:00,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838002466] [2019-12-07 17:26:00,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:26:00,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:26:00,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879232178] [2019-12-07 17:26:00,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:26:00,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:26:00,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:26:00,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:00,821 INFO L87 Difference]: Start difference. First operand 204 states and 334 transitions. Second operand 3 states. [2019-12-07 17:26:00,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:26:00,833 INFO L93 Difference]: Finished difference Result 372 states and 616 transitions. [2019-12-07 17:26:00,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:26:00,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 17:26:00,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:26:00,835 INFO L225 Difference]: With dead ends: 372 [2019-12-07 17:26:00,835 INFO L226 Difference]: Without dead ends: 370 [2019-12-07 17:26:00,836 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:00,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-12-07 17:26:00,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 288. [2019-12-07 17:26:00,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-12-07 17:26:00,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 462 transitions. [2019-12-07 17:26:00,843 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 462 transitions. Word has length 17 [2019-12-07 17:26:00,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:26:00,844 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 462 transitions. [2019-12-07 17:26:00,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:26:00,844 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 462 transitions. [2019-12-07 17:26:00,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:26:00,845 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:26:00,845 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:26:00,846 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:26:00,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:26:00,846 INFO L82 PathProgramCache]: Analyzing trace with hash -918018109, now seen corresponding path program 1 times [2019-12-07 17:26:00,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:26:00,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958676230] [2019-12-07 17:26:00,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:26:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:00,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:26:00,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958676230] [2019-12-07 17:26:00,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:26:00,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:26:00,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396553206] [2019-12-07 17:26:00,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:26:00,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:26:00,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:26:00,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:00,859 INFO L87 Difference]: Start difference. First operand 288 states and 462 transitions. Second operand 3 states. [2019-12-07 17:26:00,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:26:00,872 INFO L93 Difference]: Finished difference Result 676 states and 1088 transitions. [2019-12-07 17:26:00,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:26:00,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 17:26:00,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:26:00,874 INFO L225 Difference]: With dead ends: 676 [2019-12-07 17:26:00,874 INFO L226 Difference]: Without dead ends: 394 [2019-12-07 17:26:00,875 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:00,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-12-07 17:26:00,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 392. [2019-12-07 17:26:00,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-12-07 17:26:00,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 618 transitions. [2019-12-07 17:26:00,884 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 618 transitions. Word has length 17 [2019-12-07 17:26:00,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:26:00,884 INFO L462 AbstractCegarLoop]: Abstraction has 392 states and 618 transitions. [2019-12-07 17:26:00,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:26:00,884 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 618 transitions. [2019-12-07 17:26:00,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 17:26:00,885 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:26:00,885 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:26:00,885 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:26:00,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:26:00,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1348259273, now seen corresponding path program 1 times [2019-12-07 17:26:00,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:26:00,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357193073] [2019-12-07 17:26:00,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:26:00,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:00,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:26:00,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357193073] [2019-12-07 17:26:00,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:26:00,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:26:00,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765366400] [2019-12-07 17:26:00,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:26:00,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:26:00,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:26:00,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:00,898 INFO L87 Difference]: Start difference. First operand 392 states and 618 transitions. Second operand 3 states. [2019-12-07 17:26:00,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:26:00,911 INFO L93 Difference]: Finished difference Result 596 states and 936 transitions. [2019-12-07 17:26:00,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:26:00,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 17:26:00,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:26:00,913 INFO L225 Difference]: With dead ends: 596 [2019-12-07 17:26:00,913 INFO L226 Difference]: Without dead ends: 406 [2019-12-07 17:26:00,913 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:00,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-12-07 17:26:00,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 404. [2019-12-07 17:26:00,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2019-12-07 17:26:00,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 626 transitions. [2019-12-07 17:26:00,921 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 626 transitions. Word has length 18 [2019-12-07 17:26:00,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:26:00,922 INFO L462 AbstractCegarLoop]: Abstraction has 404 states and 626 transitions. [2019-12-07 17:26:00,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:26:00,922 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 626 transitions. [2019-12-07 17:26:00,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 17:26:00,922 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:26:00,922 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:26:00,922 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:26:00,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:26:00,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1606424711, now seen corresponding path program 1 times [2019-12-07 17:26:00,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:26:00,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687245223] [2019-12-07 17:26:00,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:26:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:00,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:26:00,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687245223] [2019-12-07 17:26:00,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:26:00,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:26:00,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884922476] [2019-12-07 17:26:00,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:26:00,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:26:00,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:26:00,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:00,935 INFO L87 Difference]: Start difference. First operand 404 states and 626 transitions. Second operand 3 states. [2019-12-07 17:26:00,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:26:00,948 INFO L93 Difference]: Finished difference Result 712 states and 1116 transitions. [2019-12-07 17:26:00,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:26:00,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 17:26:00,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:26:00,952 INFO L225 Difference]: With dead ends: 712 [2019-12-07 17:26:00,952 INFO L226 Difference]: Without dead ends: 710 [2019-12-07 17:26:00,953 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:00,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2019-12-07 17:26:00,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 580. [2019-12-07 17:26:00,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-12-07 17:26:00,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 874 transitions. [2019-12-07 17:26:00,964 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 874 transitions. Word has length 18 [2019-12-07 17:26:00,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:26:00,964 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 874 transitions. [2019-12-07 17:26:00,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:26:00,964 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 874 transitions. [2019-12-07 17:26:00,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 17:26:00,965 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:26:00,965 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:26:00,966 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:26:00,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:26:00,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1987478007, now seen corresponding path program 1 times [2019-12-07 17:26:00,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:26:00,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200465204] [2019-12-07 17:26:00,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:26:00,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:00,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:26:00,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200465204] [2019-12-07 17:26:00,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:26:00,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:26:00,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577923939] [2019-12-07 17:26:00,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:26:00,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:26:00,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:26:00,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:00,979 INFO L87 Difference]: Start difference. First operand 580 states and 874 transitions. Second operand 3 states. [2019-12-07 17:26:00,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:26:00,995 INFO L93 Difference]: Finished difference Result 1336 states and 2012 transitions. [2019-12-07 17:26:00,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:26:00,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 17:26:00,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:26:00,998 INFO L225 Difference]: With dead ends: 1336 [2019-12-07 17:26:00,998 INFO L226 Difference]: Without dead ends: 774 [2019-12-07 17:26:00,999 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:01,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2019-12-07 17:26:01,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 772. [2019-12-07 17:26:01,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2019-12-07 17:26:01,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1138 transitions. [2019-12-07 17:26:01,013 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1138 transitions. Word has length 18 [2019-12-07 17:26:01,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:26:01,013 INFO L462 AbstractCegarLoop]: Abstraction has 772 states and 1138 transitions. [2019-12-07 17:26:01,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:26:01,013 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1138 transitions. [2019-12-07 17:26:01,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 17:26:01,014 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:26:01,014 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:26:01,015 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:26:01,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:26:01,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1740226152, now seen corresponding path program 1 times [2019-12-07 17:26:01,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:26:01,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258971375] [2019-12-07 17:26:01,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:26:01,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:01,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:26:01,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258971375] [2019-12-07 17:26:01,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:26:01,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:26:01,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560264968] [2019-12-07 17:26:01,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:26:01,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:26:01,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:26:01,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:01,027 INFO L87 Difference]: Start difference. First operand 772 states and 1138 transitions. Second operand 3 states. [2019-12-07 17:26:01,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:26:01,041 INFO L93 Difference]: Finished difference Result 1160 states and 1700 transitions. [2019-12-07 17:26:01,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:26:01,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 17:26:01,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:26:01,044 INFO L225 Difference]: With dead ends: 1160 [2019-12-07 17:26:01,044 INFO L226 Difference]: Without dead ends: 790 [2019-12-07 17:26:01,045 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:01,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-12-07 17:26:01,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 788. [2019-12-07 17:26:01,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-12-07 17:26:01,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1138 transitions. [2019-12-07 17:26:01,062 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1138 transitions. Word has length 19 [2019-12-07 17:26:01,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:26:01,062 INFO L462 AbstractCegarLoop]: Abstraction has 788 states and 1138 transitions. [2019-12-07 17:26:01,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:26:01,062 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1138 transitions. [2019-12-07 17:26:01,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 17:26:01,063 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:26:01,064 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:26:01,064 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:26:01,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:26:01,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1482060714, now seen corresponding path program 1 times [2019-12-07 17:26:01,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:26:01,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582170825] [2019-12-07 17:26:01,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:26:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:01,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:26:01,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582170825] [2019-12-07 17:26:01,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:26:01,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:26:01,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260214103] [2019-12-07 17:26:01,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:26:01,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:26:01,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:26:01,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:01,077 INFO L87 Difference]: Start difference. First operand 788 states and 1138 transitions. Second operand 3 states. [2019-12-07 17:26:01,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:26:01,103 INFO L93 Difference]: Finished difference Result 1352 states and 1972 transitions. [2019-12-07 17:26:01,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:26:01,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 17:26:01,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:26:01,110 INFO L225 Difference]: With dead ends: 1352 [2019-12-07 17:26:01,111 INFO L226 Difference]: Without dead ends: 1350 [2019-12-07 17:26:01,111 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:01,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2019-12-07 17:26:01,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1156. [2019-12-07 17:26:01,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2019-12-07 17:26:01,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1618 transitions. [2019-12-07 17:26:01,146 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1618 transitions. Word has length 19 [2019-12-07 17:26:01,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:26:01,147 INFO L462 AbstractCegarLoop]: Abstraction has 1156 states and 1618 transitions. [2019-12-07 17:26:01,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:26:01,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1618 transitions. [2019-12-07 17:26:01,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 17:26:01,149 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:26:01,149 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:26:01,149 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:26:01,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:26:01,150 INFO L82 PathProgramCache]: Analyzing trace with hash -780996136, now seen corresponding path program 1 times [2019-12-07 17:26:01,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:26:01,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852453017] [2019-12-07 17:26:01,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:26:01,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:01,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:26:01,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852453017] [2019-12-07 17:26:01,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:26:01,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:26:01,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392315036] [2019-12-07 17:26:01,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:26:01,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:26:01,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:26:01,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:01,162 INFO L87 Difference]: Start difference. First operand 1156 states and 1618 transitions. Second operand 3 states. [2019-12-07 17:26:01,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:26:01,189 INFO L93 Difference]: Finished difference Result 2632 states and 3668 transitions. [2019-12-07 17:26:01,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:26:01,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 17:26:01,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:26:01,195 INFO L225 Difference]: With dead ends: 2632 [2019-12-07 17:26:01,195 INFO L226 Difference]: Without dead ends: 1510 [2019-12-07 17:26:01,196 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:01,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2019-12-07 17:26:01,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1508. [2019-12-07 17:26:01,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2019-12-07 17:26:01,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2050 transitions. [2019-12-07 17:26:01,230 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 2050 transitions. Word has length 19 [2019-12-07 17:26:01,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:26:01,230 INFO L462 AbstractCegarLoop]: Abstraction has 1508 states and 2050 transitions. [2019-12-07 17:26:01,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:26:01,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2050 transitions. [2019-12-07 17:26:01,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 17:26:01,232 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:26:01,232 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:26:01,232 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:26:01,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:26:01,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1300973822, now seen corresponding path program 1 times [2019-12-07 17:26:01,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:26:01,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716985979] [2019-12-07 17:26:01,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:26:01,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:01,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:26:01,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716985979] [2019-12-07 17:26:01,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:26:01,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:26:01,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821569651] [2019-12-07 17:26:01,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:26:01,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:26:01,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:26:01,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:01,245 INFO L87 Difference]: Start difference. First operand 1508 states and 2050 transitions. Second operand 3 states. [2019-12-07 17:26:01,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:26:01,269 INFO L93 Difference]: Finished difference Result 2264 states and 3060 transitions. [2019-12-07 17:26:01,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:26:01,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 17:26:01,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:26:01,275 INFO L225 Difference]: With dead ends: 2264 [2019-12-07 17:26:01,275 INFO L226 Difference]: Without dead ends: 1542 [2019-12-07 17:26:01,276 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:01,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2019-12-07 17:26:01,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1540. [2019-12-07 17:26:01,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1540 states. [2019-12-07 17:26:01,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 2050 transitions. [2019-12-07 17:26:01,321 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 2050 transitions. Word has length 20 [2019-12-07 17:26:01,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:26:01,321 INFO L462 AbstractCegarLoop]: Abstraction has 1540 states and 2050 transitions. [2019-12-07 17:26:01,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:26:01,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 2050 transitions. [2019-12-07 17:26:01,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 17:26:01,323 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:26:01,323 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:26:01,323 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:26:01,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:26:01,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1559139260, now seen corresponding path program 1 times [2019-12-07 17:26:01,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:26:01,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929964373] [2019-12-07 17:26:01,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:26:01,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:01,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:26:01,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929964373] [2019-12-07 17:26:01,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:26:01,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:26:01,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793289295] [2019-12-07 17:26:01,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:26:01,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:26:01,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:26:01,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:01,334 INFO L87 Difference]: Start difference. First operand 1540 states and 2050 transitions. Second operand 3 states. [2019-12-07 17:26:01,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:26:01,364 INFO L93 Difference]: Finished difference Result 2568 states and 3428 transitions. [2019-12-07 17:26:01,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:26:01,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 17:26:01,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:26:01,373 INFO L225 Difference]: With dead ends: 2568 [2019-12-07 17:26:01,373 INFO L226 Difference]: Without dead ends: 2566 [2019-12-07 17:26:01,374 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:01,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2019-12-07 17:26:01,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 2308. [2019-12-07 17:26:01,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2308 states. [2019-12-07 17:26:01,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 2308 states and 2978 transitions. [2019-12-07 17:26:01,415 INFO L78 Accepts]: Start accepts. Automaton has 2308 states and 2978 transitions. Word has length 20 [2019-12-07 17:26:01,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:26:01,416 INFO L462 AbstractCegarLoop]: Abstraction has 2308 states and 2978 transitions. [2019-12-07 17:26:01,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:26:01,416 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 2978 transitions. [2019-12-07 17:26:01,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 17:26:01,418 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:26:01,418 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:26:01,418 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:26:01,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:26:01,418 INFO L82 PathProgramCache]: Analyzing trace with hash -2034763458, now seen corresponding path program 1 times [2019-12-07 17:26:01,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:26:01,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535971082] [2019-12-07 17:26:01,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:26:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:01,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:26:01,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535971082] [2019-12-07 17:26:01,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:26:01,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:26:01,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140205901] [2019-12-07 17:26:01,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:26:01,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:26:01,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:26:01,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:01,428 INFO L87 Difference]: Start difference. First operand 2308 states and 2978 transitions. Second operand 3 states. [2019-12-07 17:26:01,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:26:01,464 INFO L93 Difference]: Finished difference Result 5192 states and 6628 transitions. [2019-12-07 17:26:01,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:26:01,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 17:26:01,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:26:01,474 INFO L225 Difference]: With dead ends: 5192 [2019-12-07 17:26:01,475 INFO L226 Difference]: Without dead ends: 2950 [2019-12-07 17:26:01,476 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:01,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2019-12-07 17:26:01,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 2948. [2019-12-07 17:26:01,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2948 states. [2019-12-07 17:26:01,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2948 states to 2948 states and 3650 transitions. [2019-12-07 17:26:01,531 INFO L78 Accepts]: Start accepts. Automaton has 2948 states and 3650 transitions. Word has length 20 [2019-12-07 17:26:01,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:26:01,532 INFO L462 AbstractCegarLoop]: Abstraction has 2948 states and 3650 transitions. [2019-12-07 17:26:01,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:26:01,532 INFO L276 IsEmpty]: Start isEmpty. Operand 2948 states and 3650 transitions. [2019-12-07 17:26:01,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 17:26:01,534 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:26:01,534 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:26:01,534 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:26:01,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:26:01,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1088892845, now seen corresponding path program 1 times [2019-12-07 17:26:01,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:26:01,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073935564] [2019-12-07 17:26:01,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:26:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:01,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:26:01,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073935564] [2019-12-07 17:26:01,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:26:01,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:26:01,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826424510] [2019-12-07 17:26:01,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:26:01,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:26:01,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:26:01,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:01,545 INFO L87 Difference]: Start difference. First operand 2948 states and 3650 transitions. Second operand 3 states. [2019-12-07 17:26:01,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:26:01,578 INFO L93 Difference]: Finished difference Result 4424 states and 5444 transitions. [2019-12-07 17:26:01,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:26:01,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 17:26:01,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:26:01,589 INFO L225 Difference]: With dead ends: 4424 [2019-12-07 17:26:01,589 INFO L226 Difference]: Without dead ends: 3014 [2019-12-07 17:26:01,590 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:01,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3014 states. [2019-12-07 17:26:01,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3014 to 3012. [2019-12-07 17:26:01,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3012 states. [2019-12-07 17:26:01,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3012 states to 3012 states and 3650 transitions. [2019-12-07 17:26:01,648 INFO L78 Accepts]: Start accepts. Automaton has 3012 states and 3650 transitions. Word has length 21 [2019-12-07 17:26:01,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:26:01,648 INFO L462 AbstractCegarLoop]: Abstraction has 3012 states and 3650 transitions. [2019-12-07 17:26:01,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:26:01,648 INFO L276 IsEmpty]: Start isEmpty. Operand 3012 states and 3650 transitions. [2019-12-07 17:26:01,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 17:26:01,650 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:26:01,650 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:26:01,650 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:26:01,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:26:01,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1347058283, now seen corresponding path program 1 times [2019-12-07 17:26:01,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:26:01,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394702241] [2019-12-07 17:26:01,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:26:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:01,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:26:01,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394702241] [2019-12-07 17:26:01,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:26:01,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:26:01,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526164895] [2019-12-07 17:26:01,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:26:01,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:26:01,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:26:01,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:01,662 INFO L87 Difference]: Start difference. First operand 3012 states and 3650 transitions. Second operand 3 states. [2019-12-07 17:26:01,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:26:01,713 INFO L93 Difference]: Finished difference Result 4870 states and 5827 transitions. [2019-12-07 17:26:01,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:26:01,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 17:26:01,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:26:01,730 INFO L225 Difference]: With dead ends: 4870 [2019-12-07 17:26:01,730 INFO L226 Difference]: Without dead ends: 4868 [2019-12-07 17:26:01,731 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:01,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4868 states. [2019-12-07 17:26:01,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4868 to 4612. [2019-12-07 17:26:01,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4612 states. [2019-12-07 17:26:01,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4612 states to 4612 states and 5442 transitions. [2019-12-07 17:26:01,811 INFO L78 Accepts]: Start accepts. Automaton has 4612 states and 5442 transitions. Word has length 21 [2019-12-07 17:26:01,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:26:01,811 INFO L462 AbstractCegarLoop]: Abstraction has 4612 states and 5442 transitions. [2019-12-07 17:26:01,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:26:01,811 INFO L276 IsEmpty]: Start isEmpty. Operand 4612 states and 5442 transitions. [2019-12-07 17:26:01,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 17:26:01,816 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:26:01,816 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:26:01,816 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:26:01,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:26:01,816 INFO L82 PathProgramCache]: Analyzing trace with hash 2048122861, now seen corresponding path program 1 times [2019-12-07 17:26:01,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:26:01,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374705913] [2019-12-07 17:26:01,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:26:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:01,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:26:01,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374705913] [2019-12-07 17:26:01,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:26:01,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:26:01,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063052240] [2019-12-07 17:26:01,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:26:01,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:26:01,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:26:01,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:01,826 INFO L87 Difference]: Start difference. First operand 4612 states and 5442 transitions. Second operand 3 states. [2019-12-07 17:26:01,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:26:01,886 INFO L93 Difference]: Finished difference Result 10244 states and 11842 transitions. [2019-12-07 17:26:01,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:26:01,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 17:26:01,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:26:01,887 INFO L225 Difference]: With dead ends: 10244 [2019-12-07 17:26:01,887 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 17:26:01,893 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:01,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 17:26:01,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 17:26:01,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 17:26:01,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 17:26:01,893 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-12-07 17:26:01,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:26:01,894 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 17:26:01,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:26:01,894 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 17:26:01,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 17:26:01,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 17:26:01,913 INFO L246 CegarLoopResult]: For program point L126(line 126) no Hoare annotation was computed. [2019-12-07 17:26:01,913 INFO L242 CegarLoopResult]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2019-12-07 17:26:01,913 INFO L246 CegarLoopResult]: For program point L60-1(lines 33 130) no Hoare annotation was computed. [2019-12-07 17:26:01,913 INFO L246 CegarLoopResult]: For program point L110-1(lines 33 130) no Hoare annotation was computed. [2019-12-07 17:26:01,913 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 17:26:01,913 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 17:26:01,913 INFO L246 CegarLoopResult]: For program point L111(line 111) no Hoare annotation was computed. [2019-12-07 17:26:01,913 INFO L246 CegarLoopResult]: For program point L95-1(lines 33 130) no Hoare annotation was computed. [2019-12-07 17:26:01,913 INFO L246 CegarLoopResult]: For program point L120-1(lines 33 130) no Hoare annotation was computed. [2019-12-07 17:26:01,913 INFO L246 CegarLoopResult]: For program point L96(line 96) no Hoare annotation was computed. [2019-12-07 17:26:01,913 INFO L246 CegarLoopResult]: For program point L121(line 121) no Hoare annotation was computed. [2019-12-07 17:26:01,914 INFO L246 CegarLoopResult]: For program point L80-1(lines 33 130) no Hoare annotation was computed. [2019-12-07 17:26:01,914 INFO L246 CegarLoopResult]: For program point L105-1(lines 33 130) no Hoare annotation was computed. [2019-12-07 17:26:01,914 INFO L246 CegarLoopResult]: For program point L72-1(lines 33 130) no Hoare annotation was computed. [2019-12-07 17:26:01,914 INFO L246 CegarLoopResult]: For program point L64-1(lines 33 130) no Hoare annotation was computed. [2019-12-07 17:26:01,914 INFO L246 CegarLoopResult]: For program point L56(lines 56 58) no Hoare annotation was computed. [2019-12-07 17:26:01,914 INFO L246 CegarLoopResult]: For program point L56-2(lines 33 130) no Hoare annotation was computed. [2019-12-07 17:26:01,914 INFO L246 CegarLoopResult]: For program point L106(line 106) no Hoare annotation was computed. [2019-12-07 17:26:01,914 INFO L249 CegarLoopResult]: At program point L131(lines 5 135) the Hoare annotation is: true [2019-12-07 17:26:01,914 INFO L246 CegarLoopResult]: For program point L90-1(lines 33 130) no Hoare annotation was computed. [2019-12-07 17:26:01,914 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2019-12-07 17:26:01,914 INFO L246 CegarLoopResult]: For program point L115-1(lines 33 130) no Hoare annotation was computed. [2019-12-07 17:26:01,914 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 17:26:01,914 INFO L246 CegarLoopResult]: For program point L91(line 91) no Hoare annotation was computed. [2019-12-07 17:26:01,914 INFO L246 CegarLoopResult]: For program point L116(line 116) no Hoare annotation was computed. [2019-12-07 17:26:01,914 INFO L246 CegarLoopResult]: For program point L100-1(lines 33 130) no Hoare annotation was computed. [2019-12-07 17:26:01,914 INFO L249 CegarLoopResult]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2019-12-07 17:26:01,914 INFO L246 CegarLoopResult]: For program point L84-1(lines 33 130) no Hoare annotation was computed. [2019-12-07 17:26:01,915 INFO L246 CegarLoopResult]: For program point L76-1(lines 33 130) no Hoare annotation was computed. [2019-12-07 17:26:01,915 INFO L249 CegarLoopResult]: At program point L134(lines 4 135) the Hoare annotation is: true [2019-12-07 17:26:01,915 INFO L246 CegarLoopResult]: For program point L101(line 101) no Hoare annotation was computed. [2019-12-07 17:26:01,915 INFO L246 CegarLoopResult]: For program point L35(lines 35 37) no Hoare annotation was computed. [2019-12-07 17:26:01,915 INFO L246 CegarLoopResult]: For program point L68-1(lines 33 130) no Hoare annotation was computed. [2019-12-07 17:26:01,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:26:01 BoogieIcfgContainer [2019-12-07 17:26:01,922 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:26:01,922 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:26:01,922 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:26:01,922 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:26:01,923 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:26:00" (3/4) ... [2019-12-07 17:26:01,925 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 17:26:01,932 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-07 17:26:01,933 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 17:26:01,968 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a4b29d10-2b05-42fe-a2e4-adcff5aa8192/bin/uautomizer/witness.graphml [2019-12-07 17:26:01,968 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:26:01,970 INFO L168 Benchmark]: Toolchain (without parser) took 2167.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.9 MB). Free memory was 943.5 MB in the beginning and 1.2 GB in the end (delta: -209.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:26:01,970 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:26:01,970 INFO L168 Benchmark]: CACSL2BoogieTranslator took 190.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -156.1 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2019-12-07 17:26:01,970 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.17 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:26:01,970 INFO L168 Benchmark]: Boogie Preprocessor took 17.45 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:26:01,971 INFO L168 Benchmark]: RCFGBuilder took 208.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-12-07 17:26:01,971 INFO L168 Benchmark]: TraceAbstraction took 1676.45 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 66.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -85.2 MB). Peak memory consumption was 248.8 MB. Max. memory is 11.5 GB. [2019-12-07 17:26:01,971 INFO L168 Benchmark]: Witness Printer took 46.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:26:01,972 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 190.94 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -156.1 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.17 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.45 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 208.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1676.45 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 66.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -85.2 MB). Peak memory consumption was 248.8 MB. Max. memory is 11.5 GB. * Witness Printer took 46.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: 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: 33]: 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, 33 locations, 1 error locations. Result: SAFE, OverallTime: 1.6s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1452 SDtfs, 720 SDslu, 942 SDs, 0 SdLazy, 117 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4612occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 1044 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 265 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 389 NumberOfCodeBlocks, 389 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 367 ConstructedInterpolants, 0 QuantifiedInterpolants, 13195 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...