java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem11_label39.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 18:25:00,838 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 18:25:00,841 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 18:25:00,859 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 18:25:00,859 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 18:25:00,861 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 18:25:00,863 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 18:25:00,874 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 18:25:00,878 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 18:25:00,881 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 18:25:00,883 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 18:25:00,885 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 18:25:00,885 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 18:25:00,886 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 18:25:00,887 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 18:25:00,889 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 18:25:00,890 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 18:25:00,892 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 18:25:00,894 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 18:25:00,899 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 18:25:00,902 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 18:25:00,904 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 18:25:00,907 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 18:25:00,908 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 18:25:00,910 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 18:25:00,910 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 18:25:00,910 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 18:25:00,912 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 18:25:00,913 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 18:25:00,914 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 18:25:00,915 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 18:25:00,916 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 18:25:00,917 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 18:25:00,918 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 18:25:00,919 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 18:25:00,920 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 18:25:00,920 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 18:25:00,921 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 18:25:00,921 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 18:25:00,922 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 18:25:00,922 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 18:25:00,923 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 18:25:00,961 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 18:25:00,962 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 18:25:00,963 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 18:25:00,963 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 18:25:00,963 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 18:25:00,963 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 18:25:00,964 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 18:25:00,964 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 18:25:00,966 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 18:25:00,967 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 18:25:00,967 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 18:25:00,967 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 18:25:00,967 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 18:25:00,967 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 18:25:00,968 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 18:25:00,968 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 18:25:00,968 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 18:25:00,968 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 18:25:00,968 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 18:25:00,969 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 18:25:00,969 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 18:25:00,969 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 18:25:00,970 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 18:25:00,971 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 18:25:00,971 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 18:25:00,971 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 18:25:00,971 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 18:25:00,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 18:25:00,972 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 18:25:00,999 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 18:25:01,010 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 18:25:01,014 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 18:25:01,015 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 18:25:01,016 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 18:25:01,016 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label39.c [2019-09-07 18:25:01,085 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fe4e6eeb/97669b431ed141188489e26a7e17032a/FLAG4f833740b [2019-09-07 18:25:01,731 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 18:25:01,731 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label39.c [2019-09-07 18:25:01,746 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fe4e6eeb/97669b431ed141188489e26a7e17032a/FLAG4f833740b [2019-09-07 18:25:01,957 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fe4e6eeb/97669b431ed141188489e26a7e17032a [2019-09-07 18:25:01,967 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 18:25:01,969 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 18:25:01,970 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 18:25:01,970 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 18:25:01,974 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 18:25:01,975 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 06:25:01" (1/1) ... [2019-09-07 18:25:01,978 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e99e16f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:25:01, skipping insertion in model container [2019-09-07 18:25:01,978 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 06:25:01" (1/1) ... [2019-09-07 18:25:01,986 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 18:25:02,050 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 18:25:02,656 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 18:25:02,662 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 18:25:02,916 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 18:25:02,940 INFO L192 MainTranslator]: Completed translation [2019-09-07 18:25:02,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:25:02 WrapperNode [2019-09-07 18:25:02,940 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 18:25:02,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 18:25:02,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 18:25:02,942 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 18:25:02,963 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:25:02" (1/1) ... [2019-09-07 18:25:02,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:25:02" (1/1) ... [2019-09-07 18:25:03,009 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:25:02" (1/1) ... [2019-09-07 18:25:03,010 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:25:02" (1/1) ... [2019-09-07 18:25:03,066 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:25:02" (1/1) ... [2019-09-07 18:25:03,090 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:25:02" (1/1) ... [2019-09-07 18:25:03,128 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:25:02" (1/1) ... [2019-09-07 18:25:03,145 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 18:25:03,146 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 18:25:03,146 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 18:25:03,147 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 18:25:03,148 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:25:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-09-07 18:25:03,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 18:25:03,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 18:25:03,238 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-09-07 18:25:03,239 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 18:25:03,240 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-09-07 18:25:03,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 18:25:03,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 18:25:03,241 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-07 18:25:03,241 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 18:25:03,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 18:25:03,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 18:25:05,253 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 18:25:05,257 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-07 18:25:05,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 06:25:05 BoogieIcfgContainer [2019-09-07 18:25:05,259 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 18:25:05,262 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 18:25:05,262 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 18:25:05,269 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 18:25:05,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 06:25:01" (1/3) ... [2019-09-07 18:25:05,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd8b7f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 06:25:05, skipping insertion in model container [2019-09-07 18:25:05,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 06:25:02" (2/3) ... [2019-09-07 18:25:05,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd8b7f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 06:25:05, skipping insertion in model container [2019-09-07 18:25:05,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 06:25:05" (3/3) ... [2019-09-07 18:25:05,276 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label39.c [2019-09-07 18:25:05,288 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 18:25:05,298 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 18:25:05,317 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 18:25:05,352 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 18:25:05,352 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 18:25:05,352 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 18:25:05,353 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 18:25:05,353 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 18:25:05,353 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 18:25:05,353 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 18:25:05,353 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 18:25:05,354 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 18:25:05,382 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states. [2019-09-07 18:25:05,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-07 18:25:05,389 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:25:05,390 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:25:05,393 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:25:05,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:25:05,399 INFO L82 PathProgramCache]: Analyzing trace with hash 284650251, now seen corresponding path program 1 times [2019-09-07 18:25:05,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:25:05,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:25:05,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:25:05,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:25:05,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:25:05,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:25:05,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:25:05,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:25:05,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 18:25:05,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 18:25:05,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 18:25:05,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 18:25:05,684 INFO L87 Difference]: Start difference. First operand 292 states. Second operand 3 states. [2019-09-07 18:25:07,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:25:07,234 INFO L93 Difference]: Finished difference Result 780 states and 1368 transitions. [2019-09-07 18:25:07,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 18:25:07,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-09-07 18:25:07,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:25:07,257 INFO L225 Difference]: With dead ends: 780 [2019-09-07 18:25:07,257 INFO L226 Difference]: Without dead ends: 425 [2019-09-07 18:25:07,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-09-07 18:25:07,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2019-09-07 18:25:07,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 425. [2019-09-07 18:25:07,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-09-07 18:25:07,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 613 transitions. [2019-09-07 18:25:07,346 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 613 transitions. Word has length 16 [2019-09-07 18:25:07,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:25:07,347 INFO L475 AbstractCegarLoop]: Abstraction has 425 states and 613 transitions. [2019-09-07 18:25:07,347 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 18:25:07,347 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 613 transitions. [2019-09-07 18:25:07,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-07 18:25:07,352 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:25:07,352 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:25:07,352 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:25:07,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:25:07,353 INFO L82 PathProgramCache]: Analyzing trace with hash 137345354, now seen corresponding path program 1 times [2019-09-07 18:25:07,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:25:07,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:25:07,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:25:07,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:25:07,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:25:07,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:25:07,648 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:25:07,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:25:07,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-07 18:25:07,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 18:25:07,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 18:25:07,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-07 18:25:07,652 INFO L87 Difference]: Start difference. First operand 425 states and 613 transitions. Second operand 6 states. [2019-09-07 18:25:09,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:25:09,183 INFO L93 Difference]: Finished difference Result 1248 states and 1821 transitions. [2019-09-07 18:25:09,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 18:25:09,184 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 88 [2019-09-07 18:25:09,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:25:09,192 INFO L225 Difference]: With dead ends: 1248 [2019-09-07 18:25:09,192 INFO L226 Difference]: Without dead ends: 829 [2019-09-07 18:25:09,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:25:09,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2019-09-07 18:25:09,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 816. [2019-09-07 18:25:09,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 816 states. [2019-09-07 18:25:09,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1166 transitions. [2019-09-07 18:25:09,255 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1166 transitions. Word has length 88 [2019-09-07 18:25:09,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:25:09,256 INFO L475 AbstractCegarLoop]: Abstraction has 816 states and 1166 transitions. [2019-09-07 18:25:09,259 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 18:25:09,259 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1166 transitions. [2019-09-07 18:25:09,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-07 18:25:09,263 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:25:09,263 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:25:09,264 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:25:09,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:25:09,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1739121885, now seen corresponding path program 1 times [2019-09-07 18:25:09,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:25:09,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:25:09,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:25:09,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:25:09,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:25:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:25:09,426 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:25:09,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:25:09,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 18:25:09,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 18:25:09,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 18:25:09,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 18:25:09,431 INFO L87 Difference]: Start difference. First operand 816 states and 1166 transitions. Second operand 4 states. [2019-09-07 18:25:11,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:25:11,171 INFO L93 Difference]: Finished difference Result 2210 states and 3299 transitions. [2019-09-07 18:25:11,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 18:25:11,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-07 18:25:11,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:25:11,181 INFO L225 Difference]: With dead ends: 2210 [2019-09-07 18:25:11,181 INFO L226 Difference]: Without dead ends: 1400 [2019-09-07 18:25:11,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 18:25:11,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2019-09-07 18:25:11,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1398. [2019-09-07 18:25:11,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1398 states. [2019-09-07 18:25:11,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 2010 transitions. [2019-09-07 18:25:11,231 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 2010 transitions. Word has length 89 [2019-09-07 18:25:11,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:25:11,232 INFO L475 AbstractCegarLoop]: Abstraction has 1398 states and 2010 transitions. [2019-09-07 18:25:11,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 18:25:11,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 2010 transitions. [2019-09-07 18:25:11,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-07 18:25:11,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:25:11,235 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:25:11,236 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:25:11,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:25:11,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1858445134, now seen corresponding path program 1 times [2019-09-07 18:25:11,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:25:11,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:25:11,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:25:11,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:25:11,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:25:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:25:11,373 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:25:11,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:25:11,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-07 18:25:11,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 18:25:11,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 18:25:11,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-07 18:25:11,376 INFO L87 Difference]: Start difference. First operand 1398 states and 2010 transitions. Second operand 5 states. [2019-09-07 18:25:13,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:25:13,146 INFO L93 Difference]: Finished difference Result 4015 states and 5952 transitions. [2019-09-07 18:25:13,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 18:25:13,146 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-09-07 18:25:13,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:25:13,162 INFO L225 Difference]: With dead ends: 4015 [2019-09-07 18:25:13,163 INFO L226 Difference]: Without dead ends: 2623 [2019-09-07 18:25:13,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-07 18:25:13,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2623 states. [2019-09-07 18:25:13,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2623 to 2597. [2019-09-07 18:25:13,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2597 states. [2019-09-07 18:25:13,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2597 states to 2597 states and 3544 transitions. [2019-09-07 18:25:13,265 INFO L78 Accepts]: Start accepts. Automaton has 2597 states and 3544 transitions. Word has length 102 [2019-09-07 18:25:13,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:25:13,266 INFO L475 AbstractCegarLoop]: Abstraction has 2597 states and 3544 transitions. [2019-09-07 18:25:13,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 18:25:13,266 INFO L276 IsEmpty]: Start isEmpty. Operand 2597 states and 3544 transitions. [2019-09-07 18:25:13,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-07 18:25:13,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:25:13,269 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:25:13,269 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:25:13,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:25:13,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1024150850, now seen corresponding path program 1 times [2019-09-07 18:25:13,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:25:13,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:25:13,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:25:13,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:25:13,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:25:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:25:13,384 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:25:13,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:25:13,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 18:25:13,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 18:25:13,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 18:25:13,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 18:25:13,386 INFO L87 Difference]: Start difference. First operand 2597 states and 3544 transitions. Second operand 4 states. [2019-09-07 18:25:15,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:25:15,239 INFO L93 Difference]: Finished difference Result 8095 states and 11439 transitions. [2019-09-07 18:25:15,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 18:25:15,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-09-07 18:25:15,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:25:15,274 INFO L225 Difference]: With dead ends: 8095 [2019-09-07 18:25:15,274 INFO L226 Difference]: Without dead ends: 5504 [2019-09-07 18:25:15,283 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 18:25:15,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5504 states. [2019-09-07 18:25:15,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5504 to 5282. [2019-09-07 18:25:15,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5282 states. [2019-09-07 18:25:15,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5282 states to 5282 states and 7163 transitions. [2019-09-07 18:25:15,520 INFO L78 Accepts]: Start accepts. Automaton has 5282 states and 7163 transitions. Word has length 110 [2019-09-07 18:25:15,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:25:15,521 INFO L475 AbstractCegarLoop]: Abstraction has 5282 states and 7163 transitions. [2019-09-07 18:25:15,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 18:25:15,522 INFO L276 IsEmpty]: Start isEmpty. Operand 5282 states and 7163 transitions. [2019-09-07 18:25:15,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-07 18:25:15,530 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:25:15,531 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:25:15,531 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:25:15,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:25:15,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1434196844, now seen corresponding path program 1 times [2019-09-07 18:25:15,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:25:15,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:25:15,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:25:15,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:25:15,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:25:15,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:25:15,819 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-09-07 18:25:15,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:25:15,819 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:25:15,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:25:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:25:15,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 18:25:15,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:25:16,074 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 93 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:25:16,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:25:16,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-09-07 18:25:16,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 18:25:16,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 18:25:16,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-09-07 18:25:16,085 INFO L87 Difference]: Start difference. First operand 5282 states and 7163 transitions. Second operand 11 states. [2019-09-07 18:25:20,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:25:20,367 INFO L93 Difference]: Finished difference Result 17351 states and 24345 transitions. [2019-09-07 18:25:20,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 18:25:20,368 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 224 [2019-09-07 18:25:20,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:25:20,433 INFO L225 Difference]: With dead ends: 17351 [2019-09-07 18:25:20,433 INFO L226 Difference]: Without dead ends: 12073 [2019-09-07 18:25:20,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 231 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-09-07 18:25:20,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12073 states. [2019-09-07 18:25:20,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12073 to 10180. [2019-09-07 18:25:20,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10180 states. [2019-09-07 18:25:20,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10180 states to 10180 states and 13705 transitions. [2019-09-07 18:25:20,858 INFO L78 Accepts]: Start accepts. Automaton has 10180 states and 13705 transitions. Word has length 224 [2019-09-07 18:25:20,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:25:20,861 INFO L475 AbstractCegarLoop]: Abstraction has 10180 states and 13705 transitions. [2019-09-07 18:25:20,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 18:25:20,861 INFO L276 IsEmpty]: Start isEmpty. Operand 10180 states and 13705 transitions. [2019-09-07 18:25:20,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-07 18:25:20,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:25:20,866 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:25:20,866 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:25:20,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:25:20,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1673330468, now seen corresponding path program 1 times [2019-09-07 18:25:20,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:25:20,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:25:20,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:25:20,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:25:20,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:25:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:25:21,270 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-07 18:25:21,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:25:21,270 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:25:21,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:25:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:25:21,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 18:25:21,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:25:21,476 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 97 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 18:25:21,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:25:21,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-09-07 18:25:21,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 18:25:21,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 18:25:21,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-07 18:25:21,483 INFO L87 Difference]: Start difference. First operand 10180 states and 13705 transitions. Second operand 11 states. [2019-09-07 18:25:28,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:25:28,900 INFO L93 Difference]: Finished difference Result 31374 states and 45803 transitions. [2019-09-07 18:25:28,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-07 18:25:28,900 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 228 [2019-09-07 18:25:28,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:25:29,020 INFO L225 Difference]: With dead ends: 31374 [2019-09-07 18:25:29,020 INFO L226 Difference]: Without dead ends: 21388 [2019-09-07 18:25:29,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1216 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=646, Invalid=3014, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 18:25:29,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21388 states. [2019-09-07 18:25:29,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21388 to 19274. [2019-09-07 18:25:29,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19274 states. [2019-09-07 18:25:30,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19274 states to 19274 states and 26457 transitions. [2019-09-07 18:25:30,468 INFO L78 Accepts]: Start accepts. Automaton has 19274 states and 26457 transitions. Word has length 228 [2019-09-07 18:25:30,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:25:30,469 INFO L475 AbstractCegarLoop]: Abstraction has 19274 states and 26457 transitions. [2019-09-07 18:25:30,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 18:25:30,469 INFO L276 IsEmpty]: Start isEmpty. Operand 19274 states and 26457 transitions. [2019-09-07 18:25:30,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-07 18:25:30,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:25:30,476 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:25:30,476 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:25:30,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:25:30,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1114261408, now seen corresponding path program 1 times [2019-09-07 18:25:30,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:25:30,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:25:30,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:25:30,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:25:30,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:25:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:25:30,645 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-07 18:25:30,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 18:25:30,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 18:25:30,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 18:25:30,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 18:25:30,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 18:25:30,647 INFO L87 Difference]: Start difference. First operand 19274 states and 26457 transitions. Second operand 4 states. [2019-09-07 18:25:32,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:25:32,669 INFO L93 Difference]: Finished difference Result 51088 states and 72210 transitions. [2019-09-07 18:25:32,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 18:25:32,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 259 [2019-09-07 18:25:32,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:25:32,780 INFO L225 Difference]: With dead ends: 51088 [2019-09-07 18:25:32,780 INFO L226 Difference]: Without dead ends: 32198 [2019-09-07 18:25:32,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 18:25:32,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32198 states. [2019-09-07 18:25:33,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32198 to 28226. [2019-09-07 18:25:33,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28226 states. [2019-09-07 18:25:33,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28226 states to 28226 states and 37183 transitions. [2019-09-07 18:25:33,554 INFO L78 Accepts]: Start accepts. Automaton has 28226 states and 37183 transitions. Word has length 259 [2019-09-07 18:25:33,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:25:33,555 INFO L475 AbstractCegarLoop]: Abstraction has 28226 states and 37183 transitions. [2019-09-07 18:25:33,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 18:25:33,555 INFO L276 IsEmpty]: Start isEmpty. Operand 28226 states and 37183 transitions. [2019-09-07 18:25:33,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-09-07 18:25:33,568 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:25:33,568 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:25:33,569 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:25:33,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:25:33,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1653641355, now seen corresponding path program 1 times [2019-09-07 18:25:33,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:25:33,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:25:33,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:25:33,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:25:33,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:25:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:25:33,849 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 193 proven. 2 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-07 18:25:33,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:25:33,849 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:25:33,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:25:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:25:33,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 18:25:33,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:25:34,171 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 193 proven. 2 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-07 18:25:34,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:25:34,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 18:25:34,177 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 18:25:34,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 18:25:34,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:25:34,178 INFO L87 Difference]: Start difference. First operand 28226 states and 37183 transitions. Second operand 9 states. [2019-09-07 18:25:37,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:25:37,230 INFO L93 Difference]: Finished difference Result 61359 states and 89415 transitions. [2019-09-07 18:25:37,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 18:25:37,230 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 312 [2019-09-07 18:25:37,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:25:37,399 INFO L225 Difference]: With dead ends: 61359 [2019-09-07 18:25:37,399 INFO L226 Difference]: Without dead ends: 33909 [2019-09-07 18:25:37,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-09-07 18:25:37,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33909 states. [2019-09-07 18:25:38,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33909 to 32776. [2019-09-07 18:25:38,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32776 states. [2019-09-07 18:25:38,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32776 states to 32776 states and 42216 transitions. [2019-09-07 18:25:38,656 INFO L78 Accepts]: Start accepts. Automaton has 32776 states and 42216 transitions. Word has length 312 [2019-09-07 18:25:38,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:25:38,657 INFO L475 AbstractCegarLoop]: Abstraction has 32776 states and 42216 transitions. [2019-09-07 18:25:38,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 18:25:38,657 INFO L276 IsEmpty]: Start isEmpty. Operand 32776 states and 42216 transitions. [2019-09-07 18:25:38,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-09-07 18:25:38,674 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:25:38,674 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:25:38,675 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:25:38,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:25:38,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1131121986, now seen corresponding path program 1 times [2019-09-07 18:25:38,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:25:38,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:25:38,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:25:38,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:25:38,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:25:38,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:25:38,956 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 198 proven. 2 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-09-07 18:25:38,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:25:38,956 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:25:38,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:25:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:25:39,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 18:25:39,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:25:39,417 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 198 proven. 2 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-09-07 18:25:39,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:25:39,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2019-09-07 18:25:39,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 18:25:39,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 18:25:39,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-07 18:25:39,433 INFO L87 Difference]: Start difference. First operand 32776 states and 42216 transitions. Second operand 6 states. [2019-09-07 18:25:40,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:25:40,954 INFO L93 Difference]: Finished difference Result 60253 states and 78172 transitions. [2019-09-07 18:25:40,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 18:25:40,954 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 317 [2019-09-07 18:25:40,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:25:41,033 INFO L225 Difference]: With dead ends: 60253 [2019-09-07 18:25:41,033 INFO L226 Difference]: Without dead ends: 27099 [2019-09-07 18:25:41,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:25:41,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27099 states. [2019-09-07 18:25:41,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27099 to 24105. [2019-09-07 18:25:41,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24105 states. [2019-09-07 18:25:41,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24105 states to 24105 states and 29286 transitions. [2019-09-07 18:25:41,587 INFO L78 Accepts]: Start accepts. Automaton has 24105 states and 29286 transitions. Word has length 317 [2019-09-07 18:25:41,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:25:41,588 INFO L475 AbstractCegarLoop]: Abstraction has 24105 states and 29286 transitions. [2019-09-07 18:25:41,588 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 18:25:41,588 INFO L276 IsEmpty]: Start isEmpty. Operand 24105 states and 29286 transitions. [2019-09-07 18:25:41,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-09-07 18:25:41,609 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:25:41,609 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:25:41,610 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:25:41,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:25:41,610 INFO L82 PathProgramCache]: Analyzing trace with hash -730901409, now seen corresponding path program 1 times [2019-09-07 18:25:41,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:25:41,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:25:41,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:25:41,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:25:41,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:25:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:25:42,180 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 220 proven. 2 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-07 18:25:42,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:25:42,180 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:25:42,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:25:42,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:25:42,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 18:25:42,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:25:42,416 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 220 proven. 2 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 18:25:42,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:25:42,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-09-07 18:25:42,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 18:25:42,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 18:25:42,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-07 18:25:42,431 INFO L87 Difference]: Start difference. First operand 24105 states and 29286 transitions. Second operand 9 states. [2019-09-07 18:25:45,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:25:45,433 INFO L93 Difference]: Finished difference Result 50712 states and 63327 transitions. [2019-09-07 18:25:45,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 18:25:45,438 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 350 [2019-09-07 18:25:45,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:25:45,740 INFO L225 Difference]: With dead ends: 50712 [2019-09-07 18:25:45,740 INFO L226 Difference]: Without dead ends: 26801 [2019-09-07 18:25:45,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2019-09-07 18:25:45,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26801 states. [2019-09-07 18:25:46,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26801 to 26419. [2019-09-07 18:25:46,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26419 states. [2019-09-07 18:25:46,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26419 states to 26419 states and 31404 transitions. [2019-09-07 18:25:46,141 INFO L78 Accepts]: Start accepts. Automaton has 26419 states and 31404 transitions. Word has length 350 [2019-09-07 18:25:46,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:25:46,141 INFO L475 AbstractCegarLoop]: Abstraction has 26419 states and 31404 transitions. [2019-09-07 18:25:46,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 18:25:46,141 INFO L276 IsEmpty]: Start isEmpty. Operand 26419 states and 31404 transitions. [2019-09-07 18:25:46,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-09-07 18:25:46,160 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:25:46,161 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:25:46,161 INFO L418 AbstractCegarLoop]: === Iteration 12 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:25:46,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:25:46,162 INFO L82 PathProgramCache]: Analyzing trace with hash 594120426, now seen corresponding path program 1 times [2019-09-07 18:25:46,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:25:46,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:25:46,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:25:46,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:25:46,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:25:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:25:46,406 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 115 proven. 86 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-09-07 18:25:46,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 18:25:46,408 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 18:25:46,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 18:25:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 18:25:46,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 18:25:46,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 18:25:46,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:25:46,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:25:46,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:25:46,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:25:46,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:25:46,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:25:46,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:25:46,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 18:25:58,983 WARN L188 SmtUtils]: Spent 10.23 s on a formula simplification. DAG size of input: 51 DAG size of output: 21 [2019-09-07 18:25:59,106 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 220 proven. 85 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-07 18:25:59,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 18:25:59,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8] total 9 [2019-09-07 18:25:59,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 18:25:59,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 18:25:59,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=53, Unknown=1, NotChecked=0, Total=72 [2019-09-07 18:25:59,112 INFO L87 Difference]: Start difference. First operand 26419 states and 31404 transitions. Second operand 9 states. [2019-09-07 18:26:22,310 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2019-09-07 18:30:30,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 18:30:30,174 INFO L93 Difference]: Finished difference Result 58673 states and 71225 transitions. [2019-09-07 18:30:30,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 18:30:30,175 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 370 [2019-09-07 18:30:30,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 18:30:30,258 INFO L225 Difference]: With dead ends: 58673 [2019-09-07 18:30:30,259 INFO L226 Difference]: Without dead ends: 33030 [2019-09-07 18:30:30,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 381 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 32.5s TimeCoverageRelationStatistics Valid=154, Invalid=486, Unknown=10, NotChecked=0, Total=650 [2019-09-07 18:30:30,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33030 states. [2019-09-07 18:30:30,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33030 to 32502. [2019-09-07 18:30:30,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32502 states. [2019-09-07 18:30:30,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32502 states to 32502 states and 38339 transitions. [2019-09-07 18:30:30,802 INFO L78 Accepts]: Start accepts. Automaton has 32502 states and 38339 transitions. Word has length 370 [2019-09-07 18:30:30,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 18:30:30,803 INFO L475 AbstractCegarLoop]: Abstraction has 32502 states and 38339 transitions. [2019-09-07 18:30:30,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 18:30:30,803 INFO L276 IsEmpty]: Start isEmpty. Operand 32502 states and 38339 transitions. [2019-09-07 18:30:30,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-09-07 18:30:30,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 18:30:30,826 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 18:30:30,826 INFO L418 AbstractCegarLoop]: === Iteration 13 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 18:30:30,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 18:30:30,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1191665206, now seen corresponding path program 1 times [2019-09-07 18:30:30,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 18:30:30,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 18:30:30,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:30:30,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 18:30:30,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 18:30:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-07 18:30:30,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-07 18:30:31,008 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Int term has non-integral value at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.fillInTermValues(ModelBuilder.java:93) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.(ModelBuilder.java:66) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.CClosure.fillInModel(CClosure.java:745) at de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.(Model.java:108) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.buildModel(SMTInterpol.java:1221) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getValue(SMTInterpol.java:1090) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.getValues(SmtUtils.java:1813) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.getValue(TraceCheck.java:396) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.computeRcfgProgramExecution(TraceCheck.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:344) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.(TraceCheck.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.(TraceCheck.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-09-07 18:30:31,015 INFO L168 Benchmark]: Toolchain (without parser) took 329045.29 ms. Allocated memory was 133.7 MB in the beginning and 1.3 GB in the end (delta: 1.2 GB). Free memory was 86.9 MB in the beginning and 355.0 MB in the end (delta: -268.1 MB). Peak memory consumption was 922.5 MB. Max. memory is 7.1 GB. [2019-09-07 18:30:31,017 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 133.7 MB. Free memory was 108.2 MB in the beginning and 108.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-07 18:30:31,021 INFO L168 Benchmark]: CACSL2BoogieTranslator took 970.63 ms. Allocated memory was 133.7 MB in the beginning and 201.9 MB in the end (delta: 68.2 MB). Free memory was 86.7 MB in the beginning and 140.5 MB in the end (delta: -53.8 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2019-09-07 18:30:31,022 INFO L168 Benchmark]: Boogie Preprocessor took 203.81 ms. Allocated memory is still 201.9 MB. Free memory was 140.5 MB in the beginning and 132.6 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 7.1 GB. [2019-09-07 18:30:31,023 INFO L168 Benchmark]: RCFGBuilder took 2113.40 ms. Allocated memory was 201.9 MB in the beginning and 228.1 MB in the end (delta: 26.2 MB). Free memory was 132.6 MB in the beginning and 79.2 MB in the end (delta: 53.4 MB). Peak memory consumption was 79.6 MB. Max. memory is 7.1 GB. [2019-09-07 18:30:31,025 INFO L168 Benchmark]: TraceAbstraction took 325751.06 ms. Allocated memory was 228.1 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 79.2 MB in the beginning and 355.0 MB in the end (delta: -275.8 MB). Peak memory consumption was 820.4 MB. Max. memory is 7.1 GB. [2019-09-07 18:30:31,032 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.21 ms. Allocated memory is still 133.7 MB. Free memory was 108.2 MB in the beginning and 108.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 970.63 ms. Allocated memory was 133.7 MB in the beginning and 201.9 MB in the end (delta: 68.2 MB). Free memory was 86.7 MB in the beginning and 140.5 MB in the end (delta: -53.8 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 203.81 ms. Allocated memory is still 201.9 MB. Free memory was 140.5 MB in the beginning and 132.6 MB in the end (delta: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2113.40 ms. Allocated memory was 201.9 MB in the beginning and 228.1 MB in the end (delta: 26.2 MB). Free memory was 132.6 MB in the beginning and 79.2 MB in the end (delta: 53.4 MB). Peak memory consumption was 79.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 325751.06 ms. Allocated memory was 228.1 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 79.2 MB in the beginning and 355.0 MB in the end (delta: -275.8 MB). Peak memory consumption was 820.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Int term has non-integral value de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Int term has non-integral value: de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.fillInTermValues(ModelBuilder.java:93) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...