./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/psyco/psyco_security_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_488dbba9-6a0f-4f30-a534-25a68e61e5cc/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_488dbba9-6a0f-4f30-a534-25a68e61e5cc/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_488dbba9-6a0f-4f30-a534-25a68e61e5cc/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_488dbba9-6a0f-4f30-a534-25a68e61e5cc/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/psyco/psyco_security_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_488dbba9-6a0f-4f30-a534-25a68e61e5cc/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_488dbba9-6a0f-4f30-a534-25a68e61e5cc/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8cc1f38a976dda42d71f86348e088e61d77f90eb ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 13:04:51,299 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 13:04:51,300 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 13:04:51,307 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 13:04:51,307 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 13:04:51,308 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 13:04:51,309 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 13:04:51,310 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 13:04:51,311 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 13:04:51,311 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 13:04:51,312 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 13:04:51,312 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 13:04:51,313 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 13:04:51,313 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 13:04:51,314 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 13:04:51,315 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 13:04:51,315 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 13:04:51,316 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 13:04:51,318 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 13:04:51,319 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 13:04:51,320 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 13:04:51,320 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 13:04:51,322 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 13:04:51,322 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 13:04:51,322 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 13:04:51,323 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 13:04:51,324 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 13:04:51,324 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 13:04:51,325 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 13:04:51,325 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 13:04:51,326 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 13:04:51,326 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 13:04:51,326 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 13:04:51,326 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 13:04:51,327 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 13:04:51,327 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 13:04:51,328 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_488dbba9-6a0f-4f30-a534-25a68e61e5cc/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 13:04:51,335 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 13:04:51,336 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 13:04:51,336 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 13:04:51,336 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 13:04:51,337 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 13:04:51,337 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 13:04:51,337 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 13:04:51,337 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 13:04:51,337 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 13:04:51,338 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 13:04:51,338 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 13:04:51,338 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 13:04:51,338 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 13:04:51,338 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 13:04:51,338 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 13:04:51,338 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 13:04:51,339 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 13:04:51,339 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 13:04:51,339 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 13:04:51,339 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 13:04:51,339 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 13:04:51,339 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 13:04:51,339 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 13:04:51,340 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 13:04:51,340 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 13:04:51,340 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 13:04:51,340 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 13:04:51,340 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 13:04:51,340 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 13:04:51,340 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_488dbba9-6a0f-4f30-a534-25a68e61e5cc/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8cc1f38a976dda42d71f86348e088e61d77f90eb [2018-11-10 13:04:51,365 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 13:04:51,374 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 13:04:51,377 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 13:04:51,378 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 13:04:51,378 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 13:04:51,378 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_488dbba9-6a0f-4f30-a534-25a68e61e5cc/bin-2019/uautomizer/../../sv-benchmarks/c/psyco/psyco_security_true-unreach-call_false-termination.c [2018-11-10 13:04:51,417 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_488dbba9-6a0f-4f30-a534-25a68e61e5cc/bin-2019/uautomizer/data/a2a1b9591/8f61f218d6544c6a9367001a16a108a7/FLAGb9823f43a [2018-11-10 13:04:51,738 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 13:04:51,738 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_488dbba9-6a0f-4f30-a534-25a68e61e5cc/sv-benchmarks/c/psyco/psyco_security_true-unreach-call_false-termination.c [2018-11-10 13:04:51,746 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_488dbba9-6a0f-4f30-a534-25a68e61e5cc/bin-2019/uautomizer/data/a2a1b9591/8f61f218d6544c6a9367001a16a108a7/FLAGb9823f43a [2018-11-10 13:04:51,757 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_488dbba9-6a0f-4f30-a534-25a68e61e5cc/bin-2019/uautomizer/data/a2a1b9591/8f61f218d6544c6a9367001a16a108a7 [2018-11-10 13:04:51,760 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 13:04:51,761 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 13:04:51,762 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 13:04:51,762 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 13:04:51,765 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 13:04:51,765 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:04:51" (1/1) ... [2018-11-10 13:04:51,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73ae0723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:51, skipping insertion in model container [2018-11-10 13:04:51,768 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:04:51" (1/1) ... [2018-11-10 13:04:51,776 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 13:04:51,798 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 13:04:51,931 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:04:51,934 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 13:04:51,953 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:04:51,961 INFO L193 MainTranslator]: Completed translation [2018-11-10 13:04:51,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:51 WrapperNode [2018-11-10 13:04:51,961 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 13:04:51,962 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 13:04:51,962 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 13:04:51,962 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 13:04:51,969 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:51" (1/1) ... [2018-11-10 13:04:51,970 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:51" (1/1) ... [2018-11-10 13:04:51,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:51" (1/1) ... [2018-11-10 13:04:51,975 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:51" (1/1) ... [2018-11-10 13:04:51,978 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:51" (1/1) ... [2018-11-10 13:04:51,983 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:51" (1/1) ... [2018-11-10 13:04:51,984 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:51" (1/1) ... [2018-11-10 13:04:51,985 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 13:04:51,985 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 13:04:51,986 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 13:04:51,986 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 13:04:51,986 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_488dbba9-6a0f-4f30-a534-25a68e61e5cc/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 13:04:52,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 13:04:52,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 13:04:52,056 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 13:04:52,056 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 13:04:52,056 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 13:04:52,056 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 13:04:52,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 13:04:52,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 13:04:52,344 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 13:04:52,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:04:52 BoogieIcfgContainer [2018-11-10 13:04:52,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 13:04:52,345 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 13:04:52,345 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 13:04:52,347 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 13:04:52,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:04:51" (1/3) ... [2018-11-10 13:04:52,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59e058ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:04:52, skipping insertion in model container [2018-11-10 13:04:52,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:04:51" (2/3) ... [2018-11-10 13:04:52,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59e058ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:04:52, skipping insertion in model container [2018-11-10 13:04:52,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:04:52" (3/3) ... [2018-11-10 13:04:52,350 INFO L112 eAbstractionObserver]: Analyzing ICFG psyco_security_true-unreach-call_false-termination.c [2018-11-10 13:04:52,355 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 13:04:52,360 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 13:04:52,369 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 13:04:52,387 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 13:04:52,388 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 13:04:52,388 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 13:04:52,388 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 13:04:52,388 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 13:04:52,388 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 13:04:52,388 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 13:04:52,388 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 13:04:52,388 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 13:04:52,401 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states. [2018-11-10 13:04:52,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 13:04:52,406 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:52,406 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:04:52,408 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:52,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:52,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1921368221, now seen corresponding path program 1 times [2018-11-10 13:04:52,412 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:04:52,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:04:52,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:52,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:52,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:52,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:04:52,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:52,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 13:04:52,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 13:04:52,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 13:04:52,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 13:04:52,505 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 2 states. [2018-11-10 13:04:52,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:52,524 INFO L93 Difference]: Finished difference Result 160 states and 298 transitions. [2018-11-10 13:04:52,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 13:04:52,525 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-10 13:04:52,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:52,533 INFO L225 Difference]: With dead ends: 160 [2018-11-10 13:04:52,533 INFO L226 Difference]: Without dead ends: 78 [2018-11-10 13:04:52,535 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 13:04:52,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-10 13:04:52,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-11-10 13:04:52,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-10 13:04:52,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 113 transitions. [2018-11-10 13:04:52,559 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 113 transitions. Word has length 13 [2018-11-10 13:04:52,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:52,559 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 113 transitions. [2018-11-10 13:04:52,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 13:04:52,560 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 113 transitions. [2018-11-10 13:04:52,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 13:04:52,560 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:52,560 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:04:52,560 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:52,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:52,561 INFO L82 PathProgramCache]: Analyzing trace with hash -34635363, now seen corresponding path program 1 times [2018-11-10 13:04:52,561 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:04:52,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:04:52,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:52,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:52,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:52,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:04:52,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:52,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:04:52,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:04:52,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:04:52,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:04:52,597 INFO L87 Difference]: Start difference. First operand 78 states and 113 transitions. Second operand 3 states. [2018-11-10 13:04:52,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:52,647 INFO L93 Difference]: Finished difference Result 153 states and 224 transitions. [2018-11-10 13:04:52,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:04:52,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-10 13:04:52,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:52,649 INFO L225 Difference]: With dead ends: 153 [2018-11-10 13:04:52,649 INFO L226 Difference]: Without dead ends: 81 [2018-11-10 13:04:52,650 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:04:52,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-10 13:04:52,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-11-10 13:04:52,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-10 13:04:52,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 116 transitions. [2018-11-10 13:04:52,656 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 116 transitions. Word has length 14 [2018-11-10 13:04:52,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:52,657 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 116 transitions. [2018-11-10 13:04:52,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:04:52,657 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 116 transitions. [2018-11-10 13:04:52,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-10 13:04:52,657 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:52,657 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:04:52,658 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:52,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:52,658 INFO L82 PathProgramCache]: Analyzing trace with hash -304388480, now seen corresponding path program 1 times [2018-11-10 13:04:52,658 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:04:52,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:04:52,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:52,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:52,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:52,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:52,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:04:52,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:52,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:04:52,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:04:52,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:04:52,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:04:52,692 INFO L87 Difference]: Start difference. First operand 81 states and 116 transitions. Second operand 3 states. [2018-11-10 13:04:52,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:52,744 INFO L93 Difference]: Finished difference Result 146 states and 213 transitions. [2018-11-10 13:04:52,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:04:52,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-10 13:04:52,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:52,745 INFO L225 Difference]: With dead ends: 146 [2018-11-10 13:04:52,745 INFO L226 Difference]: Without dead ends: 72 [2018-11-10 13:04:52,746 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:04:52,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-10 13:04:52,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-11-10 13:04:52,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-10 13:04:52,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 102 transitions. [2018-11-10 13:04:52,751 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 102 transitions. Word has length 19 [2018-11-10 13:04:52,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:52,751 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 102 transitions. [2018-11-10 13:04:52,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:04:52,752 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 102 transitions. [2018-11-10 13:04:52,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 13:04:52,752 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:52,752 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:04:52,753 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:52,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:52,753 INFO L82 PathProgramCache]: Analyzing trace with hash -512664072, now seen corresponding path program 1 times [2018-11-10 13:04:52,753 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:04:52,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:04:52,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:52,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:52,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:52,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:04:52,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:52,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:04:52,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:04:52,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:04:52,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:04:52,785 INFO L87 Difference]: Start difference. First operand 72 states and 102 transitions. Second operand 3 states. [2018-11-10 13:04:52,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:52,845 INFO L93 Difference]: Finished difference Result 192 states and 280 transitions. [2018-11-10 13:04:52,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:04:52,846 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-10 13:04:52,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:52,847 INFO L225 Difference]: With dead ends: 192 [2018-11-10 13:04:52,847 INFO L226 Difference]: Without dead ends: 122 [2018-11-10 13:04:52,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:04:52,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-10 13:04:52,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 108. [2018-11-10 13:04:52,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-10 13:04:52,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 153 transitions. [2018-11-10 13:04:52,852 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 153 transitions. Word has length 22 [2018-11-10 13:04:52,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:52,852 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 153 transitions. [2018-11-10 13:04:52,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:04:52,852 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 153 transitions. [2018-11-10 13:04:52,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 13:04:52,853 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:52,853 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:04:52,853 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:52,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:52,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1940953662, now seen corresponding path program 1 times [2018-11-10 13:04:52,854 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:04:52,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:04:52,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:52,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:52,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:52,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:04:52,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:52,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:04:52,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:04:52,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:04:52,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:04:52,885 INFO L87 Difference]: Start difference. First operand 108 states and 153 transitions. Second operand 3 states. [2018-11-10 13:04:52,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:52,916 INFO L93 Difference]: Finished difference Result 183 states and 260 transitions. [2018-11-10 13:04:52,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:04:52,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 13:04:52,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:52,917 INFO L225 Difference]: With dead ends: 183 [2018-11-10 13:04:52,917 INFO L226 Difference]: Without dead ends: 87 [2018-11-10 13:04:52,918 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:04:52,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-10 13:04:52,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-11-10 13:04:52,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-10 13:04:52,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 117 transitions. [2018-11-10 13:04:52,924 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 117 transitions. Word has length 23 [2018-11-10 13:04:52,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:52,924 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 117 transitions. [2018-11-10 13:04:52,924 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:04:52,924 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2018-11-10 13:04:52,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 13:04:52,925 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:52,925 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:04:52,925 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:52,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:52,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1172052595, now seen corresponding path program 1 times [2018-11-10 13:04:52,926 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:04:52,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:04:52,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:52,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:52,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:52,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:52,952 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 13:04:52,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:52,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:04:52,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:04:52,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:04:52,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:04:52,954 INFO L87 Difference]: Start difference. First operand 85 states and 117 transitions. Second operand 3 states. [2018-11-10 13:04:52,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:52,980 INFO L93 Difference]: Finished difference Result 134 states and 190 transitions. [2018-11-10 13:04:52,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:04:52,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-10 13:04:52,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:52,981 INFO L225 Difference]: With dead ends: 134 [2018-11-10 13:04:52,981 INFO L226 Difference]: Without dead ends: 70 [2018-11-10 13:04:52,982 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:04:52,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-10 13:04:52,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-11-10 13:04:52,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-10 13:04:52,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 96 transitions. [2018-11-10 13:04:52,986 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 96 transitions. Word has length 29 [2018-11-10 13:04:52,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:52,986 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 96 transitions. [2018-11-10 13:04:52,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:04:52,986 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 96 transitions. [2018-11-10 13:04:52,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 13:04:52,987 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:52,987 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:04:52,987 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:52,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:52,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1320221367, now seen corresponding path program 1 times [2018-11-10 13:04:52,987 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:04:52,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:04:52,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:52,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:52,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:53,002 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 13:04:53,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:53,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:04:53,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:04:53,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:04:53,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:04:53,003 INFO L87 Difference]: Start difference. First operand 70 states and 96 transitions. Second operand 3 states. [2018-11-10 13:04:53,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:53,064 INFO L93 Difference]: Finished difference Result 158 states and 228 transitions. [2018-11-10 13:04:53,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:04:53,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-10 13:04:53,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:53,065 INFO L225 Difference]: With dead ends: 158 [2018-11-10 13:04:53,065 INFO L226 Difference]: Without dead ends: 111 [2018-11-10 13:04:53,065 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:04:53,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-10 13:04:53,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 99. [2018-11-10 13:04:53,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-10 13:04:53,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 138 transitions. [2018-11-10 13:04:53,075 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 138 transitions. Word has length 30 [2018-11-10 13:04:53,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:53,075 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 138 transitions. [2018-11-10 13:04:53,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:04:53,075 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 138 transitions. [2018-11-10 13:04:53,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 13:04:53,076 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:53,076 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:04:53,076 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:53,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:53,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1121323394, now seen corresponding path program 1 times [2018-11-10 13:04:53,077 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:04:53,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:04:53,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:53,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:53,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:53,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:53,112 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 13:04:53,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:53,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:04:53,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:04:53,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:04:53,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:04:53,113 INFO L87 Difference]: Start difference. First operand 99 states and 138 transitions. Second operand 3 states. [2018-11-10 13:04:53,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:53,184 INFO L93 Difference]: Finished difference Result 166 states and 232 transitions. [2018-11-10 13:04:53,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:04:53,184 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-10 13:04:53,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:53,185 INFO L225 Difference]: With dead ends: 166 [2018-11-10 13:04:53,185 INFO L226 Difference]: Without dead ends: 92 [2018-11-10 13:04:53,185 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:04:53,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-10 13:04:53,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-11-10 13:04:53,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-10 13:04:53,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 120 transitions. [2018-11-10 13:04:53,195 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 120 transitions. Word has length 31 [2018-11-10 13:04:53,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:53,196 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 120 transitions. [2018-11-10 13:04:53,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:04:53,196 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 120 transitions. [2018-11-10 13:04:53,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 13:04:53,197 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:53,197 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:04:53,197 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:53,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:53,197 INFO L82 PathProgramCache]: Analyzing trace with hash -984969239, now seen corresponding path program 1 times [2018-11-10 13:04:53,197 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:04:53,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:04:53,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:53,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:53,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:53,223 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 13:04:53,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:53,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:04:53,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:04:53,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:04:53,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:04:53,225 INFO L87 Difference]: Start difference. First operand 92 states and 120 transitions. Second operand 3 states. [2018-11-10 13:04:53,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:53,257 INFO L93 Difference]: Finished difference Result 139 states and 184 transitions. [2018-11-10 13:04:53,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:04:53,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-10 13:04:53,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:53,258 INFO L225 Difference]: With dead ends: 139 [2018-11-10 13:04:53,258 INFO L226 Difference]: Without dead ends: 72 [2018-11-10 13:04:53,259 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:04:53,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-10 13:04:53,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-11-10 13:04:53,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-10 13:04:53,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 91 transitions. [2018-11-10 13:04:53,263 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 91 transitions. Word has length 31 [2018-11-10 13:04:53,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:53,264 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 91 transitions. [2018-11-10 13:04:53,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:04:53,264 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2018-11-10 13:04:53,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 13:04:53,265 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:53,265 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:04:53,265 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:53,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:53,265 INFO L82 PathProgramCache]: Analyzing trace with hash 885900628, now seen corresponding path program 1 times [2018-11-10 13:04:53,266 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:04:53,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:04:53,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:53,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:53,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:53,289 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 13:04:53,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:53,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:04:53,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:04:53,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:04:53,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:04:53,290 INFO L87 Difference]: Start difference. First operand 72 states and 91 transitions. Second operand 3 states. [2018-11-10 13:04:53,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:53,330 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2018-11-10 13:04:53,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:04:53,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-10 13:04:53,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:53,331 INFO L225 Difference]: With dead ends: 74 [2018-11-10 13:04:53,331 INFO L226 Difference]: Without dead ends: 70 [2018-11-10 13:04:53,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:04:53,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-10 13:04:53,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-11-10 13:04:53,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-10 13:04:53,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 88 transitions. [2018-11-10 13:04:53,335 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 88 transitions. Word has length 32 [2018-11-10 13:04:53,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:53,335 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 88 transitions. [2018-11-10 13:04:53,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:04:53,336 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 88 transitions. [2018-11-10 13:04:53,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-10 13:04:53,336 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:04:53,336 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:04:53,337 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:04:53,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:04:53,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1704565915, now seen corresponding path program 1 times [2018-11-10 13:04:53,337 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 13:04:53,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 13:04:53,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:53,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:04:53,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:04:53,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:04:53,361 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 13:04:53,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:04:53,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:04:53,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:04:53,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:04:53,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:04:53,362 INFO L87 Difference]: Start difference. First operand 70 states and 88 transitions. Second operand 3 states. [2018-11-10 13:04:53,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:04:53,387 INFO L93 Difference]: Finished difference Result 111 states and 143 transitions. [2018-11-10 13:04:53,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:04:53,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-10 13:04:53,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:04:53,388 INFO L225 Difference]: With dead ends: 111 [2018-11-10 13:04:53,388 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 13:04:53,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:04:53,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 13:04:53,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 13:04:53,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 13:04:53,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 13:04:53,389 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2018-11-10 13:04:53,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:04:53,389 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:04:53,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:04:53,389 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 13:04:53,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 13:04:53,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 13:04:53,480 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 13:04:53,480 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-10 13:04:53,480 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 13:04:53,480 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 13:04:53,480 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 13:04:53,480 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 13:04:53,481 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 13:04:53,481 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 331) no Hoare annotation was computed. [2018-11-10 13:04:53,481 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 382) no Hoare annotation was computed. [2018-11-10 13:04:53,481 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 261) no Hoare annotation was computed. [2018-11-10 13:04:53,481 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 13 390) no Hoare annotation was computed. [2018-11-10 13:04:53,481 INFO L425 ceAbstractionStarter]: For program point L184(lines 184 199) no Hoare annotation was computed. [2018-11-10 13:04:53,481 INFO L425 ceAbstractionStarter]: For program point L118(lines 118 129) no Hoare annotation was computed. [2018-11-10 13:04:53,481 INFO L425 ceAbstractionStarter]: For program point L366(lines 366 377) no Hoare annotation was computed. [2018-11-10 13:04:53,481 INFO L425 ceAbstractionStarter]: For program point L300(lines 300 315) no Hoare annotation was computed. [2018-11-10 13:04:53,481 INFO L425 ceAbstractionStarter]: For program point L234(lines 234 245) no Hoare annotation was computed. [2018-11-10 13:04:53,481 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 113) no Hoare annotation was computed. [2018-11-10 13:04:53,481 INFO L425 ceAbstractionStarter]: For program point L350(lines 350 361) no Hoare annotation was computed. [2018-11-10 13:04:53,482 INFO L425 ceAbstractionStarter]: For program point L284(lines 284 299) no Hoare annotation was computed. [2018-11-10 13:04:53,482 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 229) no Hoare annotation was computed. [2018-11-10 13:04:53,482 INFO L425 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2018-11-10 13:04:53,482 INFO L425 ceAbstractionStarter]: For program point L334(lines 334 345) no Hoare annotation was computed. [2018-11-10 13:04:53,482 INFO L425 ceAbstractionStarter]: For program point L202(lines 202 213) no Hoare annotation was computed. [2018-11-10 13:04:53,482 INFO L425 ceAbstractionStarter]: For program point L70(lines 70 72) no Hoare annotation was computed. [2018-11-10 13:04:53,482 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 329) no Hoare annotation was computed. [2018-11-10 13:04:53,482 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 197) no Hoare annotation was computed. [2018-11-10 13:04:53,482 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 56) no Hoare annotation was computed. [2018-11-10 13:04:53,482 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 389) no Hoare annotation was computed. [2018-11-10 13:04:53,483 INFO L425 ceAbstractionStarter]: For program point L302(lines 302 313) no Hoare annotation was computed. [2018-11-10 13:04:53,483 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 13 390) no Hoare annotation was computed. [2018-11-10 13:04:53,483 INFO L425 ceAbstractionStarter]: For program point L170(lines 170 172) no Hoare annotation was computed. [2018-11-10 13:04:53,483 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 297) no Hoare annotation was computed. [2018-11-10 13:04:53,483 INFO L425 ceAbstractionStarter]: For program point L154(lines 154 156) no Hoare annotation was computed. [2018-11-10 13:04:53,483 INFO L421 ceAbstractionStarter]: At program point L22-3(lines 22 385) the Hoare annotation is: (or (and (<= main_~this_state~0 0) (= main_~q~0 0)) (and (= main_~this_state~0 3) (<= 4 main_~q~0))) [2018-11-10 13:04:53,483 INFO L425 ceAbstractionStarter]: For program point L22-4(lines 22 385) no Hoare annotation was computed. [2018-11-10 13:04:53,483 INFO L425 ceAbstractionStarter]: For program point L270(lines 270 272) no Hoare annotation was computed. [2018-11-10 13:04:53,483 INFO L425 ceAbstractionStarter]: For program point L138(lines 138 140) no Hoare annotation was computed. [2018-11-10 13:04:53,483 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 256) no Hoare annotation was computed. [2018-11-10 13:04:53,484 INFO L425 ceAbstractionStarter]: For program point L122(lines 122 124) no Hoare annotation was computed. [2018-11-10 13:04:53,484 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 372) no Hoare annotation was computed. [2018-11-10 13:04:53,484 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 240) no Hoare annotation was computed. [2018-11-10 13:04:53,484 INFO L425 ceAbstractionStarter]: For program point L106(lines 106 108) no Hoare annotation was computed. [2018-11-10 13:04:53,484 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 356) no Hoare annotation was computed. [2018-11-10 13:04:53,484 INFO L425 ceAbstractionStarter]: For program point L222(lines 222 224) no Hoare annotation was computed. [2018-11-10 13:04:53,484 INFO L421 ceAbstractionStarter]: At program point L371(lines 13 390) the Hoare annotation is: false [2018-11-10 13:04:53,484 INFO L425 ceAbstractionStarter]: For program point L338(lines 338 340) no Hoare annotation was computed. [2018-11-10 13:04:53,484 INFO L425 ceAbstractionStarter]: For program point L206(lines 206 208) no Hoare annotation was computed. [2018-11-10 13:04:53,484 INFO L425 ceAbstractionStarter]: For program point L322(lines 322 324) no Hoare annotation was computed. [2018-11-10 13:04:53,484 INFO L425 ceAbstractionStarter]: For program point L190(lines 190 192) no Hoare annotation was computed. [2018-11-10 13:04:53,485 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 308) no Hoare annotation was computed. [2018-11-10 13:04:53,485 INFO L425 ceAbstractionStarter]: For program point L290(lines 290 292) no Hoare annotation was computed. [2018-11-10 13:04:53,485 INFO L425 ceAbstractionStarter]: For program point L27(lines 27 46) no Hoare annotation was computed. [2018-11-10 13:04:53,485 INFO L425 ceAbstractionStarter]: For program point L28(lines 28 43) no Hoare annotation was computed. [2018-11-10 13:04:53,485 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 41) no Hoare annotation was computed. [2018-11-10 13:04:53,485 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 13 390) the Hoare annotation is: true [2018-11-10 13:04:53,485 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 95) no Hoare annotation was computed. [2018-11-10 13:04:53,485 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 98) no Hoare annotation was computed. [2018-11-10 13:04:53,485 INFO L425 ceAbstractionStarter]: For program point L64(lines 64 79) no Hoare annotation was computed. [2018-11-10 13:04:53,485 INFO L425 ceAbstractionStarter]: For program point L48(lines 48 63) no Hoare annotation was computed. [2018-11-10 13:04:53,485 INFO L425 ceAbstractionStarter]: For program point L164(lines 164 179) no Hoare annotation was computed. [2018-11-10 13:04:53,485 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 163) no Hoare annotation was computed. [2018-11-10 13:04:53,486 INFO L425 ceAbstractionStarter]: For program point L82(lines 82 93) no Hoare annotation was computed. [2018-11-10 13:04:53,486 INFO L425 ceAbstractionStarter]: For program point L264(lines 264 279) no Hoare annotation was computed. [2018-11-10 13:04:53,486 INFO L425 ceAbstractionStarter]: For program point L132(lines 132 147) no Hoare annotation was computed. [2018-11-10 13:04:53,486 INFO L425 ceAbstractionStarter]: For program point L99(lines 99 182) no Hoare annotation was computed. [2018-11-10 13:04:53,486 INFO L425 ceAbstractionStarter]: For program point L66(lines 66 77) no Hoare annotation was computed. [2018-11-10 13:04:53,486 INFO L425 ceAbstractionStarter]: For program point L248(lines 248 263) no Hoare annotation was computed. [2018-11-10 13:04:53,486 INFO L425 ceAbstractionStarter]: For program point L116(lines 116 131) no Hoare annotation was computed. [2018-11-10 13:04:53,486 INFO L425 ceAbstractionStarter]: For program point L50(lines 50 61) no Hoare annotation was computed. [2018-11-10 13:04:53,486 INFO L425 ceAbstractionStarter]: For program point L364(lines 364 379) no Hoare annotation was computed. [2018-11-10 13:04:53,486 INFO L425 ceAbstractionStarter]: For program point L232(lines 232 247) no Hoare annotation was computed. [2018-11-10 13:04:53,486 INFO L425 ceAbstractionStarter]: For program point L166(lines 166 177) no Hoare annotation was computed. [2018-11-10 13:04:53,487 INFO L425 ceAbstractionStarter]: For program point L100(lines 100 115) no Hoare annotation was computed. [2018-11-10 13:04:53,487 INFO L425 ceAbstractionStarter]: For program point L34(lines 34 36) no Hoare annotation was computed. [2018-11-10 13:04:53,487 INFO L421 ceAbstractionStarter]: At program point L381(lines 22 385) the Hoare annotation is: (let ((.cse0 (<= main_~this_state~0 0))) (or (and .cse0 (= main_~q~0 2)) (and (= main_~q~0 3) (= main_~this_state~0 2)) (and .cse0 (= main_~q~0 0)) (and (= main_~this_state~0 3) (<= 4 main_~q~0)))) [2018-11-10 13:04:53,487 INFO L425 ceAbstractionStarter]: For program point L348(lines 348 363) no Hoare annotation was computed. [2018-11-10 13:04:53,487 INFO L425 ceAbstractionStarter]: For program point L216(lines 216 231) no Hoare annotation was computed. [2018-11-10 13:04:53,487 INFO L425 ceAbstractionStarter]: For program point L183(lines 183 282) no Hoare annotation was computed. [2018-11-10 13:04:53,487 INFO L425 ceAbstractionStarter]: For program point L150(lines 150 161) no Hoare annotation was computed. [2018-11-10 13:04:53,487 INFO L425 ceAbstractionStarter]: For program point L332(lines 332 347) no Hoare annotation was computed. [2018-11-10 13:04:53,487 INFO L425 ceAbstractionStarter]: For program point L266(lines 266 277) no Hoare annotation was computed. [2018-11-10 13:04:53,487 INFO L425 ceAbstractionStarter]: For program point L200(lines 200 215) no Hoare annotation was computed. [2018-11-10 13:04:53,488 INFO L425 ceAbstractionStarter]: For program point L134(lines 134 145) no Hoare annotation was computed. [2018-11-10 13:04:53,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 01:04:53 BoogieIcfgContainer [2018-11-10 13:04:53,498 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 13:04:53,498 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 13:04:53,498 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 13:04:53,498 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 13:04:53,499 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:04:52" (3/4) ... [2018-11-10 13:04:53,501 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 13:04:53,505 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 13:04:53,505 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 13:04:53,509 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-10 13:04:53,509 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 13:04:53,532 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_488dbba9-6a0f-4f30-a534-25a68e61e5cc/bin-2019/uautomizer/witness.graphml [2018-11-10 13:04:53,533 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 13:04:53,533 INFO L168 Benchmark]: Toolchain (without parser) took 1773.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 959.1 MB in the beginning and 916.4 MB in the end (delta: 42.8 MB). Peak memory consumption was 151.8 MB. Max. memory is 11.5 GB. [2018-11-10 13:04:53,534 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:04:53,534 INFO L168 Benchmark]: CACSL2BoogieTranslator took 199.83 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-10 13:04:53,535 INFO L168 Benchmark]: Boogie Preprocessor took 23.65 ms. Allocated memory is still 1.0 GB. Free memory was 945.7 MB in the beginning and 943.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 13:04:53,535 INFO L168 Benchmark]: RCFGBuilder took 359.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -133.4 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2018-11-10 13:04:53,536 INFO L168 Benchmark]: TraceAbstraction took 1152.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 916.4 MB in the end (delta: 160.1 MB). Peak memory consumption was 160.1 MB. Max. memory is 11.5 GB. [2018-11-10 13:04:53,536 INFO L168 Benchmark]: Witness Printer took 34.57 ms. Allocated memory is still 1.1 GB. Free memory is still 916.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:04:53,538 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 199.83 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.65 ms. Allocated memory is still 1.0 GB. Free memory was 945.7 MB in the beginning and 943.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 359.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -133.4 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1152.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 916.4 MB in the end (delta: 160.1 MB). Peak memory consumption was 160.1 MB. Max. memory is 11.5 GB. * Witness Printer took 34.57 ms. Allocated memory is still 1.1 GB. Free memory is still 916.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 389]: 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: 22]: Loop Invariant Derived loop invariant: (((this_state <= 0 && q == 2) || (q == 3 && this_state == 2)) || (this_state <= 0 && q == 0)) || (this_state == 3 && 4 <= q) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (this_state <= 0 && q == 0) || (this_state == 3 && 4 <= q) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 83 locations, 1 error locations. SAFE Result, 1.1s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1008 SDtfs, 337 SDslu, 455 SDs, 0 SdLazy, 217 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 28 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 13 NumberOfFragments, 49 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 27 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 277 NumberOfCodeBlocks, 277 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 266 ConstructedInterpolants, 0 QuantifiedInterpolants, 10566 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 55/55 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...