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/product-lines/elevator_spec14_product28.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 03:42:35,802 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 03:42:35,805 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 03:42:35,823 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 03:42:35,823 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 03:42:35,825 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 03:42:35,827 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 03:42:35,839 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 03:42:35,841 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 03:42:35,841 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 03:42:35,842 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 03:42:35,844 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 03:42:35,844 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 03:42:35,845 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 03:42:35,846 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 03:42:35,847 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 03:42:35,847 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 03:42:35,848 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 03:42:35,850 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 03:42:35,852 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 03:42:35,853 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 03:42:35,854 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 03:42:35,855 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 03:42:35,856 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 03:42:35,858 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 03:42:35,858 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 03:42:35,858 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 03:42:35,859 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 03:42:35,860 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 03:42:35,860 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 03:42:35,861 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 03:42:35,861 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 03:42:35,862 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 03:42:35,863 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 03:42:35,864 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 03:42:35,864 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 03:42:35,865 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 03:42:35,865 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 03:42:35,865 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 03:42:35,866 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 03:42:35,867 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 03:42:35,868 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-08 03:42:35,884 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 03:42:35,884 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 03:42:35,889 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 03:42:35,889 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 03:42:35,889 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 03:42:35,890 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 03:42:35,890 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 03:42:35,890 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 03:42:35,891 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 03:42:35,891 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 03:42:35,891 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 03:42:35,891 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 03:42:35,891 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 03:42:35,892 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 03:42:35,892 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 03:42:35,892 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 03:42:35,892 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 03:42:35,892 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 03:42:35,893 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 03:42:35,893 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 03:42:35,893 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 03:42:35,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 03:42:35,895 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 03:42:35,895 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 03:42:35,895 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 03:42:35,895 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 03:42:35,895 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 03:42:35,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 03:42:35,896 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 03:42:35,935 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 03:42:35,947 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 03:42:35,951 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 03:42:35,952 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 03:42:35,952 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 03:42:35,953 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec14_product28.cil.c [2019-09-08 03:42:36,012 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13f315993/3ffbd279e20e4fc9a85e4fb0a170a431/FLAG1a6a2556d [2019-09-08 03:42:36,632 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 03:42:36,633 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec14_product28.cil.c [2019-09-08 03:42:36,656 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13f315993/3ffbd279e20e4fc9a85e4fb0a170a431/FLAG1a6a2556d [2019-09-08 03:42:36,844 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13f315993/3ffbd279e20e4fc9a85e4fb0a170a431 [2019-09-08 03:42:36,856 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 03:42:36,858 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 03:42:36,859 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 03:42:36,859 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 03:42:36,863 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 03:42:36,864 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:42:36" (1/1) ... [2019-09-08 03:42:36,867 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b0b743b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:42:36, skipping insertion in model container [2019-09-08 03:42:36,867 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:42:36" (1/1) ... [2019-09-08 03:42:36,875 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 03:42:36,967 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 03:42:37,704 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:42:37,720 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 03:42:37,899 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:42:37,998 INFO L192 MainTranslator]: Completed translation [2019-09-08 03:42:37,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:42:37 WrapperNode [2019-09-08 03:42:37,999 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 03:42:38,000 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 03:42:38,000 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 03:42:38,000 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 03:42:38,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:42:37" (1/1) ... [2019-09-08 03:42:38,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:42:37" (1/1) ... [2019-09-08 03:42:38,078 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:42:37" (1/1) ... [2019-09-08 03:42:38,079 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:42:37" (1/1) ... [2019-09-08 03:42:38,136 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:42:37" (1/1) ... [2019-09-08 03:42:38,169 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:42:37" (1/1) ... [2019-09-08 03:42:38,181 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:42:37" (1/1) ... [2019-09-08 03:42:38,197 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 03:42:38,197 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 03:42:38,198 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 03:42:38,198 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 03:42:38,199 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:42:37" (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-08 03:42:38,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 03:42:38,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 03:42:38,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 03:42:38,264 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 03:42:38,265 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 03:42:38,265 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 03:42:38,265 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 03:42:38,265 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification14_spec__1 [2019-09-08 03:42:38,266 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-08 03:42:38,266 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-08 03:42:38,266 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-08 03:42:38,266 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-08 03:42:38,267 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-08 03:42:38,267 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-08 03:42:38,268 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-08 03:42:38,268 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-08 03:42:38,271 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-08 03:42:38,271 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-09-08 03:42:38,271 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-08 03:42:38,272 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-08 03:42:38,273 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-08 03:42:38,273 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-08 03:42:38,273 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-08 03:42:38,274 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-08 03:42:38,274 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-08 03:42:38,274 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-08 03:42:38,274 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-08 03:42:38,274 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-08 03:42:38,275 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-09-08 03:42:38,275 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-08 03:42:38,275 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-08 03:42:38,275 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-08 03:42:38,275 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-08 03:42:38,275 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-08 03:42:38,276 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-08 03:42:38,276 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-08 03:42:38,276 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2019-09-08 03:42:38,276 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-08 03:42:38,277 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__executivefloor [2019-09-08 03:42:38,277 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-08 03:42:38,277 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-08 03:42:38,277 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-09-08 03:42:38,277 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-09-08 03:42:38,277 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 03:42:38,278 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-08 03:42:38,278 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-08 03:42:38,278 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-08 03:42:38,278 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-08 03:42:38,278 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-08 03:42:38,279 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-08 03:42:38,279 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-08 03:42:38,279 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-08 03:42:38,279 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-08 03:42:38,279 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-08 03:42:38,279 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-08 03:42:38,280 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-08 03:42:38,280 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-08 03:42:38,280 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-08 03:42:38,280 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 03:42:38,281 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-08 03:42:38,281 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 03:42:38,281 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 03:42:38,281 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-08 03:42:38,281 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-08 03:42:38,282 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-08 03:42:38,282 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-08 03:42:38,282 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-08 03:42:38,282 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-08 03:42:38,283 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-08 03:42:38,283 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-08 03:42:38,283 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-08 03:42:38,283 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-08 03:42:38,284 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 03:42:38,284 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 03:42:38,285 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 03:42:38,285 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 03:42:38,285 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 03:42:38,285 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 03:42:38,285 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 03:42:38,286 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 03:42:38,286 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 03:42:38,286 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 03:42:38,287 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 03:42:38,287 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 03:42:38,287 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 03:42:38,287 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-08 03:42:38,287 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-08 03:42:38,288 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-09-08 03:42:38,289 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-09-08 03:42:38,289 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification14_spec__1 [2019-09-08 03:42:38,289 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-08 03:42:38,290 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-08 03:42:38,290 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-08 03:42:38,290 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 03:42:38,290 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-08 03:42:38,290 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-08 03:42:38,291 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-08 03:42:38,291 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-08 03:42:38,291 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-08 03:42:38,291 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-08 03:42:38,291 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-08 03:42:38,291 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-08 03:42:38,292 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-08 03:42:38,292 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-08 03:42:38,292 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-08 03:42:38,292 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-08 03:42:38,292 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-08 03:42:38,292 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-08 03:42:38,293 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-08 03:42:38,293 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-08 03:42:38,293 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-08 03:42:38,293 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-08 03:42:38,293 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-09-08 03:42:38,293 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-08 03:42:38,294 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-08 03:42:38,294 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-08 03:42:38,294 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-08 03:42:38,294 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-08 03:42:38,294 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-09-08 03:42:38,295 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-08 03:42:38,295 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-08 03:42:38,295 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-08 03:42:38,295 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-08 03:42:38,296 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-08 03:42:38,297 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-08 03:42:38,297 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2019-09-08 03:42:38,297 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__executivefloor [2019-09-08 03:42:38,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 03:42:38,297 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-08 03:42:38,298 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-08 03:42:38,298 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-08 03:42:38,298 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-08 03:42:38,298 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-08 03:42:38,299 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 03:42:38,299 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 03:42:38,299 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-08 03:42:38,299 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-08 03:42:38,299 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-08 03:42:38,300 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-08 03:42:38,300 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-08 03:42:38,303 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-08 03:42:38,304 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-08 03:42:38,305 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-08 03:42:38,305 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-08 03:42:38,312 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-08 03:42:38,312 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-08 03:42:38,313 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 03:42:38,313 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-08 03:42:38,313 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 03:42:38,313 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-08 03:42:38,313 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-08 03:42:38,313 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-08 03:42:38,314 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 03:42:38,314 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 03:42:38,314 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 03:42:38,314 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 03:42:38,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 03:42:38,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 03:42:38,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 03:42:38,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 03:42:38,315 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 03:42:38,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 03:42:38,315 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 03:42:38,315 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 03:42:38,315 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 03:42:38,315 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 03:42:38,316 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 03:42:38,316 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 03:42:38,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 03:42:38,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 03:42:38,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 03:42:40,457 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 03:42:40,458 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-08 03:42:40,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:42:40 BoogieIcfgContainer [2019-09-08 03:42:40,460 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 03:42:40,461 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 03:42:40,461 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 03:42:40,465 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 03:42:40,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 03:42:36" (1/3) ... [2019-09-08 03:42:40,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b2aa2e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:42:40, skipping insertion in model container [2019-09-08 03:42:40,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:42:37" (2/3) ... [2019-09-08 03:42:40,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b2aa2e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:42:40, skipping insertion in model container [2019-09-08 03:42:40,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:42:40" (3/3) ... [2019-09-08 03:42:40,469 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product28.cil.c [2019-09-08 03:42:40,480 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 03:42:40,491 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 03:42:40,508 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 03:42:40,556 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 03:42:40,557 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 03:42:40,557 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 03:42:40,557 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 03:42:40,557 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 03:42:40,557 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 03:42:40,558 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 03:42:40,558 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 03:42:40,558 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 03:42:40,597 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states. [2019-09-08 03:42:40,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 03:42:40,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:42:40,613 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:42:40,615 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:42:40,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:42:40,621 INFO L82 PathProgramCache]: Analyzing trace with hash 409688857, now seen corresponding path program 1 times [2019-09-08 03:42:40,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:42:40,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:42:40,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:40,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:40,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:40,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:41,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:42:41,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:42:41,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:42:41,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:42:41,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:42:41,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:42:41,186 INFO L87 Difference]: Start difference. First operand 767 states. Second operand 4 states. [2019-09-08 03:42:41,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:42:41,461 INFO L93 Difference]: Finished difference Result 1218 states and 1946 transitions. [2019-09-08 03:42:41,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:42:41,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-09-08 03:42:41,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:42:41,501 INFO L225 Difference]: With dead ends: 1218 [2019-09-08 03:42:41,501 INFO L226 Difference]: Without dead ends: 612 [2019-09-08 03:42:41,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:42:41,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-09-08 03:42:41,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-09-08 03:42:41,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-09-08 03:42:41,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 964 transitions. [2019-09-08 03:42:41,666 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 964 transitions. Word has length 87 [2019-09-08 03:42:41,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:42:41,667 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 964 transitions. [2019-09-08 03:42:41,667 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:42:41,667 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 964 transitions. [2019-09-08 03:42:41,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 03:42:41,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:42:41,674 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:42:41,674 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:42:41,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:42:41,674 INFO L82 PathProgramCache]: Analyzing trace with hash -728771867, now seen corresponding path program 1 times [2019-09-08 03:42:41,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:42:41,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:42:41,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:41,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:41,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:41,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:42:41,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:42:41,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:42:41,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:42:41,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:42:41,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:42:41,924 INFO L87 Difference]: Start difference. First operand 612 states and 964 transitions. Second operand 4 states. [2019-09-08 03:42:42,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:42:42,035 INFO L93 Difference]: Finished difference Result 1191 states and 1889 transitions. [2019-09-08 03:42:42,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:42:42,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-09-08 03:42:42,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:42:42,044 INFO L225 Difference]: With dead ends: 1191 [2019-09-08 03:42:42,044 INFO L226 Difference]: Without dead ends: 612 [2019-09-08 03:42:42,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:42:42,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-09-08 03:42:42,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-09-08 03:42:42,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-09-08 03:42:42,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 963 transitions. [2019-09-08 03:42:42,096 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 963 transitions. Word has length 88 [2019-09-08 03:42:42,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:42:42,097 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 963 transitions. [2019-09-08 03:42:42,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:42:42,101 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 963 transitions. [2019-09-08 03:42:42,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 03:42:42,106 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:42:42,107 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:42:42,110 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:42:42,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:42:42,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1257668075, now seen corresponding path program 1 times [2019-09-08 03:42:42,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:42:42,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:42:42,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:42,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:42,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:42,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:42:42,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:42:42,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:42:42,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:42:42,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:42:42,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:42:42,307 INFO L87 Difference]: Start difference. First operand 612 states and 963 transitions. Second operand 4 states. [2019-09-08 03:42:42,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:42:42,385 INFO L93 Difference]: Finished difference Result 1191 states and 1888 transitions. [2019-09-08 03:42:42,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:42:42,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-09-08 03:42:42,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:42:42,390 INFO L225 Difference]: With dead ends: 1191 [2019-09-08 03:42:42,391 INFO L226 Difference]: Without dead ends: 612 [2019-09-08 03:42:42,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:42:42,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-09-08 03:42:42,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-09-08 03:42:42,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-09-08 03:42:42,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 962 transitions. [2019-09-08 03:42:42,417 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 962 transitions. Word has length 89 [2019-09-08 03:42:42,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:42:42,418 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 962 transitions. [2019-09-08 03:42:42,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:42:42,418 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 962 transitions. [2019-09-08 03:42:42,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 03:42:42,420 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:42:42,420 INFO L399 BasicCegarLoop]: trace histogram [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-08 03:42:42,420 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:42:42,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:42:42,420 INFO L82 PathProgramCache]: Analyzing trace with hash -69933471, now seen corresponding path program 1 times [2019-09-08 03:42:42,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:42:42,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:42:42,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:42,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:42,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:42,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:42:42,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:42:42,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:42:42,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:42:42,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:42:42,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:42:42,526 INFO L87 Difference]: Start difference. First operand 612 states and 962 transitions. Second operand 4 states. [2019-09-08 03:42:42,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:42:42,621 INFO L93 Difference]: Finished difference Result 1191 states and 1887 transitions. [2019-09-08 03:42:42,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:42:42,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-09-08 03:42:42,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:42:42,631 INFO L225 Difference]: With dead ends: 1191 [2019-09-08 03:42:42,632 INFO L226 Difference]: Without dead ends: 612 [2019-09-08 03:42:42,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:42:42,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-09-08 03:42:42,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-09-08 03:42:42,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-09-08 03:42:42,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 961 transitions. [2019-09-08 03:42:42,738 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 961 transitions. Word has length 90 [2019-09-08 03:42:42,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:42:42,738 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 961 transitions. [2019-09-08 03:42:42,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:42:42,739 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 961 transitions. [2019-09-08 03:42:42,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 03:42:42,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:42:42,740 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:42:42,741 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:42:42,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:42:42,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1501218543, now seen corresponding path program 1 times [2019-09-08 03:42:42,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:42:42,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:42:42,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:42,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:42,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:42,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:42:42,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:42:42,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:42:42,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:42:42,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:42:42,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:42:42,871 INFO L87 Difference]: Start difference. First operand 612 states and 961 transitions. Second operand 4 states. [2019-09-08 03:42:42,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:42:42,941 INFO L93 Difference]: Finished difference Result 1191 states and 1886 transitions. [2019-09-08 03:42:42,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:42:42,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-09-08 03:42:42,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:42:42,947 INFO L225 Difference]: With dead ends: 1191 [2019-09-08 03:42:42,947 INFO L226 Difference]: Without dead ends: 612 [2019-09-08 03:42:42,951 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:42:42,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-09-08 03:42:42,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-09-08 03:42:42,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-09-08 03:42:42,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 960 transitions. [2019-09-08 03:42:42,976 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 960 transitions. Word has length 91 [2019-09-08 03:42:42,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:42:42,976 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 960 transitions. [2019-09-08 03:42:42,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:42:42,976 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 960 transitions. [2019-09-08 03:42:42,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 03:42:42,978 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:42:42,978 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:42:42,978 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:42:42,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:42:42,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1777232349, now seen corresponding path program 1 times [2019-09-08 03:42:42,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:42:42,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:42:42,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:42,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:42,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:43,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:42:43,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:42:43,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 03:42:43,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 03:42:43,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 03:42:43,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:42:43,143 INFO L87 Difference]: Start difference. First operand 612 states and 960 transitions. Second operand 10 states. [2019-09-08 03:42:43,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:42:43,332 INFO L93 Difference]: Finished difference Result 1196 states and 1893 transitions. [2019-09-08 03:42:43,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:42:43,332 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-09-08 03:42:43,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:42:43,337 INFO L225 Difference]: With dead ends: 1196 [2019-09-08 03:42:43,337 INFO L226 Difference]: Without dead ends: 621 [2019-09-08 03:42:43,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:42:43,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-09-08 03:42:43,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 619. [2019-09-08 03:42:43,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2019-09-08 03:42:43,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 970 transitions. [2019-09-08 03:42:43,373 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 970 transitions. Word has length 92 [2019-09-08 03:42:43,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:42:43,374 INFO L475 AbstractCegarLoop]: Abstraction has 619 states and 970 transitions. [2019-09-08 03:42:43,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 03:42:43,374 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 970 transitions. [2019-09-08 03:42:43,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 03:42:43,376 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:42:43,376 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:42:43,376 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:42:43,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:42:43,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1878144316, now seen corresponding path program 1 times [2019-09-08 03:42:43,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:42:43,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:42:43,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:43,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:43,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:43,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:42:43,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:42:43,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:42:43,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:42:43,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:42:43,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:42:43,478 INFO L87 Difference]: Start difference. First operand 619 states and 970 transitions. Second operand 4 states. [2019-09-08 03:42:43,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:42:43,548 INFO L93 Difference]: Finished difference Result 1197 states and 1894 transitions. [2019-09-08 03:42:43,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:42:43,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-09-08 03:42:43,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:42:43,555 INFO L225 Difference]: With dead ends: 1197 [2019-09-08 03:42:43,555 INFO L226 Difference]: Without dead ends: 615 [2019-09-08 03:42:43,561 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:42:43,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-09-08 03:42:43,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2019-09-08 03:42:43,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-09-08 03:42:43,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 963 transitions. [2019-09-08 03:42:43,590 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 963 transitions. Word has length 92 [2019-09-08 03:42:43,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:42:43,591 INFO L475 AbstractCegarLoop]: Abstraction has 615 states and 963 transitions. [2019-09-08 03:42:43,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:42:43,591 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 963 transitions. [2019-09-08 03:42:43,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 03:42:43,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:42:43,595 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:42:43,595 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:42:43,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:42:43,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1995337811, now seen corresponding path program 1 times [2019-09-08 03:42:43,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:42:43,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:42:43,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:43,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:43,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:43,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:42:43,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:42:43,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:42:43,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:42:43,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:42:43,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:42:43,749 INFO L87 Difference]: Start difference. First operand 615 states and 963 transitions. Second operand 6 states. [2019-09-08 03:42:44,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:42:44,107 INFO L93 Difference]: Finished difference Result 1210 states and 1918 transitions. [2019-09-08 03:42:44,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:42:44,107 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-09-08 03:42:44,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:42:44,112 INFO L225 Difference]: With dead ends: 1210 [2019-09-08 03:42:44,113 INFO L226 Difference]: Without dead ends: 623 [2019-09-08 03:42:44,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:42:44,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-09-08 03:42:44,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 620. [2019-09-08 03:42:44,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-08 03:42:44,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 964 transitions. [2019-09-08 03:42:44,139 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 964 transitions. Word has length 93 [2019-09-08 03:42:44,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:42:44,140 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 964 transitions. [2019-09-08 03:42:44,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:42:44,140 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 964 transitions. [2019-09-08 03:42:44,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 03:42:44,142 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:42:44,142 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:42:44,142 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:42:44,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:42:44,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1824175936, now seen corresponding path program 1 times [2019-09-08 03:42:44,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:42:44,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:42:44,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:44,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:44,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:44,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:42:44,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:42:44,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:42:44,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:42:44,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:42:44,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:42:44,258 INFO L87 Difference]: Start difference. First operand 620 states and 964 transitions. Second operand 6 states. [2019-09-08 03:42:44,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:42:44,475 INFO L93 Difference]: Finished difference Result 1173 states and 1833 transitions. [2019-09-08 03:42:44,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:42:44,476 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-09-08 03:42:44,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:42:44,480 INFO L225 Difference]: With dead ends: 1173 [2019-09-08 03:42:44,481 INFO L226 Difference]: Without dead ends: 620 [2019-09-08 03:42:44,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:42:44,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-08 03:42:44,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-09-08 03:42:44,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-08 03:42:44,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 960 transitions. [2019-09-08 03:42:44,506 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 960 transitions. Word has length 94 [2019-09-08 03:42:44,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:42:44,507 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 960 transitions. [2019-09-08 03:42:44,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:42:44,507 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 960 transitions. [2019-09-08 03:42:44,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 03:42:44,508 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:42:44,509 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:42:44,509 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:42:44,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:42:44,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1850857070, now seen corresponding path program 1 times [2019-09-08 03:42:44,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:42:44,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:42:44,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:44,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:44,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:44,622 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:42:44,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:42:44,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:42:44,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:42:44,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:42:44,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:42:44,624 INFO L87 Difference]: Start difference. First operand 620 states and 960 transitions. Second operand 6 states. [2019-09-08 03:42:44,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:42:44,832 INFO L93 Difference]: Finished difference Result 1173 states and 1829 transitions. [2019-09-08 03:42:44,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:42:44,832 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-09-08 03:42:44,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:42:44,837 INFO L225 Difference]: With dead ends: 1173 [2019-09-08 03:42:44,838 INFO L226 Difference]: Without dead ends: 620 [2019-09-08 03:42:44,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:42:44,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-08 03:42:44,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-09-08 03:42:44,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-08 03:42:44,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 956 transitions. [2019-09-08 03:42:44,876 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 956 transitions. Word has length 95 [2019-09-08 03:42:44,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:42:44,876 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 956 transitions. [2019-09-08 03:42:44,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:42:44,876 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 956 transitions. [2019-09-08 03:42:44,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 03:42:44,878 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:42:44,878 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:42:44,878 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:42:44,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:42:44,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1548805650, now seen corresponding path program 1 times [2019-09-08 03:42:44,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:42:44,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:42:44,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:44,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:44,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:45,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:42:45,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:42:45,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:42:45,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:42:45,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:42:45,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:42:45,038 INFO L87 Difference]: Start difference. First operand 620 states and 956 transitions. Second operand 7 states. [2019-09-08 03:42:45,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:42:45,138 INFO L93 Difference]: Finished difference Result 1176 states and 1829 transitions. [2019-09-08 03:42:45,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:42:45,139 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-09-08 03:42:45,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:42:45,144 INFO L225 Difference]: With dead ends: 1176 [2019-09-08 03:42:45,144 INFO L226 Difference]: Without dead ends: 602 [2019-09-08 03:42:45,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:42:45,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-09-08 03:42:45,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 599. [2019-09-08 03:42:45,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-09-08 03:42:45,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 919 transitions. [2019-09-08 03:42:45,169 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 919 transitions. Word has length 95 [2019-09-08 03:42:45,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:42:45,171 INFO L475 AbstractCegarLoop]: Abstraction has 599 states and 919 transitions. [2019-09-08 03:42:45,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:42:45,171 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 919 transitions. [2019-09-08 03:42:45,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 03:42:45,173 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:42:45,173 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:42:45,173 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:42:45,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:42:45,174 INFO L82 PathProgramCache]: Analyzing trace with hash 579263109, now seen corresponding path program 1 times [2019-09-08 03:42:45,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:42:45,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:42:45,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:45,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:45,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:45,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:42:45,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:42:45,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:42:45,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:42:45,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:42:45,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:42:45,286 INFO L87 Difference]: Start difference. First operand 599 states and 919 transitions. Second operand 6 states. [2019-09-08 03:42:45,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:42:45,414 INFO L93 Difference]: Finished difference Result 1152 states and 1788 transitions. [2019-09-08 03:42:45,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:42:45,415 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-09-08 03:42:45,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:42:45,419 INFO L225 Difference]: With dead ends: 1152 [2019-09-08 03:42:45,419 INFO L226 Difference]: Without dead ends: 599 [2019-09-08 03:42:45,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:42:45,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-09-08 03:42:45,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-09-08 03:42:45,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-09-08 03:42:45,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 918 transitions. [2019-09-08 03:42:45,443 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 918 transitions. Word has length 96 [2019-09-08 03:42:45,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:42:45,443 INFO L475 AbstractCegarLoop]: Abstraction has 599 states and 918 transitions. [2019-09-08 03:42:45,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:42:45,444 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 918 transitions. [2019-09-08 03:42:45,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 03:42:45,445 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:42:45,445 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:42:45,445 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:42:45,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:42:45,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1860812663, now seen corresponding path program 1 times [2019-09-08 03:42:45,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:42:45,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:42:45,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:45,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:45,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:45,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:42:45,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:42:45,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:42:45,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:42:45,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:42:45,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:42:45,548 INFO L87 Difference]: Start difference. First operand 599 states and 918 transitions. Second operand 6 states. [2019-09-08 03:42:45,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:42:45,683 INFO L93 Difference]: Finished difference Result 1152 states and 1787 transitions. [2019-09-08 03:42:45,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:42:45,684 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-09-08 03:42:45,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:42:45,692 INFO L225 Difference]: With dead ends: 1152 [2019-09-08 03:42:45,692 INFO L226 Difference]: Without dead ends: 599 [2019-09-08 03:42:45,696 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:42:45,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-09-08 03:42:45,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-09-08 03:42:45,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-09-08 03:42:45,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 917 transitions. [2019-09-08 03:42:45,725 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 917 transitions. Word has length 97 [2019-09-08 03:42:45,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:42:45,726 INFO L475 AbstractCegarLoop]: Abstraction has 599 states and 917 transitions. [2019-09-08 03:42:45,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:42:45,726 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 917 transitions. [2019-09-08 03:42:45,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 03:42:45,727 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:42:45,728 INFO L399 BasicCegarLoop]: trace histogram [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-08 03:42:45,728 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:42:45,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:42:45,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1896411210, now seen corresponding path program 1 times [2019-09-08 03:42:45,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:42:45,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:42:45,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:45,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:45,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:45,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:45,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:42:45,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:42:45,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 03:42:45,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 03:42:45,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 03:42:45,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:42:45,961 INFO L87 Difference]: Start difference. First operand 599 states and 917 transitions. Second operand 12 states. [2019-09-08 03:42:46,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:42:46,347 INFO L93 Difference]: Finished difference Result 1158 states and 1797 transitions. [2019-09-08 03:42:46,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 03:42:46,348 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-09-08 03:42:46,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:42:46,353 INFO L225 Difference]: With dead ends: 1158 [2019-09-08 03:42:46,353 INFO L226 Difference]: Without dead ends: 606 [2019-09-08 03:42:46,358 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:42:46,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-09-08 03:42:46,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 604. [2019-09-08 03:42:46,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-09-08 03:42:46,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 923 transitions. [2019-09-08 03:42:46,410 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 923 transitions. Word has length 98 [2019-09-08 03:42:46,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:42:46,413 INFO L475 AbstractCegarLoop]: Abstraction has 604 states and 923 transitions. [2019-09-08 03:42:46,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 03:42:46,414 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 923 transitions. [2019-09-08 03:42:46,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 03:42:46,416 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:42:46,416 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 03:42:46,417 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:42:46,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:42:46,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1663995072, now seen corresponding path program 1 times [2019-09-08 03:42:46,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:42:46,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:42:46,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:46,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:46,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:46,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:42:46,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:42:46,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 03:42:46,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 03:42:46,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 03:42:46,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 03:42:46,619 INFO L87 Difference]: Start difference. First operand 604 states and 923 transitions. Second operand 3 states. [2019-09-08 03:42:46,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:42:46,766 INFO L93 Difference]: Finished difference Result 1688 states and 2646 transitions. [2019-09-08 03:42:46,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 03:42:46,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-08 03:42:46,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:42:46,776 INFO L225 Difference]: With dead ends: 1688 [2019-09-08 03:42:46,776 INFO L226 Difference]: Without dead ends: 1137 [2019-09-08 03:42:46,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-08 03:42:46,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2019-09-08 03:42:46,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 1065. [2019-09-08 03:42:46,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1065 states. [2019-09-08 03:42:46,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1661 transitions. [2019-09-08 03:42:46,839 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1661 transitions. Word has length 99 [2019-09-08 03:42:46,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:42:46,840 INFO L475 AbstractCegarLoop]: Abstraction has 1065 states and 1661 transitions. [2019-09-08 03:42:46,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 03:42:46,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1661 transitions. [2019-09-08 03:42:46,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-08 03:42:46,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:42:46,845 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 03:42:46,846 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:42:46,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:42:46,846 INFO L82 PathProgramCache]: Analyzing trace with hash 2131650664, now seen corresponding path program 1 times [2019-09-08 03:42:46,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:42:46,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:42:46,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:46,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:46,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:47,077 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-08 03:42:47,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:42:47,080 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) [2019-09-08 03:42:47,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:42:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:47,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 2893 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 03:42:47,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:42:48,059 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:42:48,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:42:48,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2019-09-08 03:42:48,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 03:42:48,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 03:42:48,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:42:48,079 INFO L87 Difference]: Start difference. First operand 1065 states and 1661 transitions. Second operand 14 states. [2019-09-08 03:42:49,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:42:49,591 INFO L93 Difference]: Finished difference Result 2443 states and 3798 transitions. [2019-09-08 03:42:49,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 03:42:49,592 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 157 [2019-09-08 03:42:49,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:42:49,603 INFO L225 Difference]: With dead ends: 2443 [2019-09-08 03:42:49,603 INFO L226 Difference]: Without dead ends: 1431 [2019-09-08 03:42:49,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2019-09-08 03:42:49,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2019-09-08 03:42:49,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1416. [2019-09-08 03:42:49,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1416 states. [2019-09-08 03:42:49,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2143 transitions. [2019-09-08 03:42:49,675 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2143 transitions. Word has length 157 [2019-09-08 03:42:49,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:42:49,676 INFO L475 AbstractCegarLoop]: Abstraction has 1416 states and 2143 transitions. [2019-09-08 03:42:49,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 03:42:49,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2143 transitions. [2019-09-08 03:42:49,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-08 03:42:49,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:42:49,681 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 03:42:49,681 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:42:49,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:42:49,682 INFO L82 PathProgramCache]: Analyzing trace with hash 379361305, now seen corresponding path program 1 times [2019-09-08 03:42:49,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:42:49,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:42:49,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:49,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:49,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:49,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:49,945 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-08 03:42:49,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:42:49,946 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-08 03:42:49,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:50,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:50,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 2893 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:42:50,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:42:50,587 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 03:42:50,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:42:50,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-09-08 03:42:50,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 03:42:50,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 03:42:50,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:42:50,599 INFO L87 Difference]: Start difference. First operand 1416 states and 2143 transitions. Second operand 14 states. [2019-09-08 03:43:02,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:02,883 INFO L93 Difference]: Finished difference Result 4234 states and 6780 transitions. [2019-09-08 03:43:02,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 03:43:02,884 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 158 [2019-09-08 03:43:02,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:02,907 INFO L225 Difference]: With dead ends: 4234 [2019-09-08 03:43:02,907 INFO L226 Difference]: Without dead ends: 2871 [2019-09-08 03:43:02,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=181, Invalid=811, Unknown=0, NotChecked=0, Total=992 [2019-09-08 03:43:02,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2871 states. [2019-09-08 03:43:03,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2871 to 2814. [2019-09-08 03:43:03,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2814 states. [2019-09-08 03:43:03,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2814 states to 2814 states and 4365 transitions. [2019-09-08 03:43:03,065 INFO L78 Accepts]: Start accepts. Automaton has 2814 states and 4365 transitions. Word has length 158 [2019-09-08 03:43:03,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:03,066 INFO L475 AbstractCegarLoop]: Abstraction has 2814 states and 4365 transitions. [2019-09-08 03:43:03,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 03:43:03,066 INFO L276 IsEmpty]: Start isEmpty. Operand 2814 states and 4365 transitions. [2019-09-08 03:43:03,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 03:43:03,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:03,072 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 03:43:03,072 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:03,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:03,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1567326197, now seen corresponding path program 1 times [2019-09-08 03:43:03,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:03,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:03,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:03,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:03,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:03,231 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 03:43:03,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:43:03,232 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) [2019-09-08 03:43:03,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:43:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:03,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 2896 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:43:03,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:43:03,836 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Stream closed [2019-09-08 03:43:03,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:43:03,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-08 03:43:03,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:43:03,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:43:03,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:43:03,857 INFO L87 Difference]: Start difference. First operand 2814 states and 4365 transitions. Second operand 9 states. [2019-09-08 03:43:05,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:05,378 INFO L93 Difference]: Finished difference Result 5623 states and 9015 transitions. [2019-09-08 03:43:05,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:43:05,379 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 161 [2019-09-08 03:43:05,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:05,406 INFO L225 Difference]: With dead ends: 5623 [2019-09-08 03:43:05,406 INFO L226 Difference]: Without dead ends: 2846 [2019-09-08 03:43:05,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 160 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:43:05,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2846 states. [2019-09-08 03:43:05,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2846 to 2846. [2019-09-08 03:43:05,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2846 states. [2019-09-08 03:43:05,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2846 states to 2846 states and 4353 transitions. [2019-09-08 03:43:05,568 INFO L78 Accepts]: Start accepts. Automaton has 2846 states and 4353 transitions. Word has length 161 [2019-09-08 03:43:05,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:05,569 INFO L475 AbstractCegarLoop]: Abstraction has 2846 states and 4353 transitions. [2019-09-08 03:43:05,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:43:05,569 INFO L276 IsEmpty]: Start isEmpty. Operand 2846 states and 4353 transitions. [2019-09-08 03:43:05,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 03:43:05,575 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:05,575 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 03:43:05,576 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:05,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:05,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1359183901, now seen corresponding path program 1 times [2019-09-08 03:43:05,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:05,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:05,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:05,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:05,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:05,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:05,757 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 03:43:05,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:43:05,758 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-08 03:43:05,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:06,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:06,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 2899 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:43:06,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:43:06,352 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 03:43:06,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:43:06,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-09-08 03:43:06,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 03:43:06,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 03:43:06,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:43:06,371 INFO L87 Difference]: Start difference. First operand 2846 states and 4353 transitions. Second operand 14 states. [2019-09-08 03:43:18,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:18,174 INFO L93 Difference]: Finished difference Result 9042 states and 14481 transitions. [2019-09-08 03:43:18,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 03:43:18,175 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 164 [2019-09-08 03:43:18,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:18,230 INFO L225 Difference]: With dead ends: 9042 [2019-09-08 03:43:18,230 INFO L226 Difference]: Without dead ends: 6249 [2019-09-08 03:43:18,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 180 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 03:43:18,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6249 states. [2019-09-08 03:43:18,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6249 to 6086. [2019-09-08 03:43:18,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6086 states. [2019-09-08 03:43:18,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6086 states to 6086 states and 9440 transitions. [2019-09-08 03:43:18,586 INFO L78 Accepts]: Start accepts. Automaton has 6086 states and 9440 transitions. Word has length 164 [2019-09-08 03:43:18,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:18,589 INFO L475 AbstractCegarLoop]: Abstraction has 6086 states and 9440 transitions. [2019-09-08 03:43:18,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 03:43:18,589 INFO L276 IsEmpty]: Start isEmpty. Operand 6086 states and 9440 transitions. [2019-09-08 03:43:18,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 03:43:18,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:18,603 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:43:18,603 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:18,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:18,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1506227760, now seen corresponding path program 1 times [2019-09-08 03:43:18,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:18,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:18,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:18,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:18,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:18,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:18,855 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 03:43:18,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:43:18,856 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) [2019-09-08 03:43:18,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:43:19,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:19,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 2902 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:43:19,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:43:19,343 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 03:43:19,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:43:19,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-09-08 03:43:19,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 03:43:19,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 03:43:19,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:43:19,361 INFO L87 Difference]: Start difference. First operand 6086 states and 9440 transitions. Second operand 14 states. [2019-09-08 03:43:31,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:31,623 INFO L93 Difference]: Finished difference Result 17485 states and 28115 transitions. [2019-09-08 03:43:31,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 03:43:31,623 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 168 [2019-09-08 03:43:31,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:31,717 INFO L225 Difference]: With dead ends: 17485 [2019-09-08 03:43:31,717 INFO L226 Difference]: Without dead ends: 11458 [2019-09-08 03:43:31,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 03:43:31,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11458 states. [2019-09-08 03:43:32,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11458 to 11133. [2019-09-08 03:43:32,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11133 states. [2019-09-08 03:43:32,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11133 states to 11133 states and 17353 transitions. [2019-09-08 03:43:32,363 INFO L78 Accepts]: Start accepts. Automaton has 11133 states and 17353 transitions. Word has length 168 [2019-09-08 03:43:32,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:32,365 INFO L475 AbstractCegarLoop]: Abstraction has 11133 states and 17353 transitions. [2019-09-08 03:43:32,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 03:43:32,365 INFO L276 IsEmpty]: Start isEmpty. Operand 11133 states and 17353 transitions. [2019-09-08 03:43:32,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 03:43:32,380 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:32,380 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 03:43:32,380 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:32,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:32,381 INFO L82 PathProgramCache]: Analyzing trace with hash 2093169185, now seen corresponding path program 1 times [2019-09-08 03:43:32,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:32,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:32,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:32,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:32,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:32,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:32,563 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-09-08 03:43:32,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:43:32,564 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-08 03:43:32,578 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-08 03:43:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:32,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 2905 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-08 03:43:32,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:43:33,098 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 03:43:33,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:43:33,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2019-09-08 03:43:33,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 03:43:33,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 03:43:33,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-09-08 03:43:33,117 INFO L87 Difference]: Start difference. First operand 11133 states and 17353 transitions. Second operand 16 states. [2019-09-08 03:43:35,814 WARN L188 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2019-09-08 03:44:09,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:44:09,523 INFO L93 Difference]: Finished difference Result 67117 states and 110165 transitions. [2019-09-08 03:44:09,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-09-08 03:44:09,523 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 170 [2019-09-08 03:44:09,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:44:09,972 INFO L225 Difference]: With dead ends: 67117 [2019-09-08 03:44:09,973 INFO L226 Difference]: Without dead ends: 56049 [2019-09-08 03:44:10,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 213 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3093 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=926, Invalid=8194, Unknown=0, NotChecked=0, Total=9120 [2019-09-08 03:44:10,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56049 states. [2019-09-08 03:44:12,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56049 to 51962. [2019-09-08 03:44:12,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51962 states. [2019-09-08 03:44:13,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51962 states to 51962 states and 82194 transitions. [2019-09-08 03:44:13,043 INFO L78 Accepts]: Start accepts. Automaton has 51962 states and 82194 transitions. Word has length 170 [2019-09-08 03:44:13,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:44:13,044 INFO L475 AbstractCegarLoop]: Abstraction has 51962 states and 82194 transitions. [2019-09-08 03:44:13,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 03:44:13,044 INFO L276 IsEmpty]: Start isEmpty. Operand 51962 states and 82194 transitions. [2019-09-08 03:44:13,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 03:44:13,067 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:44:13,068 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 03:44:13,068 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:44:13,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:44:13,068 INFO L82 PathProgramCache]: Analyzing trace with hash 21353482, now seen corresponding path program 1 times [2019-09-08 03:44:13,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:44:13,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:44:13,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:13,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:44:13,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:13,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:13,216 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-08 03:44:13,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:44:13,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:44:13,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:44:13,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:44:13,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:44:13,218 INFO L87 Difference]: Start difference. First operand 51962 states and 82194 transitions. Second operand 9 states. [2019-09-08 03:44:15,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:44:15,935 INFO L93 Difference]: Finished difference Result 73929 states and 116522 transitions. [2019-09-08 03:44:15,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:44:15,935 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 178 [2019-09-08 03:44:15,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:44:16,111 INFO L225 Difference]: With dead ends: 73929 [2019-09-08 03:44:16,111 INFO L226 Difference]: Without dead ends: 22014 [2019-09-08 03:44:16,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:44:16,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22014 states. [2019-09-08 03:44:17,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22014 to 21998. [2019-09-08 03:44:17,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21998 states. [2019-09-08 03:44:17,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21998 states to 21998 states and 34329 transitions. [2019-09-08 03:44:17,594 INFO L78 Accepts]: Start accepts. Automaton has 21998 states and 34329 transitions. Word has length 178 [2019-09-08 03:44:17,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:44:17,595 INFO L475 AbstractCegarLoop]: Abstraction has 21998 states and 34329 transitions. [2019-09-08 03:44:17,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:44:17,595 INFO L276 IsEmpty]: Start isEmpty. Operand 21998 states and 34329 transitions. [2019-09-08 03:44:17,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 03:44:17,601 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:44:17,602 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 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-08 03:44:17,602 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:44:17,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:44:17,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1402550459, now seen corresponding path program 1 times [2019-09-08 03:44:17,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:44:17,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:44:17,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:17,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:44:17,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:17,763 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-08 03:44:17,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:44:17,763 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:44:17,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:44:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:18,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 2941 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 03:44:18,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:44:18,199 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 03:44:18,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:44:18,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2019-09-08 03:44:18,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 03:44:18,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 03:44:18,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:44:18,211 INFO L87 Difference]: Start difference. First operand 21998 states and 34329 transitions. Second operand 10 states. [2019-09-08 03:44:23,989 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-09-08 03:44:32,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:44:32,117 INFO L93 Difference]: Finished difference Result 52259 states and 84498 transitions. [2019-09-08 03:44:32,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 03:44:32,118 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 181 [2019-09-08 03:44:32,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:44:32,302 INFO L225 Difference]: With dead ends: 52259 [2019-09-08 03:44:32,302 INFO L226 Difference]: Without dead ends: 30314 [2019-09-08 03:44:32,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=659, Unknown=0, NotChecked=0, Total=812 [2019-09-08 03:44:32,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30314 states. [2019-09-08 03:44:33,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30314 to 22160. [2019-09-08 03:44:33,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22160 states. [2019-09-08 03:44:33,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22160 states to 22160 states and 34529 transitions. [2019-09-08 03:44:33,459 INFO L78 Accepts]: Start accepts. Automaton has 22160 states and 34529 transitions. Word has length 181 [2019-09-08 03:44:33,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:44:33,460 INFO L475 AbstractCegarLoop]: Abstraction has 22160 states and 34529 transitions. [2019-09-08 03:44:33,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 03:44:33,460 INFO L276 IsEmpty]: Start isEmpty. Operand 22160 states and 34529 transitions. [2019-09-08 03:44:33,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-08 03:44:33,466 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:44:33,467 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 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-08 03:44:33,467 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:44:33,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:44:33,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1363910447, now seen corresponding path program 1 times [2019-09-08 03:44:33,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:44:33,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:44:33,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:33,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:44:33,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:33,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:33,623 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-09-08 03:44:33,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:44:33,623 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:44:33,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:44:34,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:34,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 2941 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 03:44:34,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:44:34,182 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 41 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 03:44:34,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:44:34,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-09-08 03:44:34,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 03:44:34,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 03:44:34,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:44:34,192 INFO L87 Difference]: Start difference. First operand 22160 states and 34529 transitions. Second operand 14 states. [2019-09-08 03:44:53,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:44:53,897 INFO L93 Difference]: Finished difference Result 122946 states and 206761 transitions. [2019-09-08 03:44:53,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-08 03:44:53,897 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 182 [2019-09-08 03:44:53,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:44:54,553 INFO L225 Difference]: With dead ends: 122946 [2019-09-08 03:44:54,553 INFO L226 Difference]: Without dead ends: 99059 [2019-09-08 03:44:54,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1344 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=734, Invalid=3172, Unknown=0, NotChecked=0, Total=3906 [2019-09-08 03:44:54,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99059 states. [2019-09-08 03:45:00,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99059 to 92106. [2019-09-08 03:45:00,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92106 states. [2019-09-08 03:45:00,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92106 states to 92106 states and 143209 transitions. [2019-09-08 03:45:00,934 INFO L78 Accepts]: Start accepts. Automaton has 92106 states and 143209 transitions. Word has length 182 [2019-09-08 03:45:00,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:00,935 INFO L475 AbstractCegarLoop]: Abstraction has 92106 states and 143209 transitions. [2019-09-08 03:45:00,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 03:45:00,935 INFO L276 IsEmpty]: Start isEmpty. Operand 92106 states and 143209 transitions. [2019-09-08 03:45:00,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-08 03:45:00,939 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:00,940 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 03:45:00,940 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:00,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:00,940 INFO L82 PathProgramCache]: Analyzing trace with hash 2015302721, now seen corresponding path program 1 times [2019-09-08 03:45:00,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:00,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:00,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:00,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:00,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:00,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:01,142 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-08 03:45:01,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:45:01,142 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:45:01,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:01,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 2962 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-08 03:45:01,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:45:01,614 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 03:45:01,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:45:01,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 12 [2019-09-08 03:45:01,621 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 03:45:01,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 03:45:01,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:45:01,622 INFO L87 Difference]: Start difference. First operand 92106 states and 143209 transitions. Second operand 12 states. [2019-09-08 03:45:17,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:17,012 INFO L93 Difference]: Finished difference Result 181337 states and 287596 transitions. [2019-09-08 03:45:17,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 03:45:17,013 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 188 [2019-09-08 03:45:17,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:17,548 INFO L225 Difference]: With dead ends: 181337 [2019-09-08 03:45:17,548 INFO L226 Difference]: Without dead ends: 93373 [2019-09-08 03:45:17,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2019-09-08 03:45:17,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93373 states. [2019-09-08 03:45:21,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93373 to 91800. [2019-09-08 03:45:21,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91800 states. [2019-09-08 03:45:21,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91800 states to 91800 states and 142743 transitions. [2019-09-08 03:45:21,713 INFO L78 Accepts]: Start accepts. Automaton has 91800 states and 142743 transitions. Word has length 188 [2019-09-08 03:45:21,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:21,713 INFO L475 AbstractCegarLoop]: Abstraction has 91800 states and 142743 transitions. [2019-09-08 03:45:21,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 03:45:21,713 INFO L276 IsEmpty]: Start isEmpty. Operand 91800 states and 142743 transitions. [2019-09-08 03:45:21,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-08 03:45:21,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:21,718 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 03:45:21,719 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:21,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:21,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1773309724, now seen corresponding path program 1 times [2019-09-08 03:45:21,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:21,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:21,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:21,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:21,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:21,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:21,931 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-09-08 03:45:21,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:45:21,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:45:21,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:45:21,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:45:21,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:45:21,933 INFO L87 Difference]: Start difference. First operand 91800 states and 142743 transitions. Second operand 9 states. [2019-09-08 03:45:33,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:33,856 INFO L93 Difference]: Finished difference Result 193711 states and 305656 transitions. [2019-09-08 03:45:33,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 03:45:33,856 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 190 [2019-09-08 03:45:33,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:34,893 INFO L225 Difference]: With dead ends: 193711 [2019-09-08 03:45:34,894 INFO L226 Difference]: Without dead ends: 106053 [2019-09-08 03:45:35,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2019-09-08 03:45:35,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106053 states. [2019-09-08 03:45:41,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106053 to 100793. [2019-09-08 03:45:41,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100793 states. [2019-09-08 03:45:42,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100793 states to 100793 states and 155229 transitions. [2019-09-08 03:45:42,077 INFO L78 Accepts]: Start accepts. Automaton has 100793 states and 155229 transitions. Word has length 190 [2019-09-08 03:45:42,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:42,078 INFO L475 AbstractCegarLoop]: Abstraction has 100793 states and 155229 transitions. [2019-09-08 03:45:42,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:45:42,078 INFO L276 IsEmpty]: Start isEmpty. Operand 100793 states and 155229 transitions. [2019-09-08 03:45:42,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 03:45:42,083 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:42,083 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 03:45:42,083 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:42,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:42,084 INFO L82 PathProgramCache]: Analyzing trace with hash 200581175, now seen corresponding path program 1 times [2019-09-08 03:45:42,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:42,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:42,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:42,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:42,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:42,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:42,280 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 03:45:42,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:45:42,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:45:42,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:45:42,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:45:42,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:45:42,282 INFO L87 Difference]: Start difference. First operand 100793 states and 155229 transitions. Second operand 7 states. [2019-09-08 03:45:50,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:50,038 INFO L93 Difference]: Finished difference Result 198994 states and 311139 transitions. [2019-09-08 03:45:50,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:45:50,039 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 195 [2019-09-08 03:45:50,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:50,649 INFO L225 Difference]: With dead ends: 198994 [2019-09-08 03:45:50,649 INFO L226 Difference]: Without dead ends: 102343 [2019-09-08 03:45:50,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:45:50,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102343 states. [2019-09-08 03:45:54,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102343 to 101629. [2019-09-08 03:45:54,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101629 states. [2019-09-08 03:45:54,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101629 states to 101629 states and 156551 transitions. [2019-09-08 03:45:54,647 INFO L78 Accepts]: Start accepts. Automaton has 101629 states and 156551 transitions. Word has length 195 [2019-09-08 03:45:54,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:54,648 INFO L475 AbstractCegarLoop]: Abstraction has 101629 states and 156551 transitions. [2019-09-08 03:45:54,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:45:54,648 INFO L276 IsEmpty]: Start isEmpty. Operand 101629 states and 156551 transitions. [2019-09-08 03:45:54,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-08 03:45:54,651 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:54,651 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 03:45:54,651 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:54,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:54,651 INFO L82 PathProgramCache]: Analyzing trace with hash -455051656, now seen corresponding path program 1 times [2019-09-08 03:45:54,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:54,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:54,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:54,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:54,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:54,794 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 03:45:54,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:45:54,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:45:54,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:45:54,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:45:54,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:45:54,796 INFO L87 Difference]: Start difference. First operand 101629 states and 156551 transitions. Second operand 9 states. [2019-09-08 03:46:02,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:46:02,628 INFO L93 Difference]: Finished difference Result 205156 states and 323349 transitions. [2019-09-08 03:46:02,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:46:02,628 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 202 [2019-09-08 03:46:02,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:46:03,109 INFO L225 Difference]: With dead ends: 205156 [2019-09-08 03:46:03,109 INFO L226 Difference]: Without dead ends: 101629 [2019-09-08 03:46:03,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:46:03,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101629 states. [2019-09-08 03:46:06,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101629 to 101629. [2019-09-08 03:46:06,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101629 states. [2019-09-08 03:46:07,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101629 states to 101629 states and 155581 transitions. [2019-09-08 03:46:07,166 INFO L78 Accepts]: Start accepts. Automaton has 101629 states and 155581 transitions. Word has length 202 [2019-09-08 03:46:07,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:46:07,166 INFO L475 AbstractCegarLoop]: Abstraction has 101629 states and 155581 transitions. [2019-09-08 03:46:07,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:46:07,166 INFO L276 IsEmpty]: Start isEmpty. Operand 101629 states and 155581 transitions. [2019-09-08 03:46:07,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-08 03:46:07,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:46:07,170 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 03:46:07,170 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:46:07,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:46:07,170 INFO L82 PathProgramCache]: Analyzing trace with hash -489206980, now seen corresponding path program 1 times [2019-09-08 03:46:07,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:46:07,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:46:07,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:07,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:07,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:07,323 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-09-08 03:46:07,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:46:07,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:46:07,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:46:07,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:46:07,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:46:07,325 INFO L87 Difference]: Start difference. First operand 101629 states and 155581 transitions. Second operand 9 states. [2019-09-08 03:46:17,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:46:17,283 INFO L93 Difference]: Finished difference Result 202707 states and 316164 transitions. [2019-09-08 03:46:17,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 03:46:17,283 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 207 [2019-09-08 03:46:17,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:46:17,411 INFO L225 Difference]: With dead ends: 202707 [2019-09-08 03:46:17,412 INFO L226 Difference]: Without dead ends: 28397 [2019-09-08 03:46:17,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2019-09-08 03:46:17,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28397 states. [2019-09-08 03:46:22,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28397 to 27773. [2019-09-08 03:46:22,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27773 states. [2019-09-08 03:46:22,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27773 states to 27773 states and 41580 transitions. [2019-09-08 03:46:22,898 INFO L78 Accepts]: Start accepts. Automaton has 27773 states and 41580 transitions. Word has length 207 [2019-09-08 03:46:22,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:46:22,898 INFO L475 AbstractCegarLoop]: Abstraction has 27773 states and 41580 transitions. [2019-09-08 03:46:22,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:46:22,899 INFO L276 IsEmpty]: Start isEmpty. Operand 27773 states and 41580 transitions. [2019-09-08 03:46:22,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2019-09-08 03:46:22,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:46:22,911 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:46:22,911 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:46:22,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:46:22,912 INFO L82 PathProgramCache]: Analyzing trace with hash 2143442151, now seen corresponding path program 1 times [2019-09-08 03:46:22,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:46:22,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:46:22,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:22,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:22,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:23,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1462 backedges. 29 proven. 40 refuted. 0 times theorem prover too weak. 1393 trivial. 0 not checked. [2019-09-08 03:46:23,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:46:23,213 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:46:23,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:24,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:24,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 6446 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:46:24,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:46:24,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1462 backedges. 401 proven. 0 refuted. 0 times theorem prover too weak. 1061 trivial. 0 not checked. [2019-09-08 03:46:24,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:46:24,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-09-08 03:46:24,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:46:24,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:46:24,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:46:24,459 INFO L87 Difference]: Start difference. First operand 27773 states and 41580 transitions. Second operand 9 states. [2019-09-08 03:46:25,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:46:25,616 INFO L93 Difference]: Finished difference Result 56400 states and 85805 transitions. [2019-09-08 03:46:25,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:46:25,617 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 602 [2019-09-08 03:46:25,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:46:25,744 INFO L225 Difference]: With dead ends: 56400 [2019-09-08 03:46:25,744 INFO L226 Difference]: Without dead ends: 29972 [2019-09-08 03:46:25,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 610 GetRequests, 602 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:46:25,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29972 states. [2019-09-08 03:46:26,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29972 to 29972. [2019-09-08 03:46:26,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29972 states. [2019-09-08 03:46:26,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29972 states to 29972 states and 45395 transitions. [2019-09-08 03:46:26,693 INFO L78 Accepts]: Start accepts. Automaton has 29972 states and 45395 transitions. Word has length 602 [2019-09-08 03:46:26,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:46:26,693 INFO L475 AbstractCegarLoop]: Abstraction has 29972 states and 45395 transitions. [2019-09-08 03:46:26,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:46:26,693 INFO L276 IsEmpty]: Start isEmpty. Operand 29972 states and 45395 transitions. [2019-09-08 03:46:26,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 618 [2019-09-08 03:46:26,709 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:46:26,709 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 15, 15, 10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 03:46:26,710 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:46:26,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:46:26,710 INFO L82 PathProgramCache]: Analyzing trace with hash 271682003, now seen corresponding path program 1 times [2019-09-08 03:46:26,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:46:26,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:46:26,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:26,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:26,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:26,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:27,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1567 backedges. 30 proven. 64 refuted. 0 times theorem prover too weak. 1473 trivial. 0 not checked. [2019-09-08 03:46:27,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:46:27,303 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:46:27,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:28,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:28,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 6458 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:46:28,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:46:28,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1567 backedges. 503 proven. 0 refuted. 0 times theorem prover too weak. 1064 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:46:28,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:46:28,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2019-09-08 03:46:28,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:46:28,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:46:28,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:46:28,508 INFO L87 Difference]: Start difference. First operand 29972 states and 45395 transitions. Second operand 11 states. [2019-09-08 03:46:39,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:46:39,741 INFO L93 Difference]: Finished difference Result 80646 states and 129344 transitions. [2019-09-08 03:46:39,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 03:46:39,743 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 617 [2019-09-08 03:46:39,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:46:39,942 INFO L225 Difference]: With dead ends: 80646 [2019-09-08 03:46:39,942 INFO L226 Difference]: Without dead ends: 50687 [2019-09-08 03:46:40,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 658 GetRequests, 633 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2019-09-08 03:46:40,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50687 states. [2019-09-08 03:46:41,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50687 to 48454. [2019-09-08 03:46:41,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48454 states. [2019-09-08 03:46:41,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48454 states to 48454 states and 74573 transitions. [2019-09-08 03:46:41,525 INFO L78 Accepts]: Start accepts. Automaton has 48454 states and 74573 transitions. Word has length 617 [2019-09-08 03:46:41,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:46:41,526 INFO L475 AbstractCegarLoop]: Abstraction has 48454 states and 74573 transitions. [2019-09-08 03:46:41,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:46:41,526 INFO L276 IsEmpty]: Start isEmpty. Operand 48454 states and 74573 transitions. [2019-09-08 03:46:41,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 666 [2019-09-08 03:46:41,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:46:41,541 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 18, 15, 12, 12, 10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 03:46:41,542 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:46:41,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:46:41,542 INFO L82 PathProgramCache]: Analyzing trace with hash 333617653, now seen corresponding path program 1 times [2019-09-08 03:46:41,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:46:41,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:46:41,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:41,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:41,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:41,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:42,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1644 backedges. 30 proven. 68 refuted. 0 times theorem prover too weak. 1546 trivial. 0 not checked. [2019-09-08 03:46:42,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:46:42,465 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:46:42,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:43,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:43,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 6655 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 03:46:43,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:46:43,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1644 backedges. 757 proven. 0 refuted. 0 times theorem prover too weak. 887 trivial. 0 not checked. [2019-09-08 03:46:43,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:46:43,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-09-08 03:46:43,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:46:43,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:46:43,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:46:43,586 INFO L87 Difference]: Start difference. First operand 48454 states and 74573 transitions. Second operand 9 states. [2019-09-08 03:46:57,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:46:57,469 INFO L93 Difference]: Finished difference Result 175679 states and 288841 transitions. [2019-09-08 03:46:57,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 03:46:57,469 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 665 [2019-09-08 03:46:57,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:46:58,096 INFO L225 Difference]: With dead ends: 175679 [2019-09-08 03:46:58,096 INFO L226 Difference]: Without dead ends: 126855 [2019-09-08 03:46:58,266 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 714 GetRequests, 686 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=627, Unknown=0, NotChecked=0, Total=812 [2019-09-08 03:46:58,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126855 states. [2019-09-08 03:47:03,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126855 to 123801. [2019-09-08 03:47:03,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123801 states. [2019-09-08 03:47:04,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123801 states to 123801 states and 198885 transitions. [2019-09-08 03:47:04,527 INFO L78 Accepts]: Start accepts. Automaton has 123801 states and 198885 transitions. Word has length 665 [2019-09-08 03:47:04,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:47:04,527 INFO L475 AbstractCegarLoop]: Abstraction has 123801 states and 198885 transitions. [2019-09-08 03:47:04,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:47:04,527 INFO L276 IsEmpty]: Start isEmpty. Operand 123801 states and 198885 transitions. [2019-09-08 03:47:04,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2019-09-08 03:47:04,572 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:47:04,572 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 12, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 03:47:04,573 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:47:04,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:47:04,573 INFO L82 PathProgramCache]: Analyzing trace with hash -522309143, now seen corresponding path program 1 times [2019-09-08 03:47:04,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:47:04,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:47:04,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:47:04,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:47:04,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:47:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:47:06,092 INFO L134 CoverageAnalysis]: Checked inductivity of 993 backedges. 45 proven. 12 refuted. 0 times theorem prover too weak. 936 trivial. 0 not checked. [2019-09-08 03:47:06,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:47:06,092 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:47:06,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:47:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:47:06,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 5918 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 03:47:06,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:47:07,128 INFO L134 CoverageAnalysis]: Checked inductivity of 993 backedges. 503 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2019-09-08 03:47:07,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:47:07,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2019-09-08 03:47:07,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:47:07,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:47:07,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:47:07,138 INFO L87 Difference]: Start difference. First operand 123801 states and 198885 transitions. Second operand 11 states. [2019-09-08 03:47:18,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:47:18,593 INFO L93 Difference]: Finished difference Result 266932 states and 438849 transitions. [2019-09-08 03:47:18,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 03:47:18,593 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 586 [2019-09-08 03:47:18,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:47:19,220 INFO L225 Difference]: With dead ends: 266932 [2019-09-08 03:47:19,220 INFO L226 Difference]: Without dead ends: 144908 [2019-09-08 03:47:19,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 588 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-09-08 03:47:19,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144908 states. [2019-09-08 03:47:30,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144908 to 139143. [2019-09-08 03:47:30,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139143 states. [2019-09-08 03:47:30,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139143 states to 139143 states and 223322 transitions. [2019-09-08 03:47:30,894 INFO L78 Accepts]: Start accepts. Automaton has 139143 states and 223322 transitions. Word has length 586 [2019-09-08 03:47:30,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:47:30,894 INFO L475 AbstractCegarLoop]: Abstraction has 139143 states and 223322 transitions. [2019-09-08 03:47:30,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:47:30,894 INFO L276 IsEmpty]: Start isEmpty. Operand 139143 states and 223322 transitions. [2019-09-08 03:47:30,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2019-09-08 03:47:30,972 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:47:30,973 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 12, 11, 11, 11, 9, 9, 9, 9, 9, 9, 6, 6, 6, 5, 5, 5, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 03:47:30,973 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:47:30,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:47:30,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1423502200, now seen corresponding path program 1 times [2019-09-08 03:47:30,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:47:30,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:47:30,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:47:30,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:47:30,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:47:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:47:31,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 88 proven. 66 refuted. 0 times theorem prover too weak. 949 trivial. 0 not checked. [2019-09-08 03:47:31,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:47:31,831 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:47:31,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:47:32,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:47:32,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 5937 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 03:47:32,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:47:32,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 554 proven. 168 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2019-09-08 03:47:32,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:47:32,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-09-08 03:47:32,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 03:47:32,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 03:47:32,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:47:32,912 INFO L87 Difference]: Start difference. First operand 139143 states and 223322 transitions. Second operand 10 states. [2019-09-08 03:47:50,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:47:50,303 INFO L93 Difference]: Finished difference Result 331378 states and 560231 transitions. [2019-09-08 03:47:50,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 03:47:50,304 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 594 [2019-09-08 03:47:50,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:47:51,907 INFO L225 Difference]: With dead ends: 331378 [2019-09-08 03:47:51,907 INFO L226 Difference]: Without dead ends: 191611 [2019-09-08 03:47:52,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 641 GetRequests, 607 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=238, Invalid=1022, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 03:47:52,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191611 states. [2019-09-08 03:48:09,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191611 to 185417. [2019-09-08 03:48:09,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185417 states. [2019-09-08 03:48:11,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185417 states to 185417 states and 301451 transitions. [2019-09-08 03:48:11,619 INFO L78 Accepts]: Start accepts. Automaton has 185417 states and 301451 transitions. Word has length 594 [2019-09-08 03:48:11,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:48:11,619 INFO L475 AbstractCegarLoop]: Abstraction has 185417 states and 301451 transitions. [2019-09-08 03:48:11,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 03:48:11,620 INFO L276 IsEmpty]: Start isEmpty. Operand 185417 states and 301451 transitions. [2019-09-08 03:48:11,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2019-09-08 03:48:11,701 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:48:11,702 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 03:48:11,702 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:48:11,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:48:11,702 INFO L82 PathProgramCache]: Analyzing trace with hash -32956331, now seen corresponding path program 1 times [2019-09-08 03:48:11,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:48:11,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:48:11,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:48:11,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:48:11,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:48:11,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:48:12,004 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 65 proven. 35 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2019-09-08 03:48:12,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:48:12,004 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:48:12,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:48:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:48:12,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 5440 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 03:48:12,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:48:13,121 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 343 proven. 77 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:48:13,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:48:13,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-09-08 03:48:13,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 03:48:13,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 03:48:13,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2019-09-08 03:48:13,142 INFO L87 Difference]: Start difference. First operand 185417 states and 301451 transitions. Second operand 22 states. [2019-09-08 03:49:08,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:49:08,260 INFO L93 Difference]: Finished difference Result 566080 states and 990725 transitions. [2019-09-08 03:49:08,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-08 03:49:08,261 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 482 [2019-09-08 03:49:08,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:49:11,258 INFO L225 Difference]: With dead ends: 566080 [2019-09-08 03:49:11,258 INFO L226 Difference]: Without dead ends: 371778 [2019-09-08 03:49:12,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 582 GetRequests, 502 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1791 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=717, Invalid=5925, Unknown=0, NotChecked=0, Total=6642 [2019-09-08 03:49:12,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371778 states. [2019-09-08 03:49:45,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371778 to 364185. [2019-09-08 03:49:45,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364185 states. [2019-09-08 03:49:49,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364185 states to 364185 states and 593419 transitions. [2019-09-08 03:49:49,143 INFO L78 Accepts]: Start accepts. Automaton has 364185 states and 593419 transitions. Word has length 482 [2019-09-08 03:49:49,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:49:49,144 INFO L475 AbstractCegarLoop]: Abstraction has 364185 states and 593419 transitions. [2019-09-08 03:49:49,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 03:49:49,144 INFO L276 IsEmpty]: Start isEmpty. Operand 364185 states and 593419 transitions. [2019-09-08 03:49:49,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 647 [2019-09-08 03:49:49,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:49:49,194 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 14, 11, 10, 10, 10, 10, 10, 10, 10, 10, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 03:49:49,194 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:49:49,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:49:49,194 INFO L82 PathProgramCache]: Analyzing trace with hash 720688333, now seen corresponding path program 1 times [2019-09-08 03:49:49,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:49:49,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:49:49,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:49,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:49:49,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:49,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:49,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1279 backedges. 51 proven. 69 refuted. 0 times theorem prover too weak. 1159 trivial. 0 not checked. [2019-09-08 03:49:49,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:49:49,553 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:49:49,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:49:50,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:50,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 6091 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 03:49:50,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:49:51,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1279 backedges. 535 proven. 173 refuted. 0 times theorem prover too weak. 571 trivial. 0 not checked. [2019-09-08 03:49:51,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:49:51,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2019-09-08 03:49:51,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 03:49:51,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 03:49:51,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2019-09-08 03:49:51,908 INFO L87 Difference]: Start difference. First operand 364185 states and 593419 transitions. Second operand 21 states. [2019-09-08 03:50:53,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:53,929 INFO L93 Difference]: Finished difference Result 932567 states and 1562521 transitions. [2019-09-08 03:50:53,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 03:50:53,929 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 646 [2019-09-08 03:50:53,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:57,151 INFO L225 Difference]: With dead ends: 932567 [2019-09-08 03:50:57,151 INFO L226 Difference]: Without dead ends: 588999 [2019-09-08 03:51:10,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 684 GetRequests, 653 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=174, Invalid=882, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 03:51:11,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588999 states. [2019-09-08 03:51:58,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588999 to 581751. [2019-09-08 03:51:58,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 581751 states. [2019-09-08 03:52:19,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581751 states to 581751 states and 974529 transitions. [2019-09-08 03:52:19,495 INFO L78 Accepts]: Start accepts. Automaton has 581751 states and 974529 transitions. Word has length 646 [2019-09-08 03:52:19,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:52:19,495 INFO L475 AbstractCegarLoop]: Abstraction has 581751 states and 974529 transitions. [2019-09-08 03:52:19,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 03:52:19,495 INFO L276 IsEmpty]: Start isEmpty. Operand 581751 states and 974529 transitions. [2019-09-08 03:52:19,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2019-09-08 03:52:19,556 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:52:19,557 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 12, 11, 11, 11, 9, 9, 9, 9, 9, 9, 6, 6, 6, 5, 5, 5, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 03:52:19,557 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:52:19,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:52:19,557 INFO L82 PathProgramCache]: Analyzing trace with hash 4356496, now seen corresponding path program 1 times [2019-09-08 03:52:19,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:52:19,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:52:19,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:19,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:52:19,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:19,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:52:19,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 88 proven. 67 refuted. 0 times theorem prover too weak. 949 trivial. 0 not checked. [2019-09-08 03:52:19,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:52:19,893 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:52:19,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:52:22,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:52:22,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 5939 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:52:22,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:52:22,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 662 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-09-08 03:52:22,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:52:22,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2019-09-08 03:52:22,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 03:52:22,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 03:52:22,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:52:22,960 INFO L87 Difference]: Start difference. First operand 581751 states and 974529 transitions. Second operand 10 states.