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_spec1_product01.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:57:25,090 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:57:25,092 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:57:25,103 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:57:25,104 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:57:25,105 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:57:25,106 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:57:25,108 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:57:25,110 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:57:25,110 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:57:25,111 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:57:25,112 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:57:25,113 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:57:25,114 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:57:25,115 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:57:25,116 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:57:25,116 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:57:25,117 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:57:25,119 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:57:25,121 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:57:25,123 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:57:25,124 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:57:25,125 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:57:25,125 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:57:25,128 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:57:25,128 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:57:25,128 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:57:25,129 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:57:25,129 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:57:25,130 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:57:25,131 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:57:25,131 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:57:25,132 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:57:25,133 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:57:25,134 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:57:25,134 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:57:25,135 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:57:25,135 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:57:25,135 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:57:25,136 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:57:25,136 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:57:25,137 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-10-02 11:57:25,151 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:57:25,151 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:57:25,153 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:57:25,153 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:57:25,153 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:57:25,153 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:57:25,153 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:57:25,154 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:57:25,154 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:57:25,154 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:57:25,154 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:57:25,154 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:57:25,155 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:57:25,155 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:57:25,155 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:57:25,155 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:57:25,155 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:57:25,156 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:57:25,156 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:57:25,156 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:57:25,158 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:57:25,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:57:25,158 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:57:25,159 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:57:25,159 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:57:25,159 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:57:25,159 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:57:25,159 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:57:25,160 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:57:25,209 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:57:25,224 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:57:25,229 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:57:25,231 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:57:25,231 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:57:25,232 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_product01.cil.c [2019-10-02 11:57:25,297 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1460bdde3/c4777a9db7dd477aace395cec8240c1d/FLAG737188079 [2019-10-02 11:57:25,964 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:57:25,966 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_product01.cil.c [2019-10-02 11:57:25,986 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1460bdde3/c4777a9db7dd477aace395cec8240c1d/FLAG737188079 [2019-10-02 11:57:26,180 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1460bdde3/c4777a9db7dd477aace395cec8240c1d [2019-10-02 11:57:26,189 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:57:26,191 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:57:26,191 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:57:26,192 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:57:26,194 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:57:26,195 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:57:26" (1/1) ... [2019-10-02 11:57:26,197 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14543c48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:57:26, skipping insertion in model container [2019-10-02 11:57:26,198 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:57:26" (1/1) ... [2019-10-02 11:57:26,205 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:57:26,296 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:57:26,936 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:57:26,953 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:57:27,094 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:57:27,160 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:57:27,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:57:27 WrapperNode [2019-10-02 11:57:27,160 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:57:27,161 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:57:27,161 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:57:27,161 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:57:27,172 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:57:27" (1/1) ... [2019-10-02 11:57:27,172 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:57:27" (1/1) ... [2019-10-02 11:57:27,203 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:57:27" (1/1) ... [2019-10-02 11:57:27,203 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:57:27" (1/1) ... [2019-10-02 11:57:27,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:57:27" (1/1) ... [2019-10-02 11:57:27,315 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:57:27" (1/1) ... [2019-10-02 11:57:27,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:57:27" (1/1) ... [2019-10-02 11:57:27,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:57:27,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:57:27,363 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:57:27,364 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:57:27,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:57:27" (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-10-02 11:57:27,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:57:27,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:57:27,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 11:57:27,451 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 11:57:27,452 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 11:57:27,453 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 11:57:27,453 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 11:57:27,453 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 11:57:27,454 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 11:57:27,454 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 11:57:27,455 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 11:57:27,455 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 11:57:27,456 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 11:57:27,456 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 11:57:27,457 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 11:57:27,458 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 11:57:27,460 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 11:57:27,460 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 11:57:27,461 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 11:57:27,461 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 11:57:27,461 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 11:57:27,461 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 11:57:27,461 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 11:57:27,461 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 11:57:27,462 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 11:57:27,462 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 11:57:27,462 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 11:57:27,462 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 11:57:27,462 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 11:57:27,462 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 11:57:27,463 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 11:57:27,463 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 11:57:27,463 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 11:57:27,463 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 11:57:27,464 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 11:57:27,464 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 11:57:27,464 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 11:57:27,464 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 11:57:27,464 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 11:57:27,464 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 11:57:27,465 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 11:57:27,465 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 11:57:27,465 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 11:57:27,465 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:57:27,465 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 11:57:27,466 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 11:57:27,466 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 11:57:27,466 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 11:57:27,467 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 11:57:27,467 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 11:57:27,467 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 11:57:27,468 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 11:57:27,468 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 11:57:27,468 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 11:57:27,469 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 11:57:27,469 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 11:57:27,469 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 11:57:27,469 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 11:57:27,469 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 11:57:27,469 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 11:57:27,470 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 11:57:27,470 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 11:57:27,470 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 11:57:27,470 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 11:57:27,470 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 11:57:27,471 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 11:57:27,471 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 11:57:27,471 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 11:57:27,472 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__1 [2019-10-02 11:57:27,472 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__2 [2019-10-02 11:57:27,472 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__3 [2019-10-02 11:57:27,472 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__4 [2019-10-02 11:57:27,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:57:27,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 11:57:27,473 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 11:57:27,473 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 11:57:27,474 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 11:57:27,474 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 11:57:27,474 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 11:57:27,474 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 11:57:27,474 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 11:57:27,475 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 11:57:27,475 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 11:57:27,475 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 11:57:27,476 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 11:57:27,476 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 11:57:27,476 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 11:57:27,477 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 11:57:27,477 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 11:57:27,477 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 11:57:27,478 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 11:57:27,478 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 11:57:27,478 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 11:57:27,478 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 11:57:27,478 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 11:57:27,479 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 11:57:27,479 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 11:57:27,479 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 11:57:27,479 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 11:57:27,479 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 11:57:27,479 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 11:57:27,480 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 11:57:27,480 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 11:57:27,480 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 11:57:27,480 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 11:57:27,480 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__3 [2019-10-02 11:57:27,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 11:57:27,481 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 11:57:27,481 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 11:57:27,481 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 11:57:27,481 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 11:57:27,481 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 11:57:27,481 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 11:57:27,482 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 11:57:27,482 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 11:57:27,482 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 11:57:27,483 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 11:57:27,483 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 11:57:27,483 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 11:57:27,483 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 11:57:27,484 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 11:57:27,484 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 11:57:27,484 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 11:57:27,485 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 11:57:27,485 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 11:57:27,486 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 11:57:27,486 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__1 [2019-10-02 11:57:27,486 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__4 [2019-10-02 11:57:27,486 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 11:57:27,486 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 11:57:27,486 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 11:57:27,487 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 11:57:27,487 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 11:57:27,487 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:57:27,487 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 11:57:27,488 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__2 [2019-10-02 11:57:27,488 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 11:57:27,488 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 11:57:27,488 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 11:57:27,489 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 11:57:27,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 11:57:27,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 11:57:27,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 11:57:27,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 11:57:27,499 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 11:57:27,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 11:57:27,500 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 11:57:27,500 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 11:57:27,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 11:57:27,501 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 11:57:27,501 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 11:57:27,502 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 11:57:27,502 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 11:57:27,502 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 11:57:27,502 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 11:57:27,502 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 11:57:27,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:57:27,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 11:57:27,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:57:29,770 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:57:29,770 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 11:57:29,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:57:29 BoogieIcfgContainer [2019-10-02 11:57:29,772 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:57:29,773 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:57:29,773 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:57:29,776 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:57:29,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:57:26" (1/3) ... [2019-10-02 11:57:29,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58733814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:57:29, skipping insertion in model container [2019-10-02 11:57:29,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:57:27" (2/3) ... [2019-10-02 11:57:29,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58733814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:57:29, skipping insertion in model container [2019-10-02 11:57:29,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:57:29" (3/3) ... [2019-10-02 11:57:29,780 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product01.cil.c [2019-10-02 11:57:29,789 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:57:29,798 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:57:29,815 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:57:29,850 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:57:29,850 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:57:29,851 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:57:29,851 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:57:29,851 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:57:29,851 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:57:29,851 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:57:29,851 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:57:29,851 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:57:29,885 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states. [2019-10-02 11:57:29,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-02 11:57:29,914 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:29,916 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 11:57:29,918 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:29,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:29,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1026623827, now seen corresponding path program 1 times [2019-10-02 11:57:29,926 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:29,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:29,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:29,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:29,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:30,533 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 11:57:30,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:57:30,575 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:57:30,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:31,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 3175 conjuncts, 1 conjunts are in the unsatisfiable core [2019-10-02 11:57:31,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:57:31,340 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:57:31,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:57:31,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2019-10-02 11:57:31,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:57:31,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:57:31,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:57:31,378 INFO L87 Difference]: Start difference. First operand 722 states. Second operand 4 states. [2019-10-02 11:57:31,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:31,591 INFO L93 Difference]: Finished difference Result 1128 states and 1849 transitions. [2019-10-02 11:57:31,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:57:31,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-02 11:57:31,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:31,620 INFO L225 Difference]: With dead ends: 1128 [2019-10-02 11:57:31,621 INFO L226 Difference]: Without dead ends: 568 [2019-10-02 11:57:31,630 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 139 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-10-02 11:57:31,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-10-02 11:57:31,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2019-10-02 11:57:31,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-10-02 11:57:31,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 918 transitions. [2019-10-02 11:57:31,747 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 918 transitions. Word has length 138 [2019-10-02 11:57:31,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:31,748 INFO L475 AbstractCegarLoop]: Abstraction has 568 states and 918 transitions. [2019-10-02 11:57:31,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:57:31,748 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 918 transitions. [2019-10-02 11:57:31,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-02 11:57:31,762 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:31,762 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 11:57:31,763 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:31,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:31,763 INFO L82 PathProgramCache]: Analyzing trace with hash 983966334, now seen corresponding path program 1 times [2019-10-02 11:57:31,763 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:31,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:31,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:31,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:31,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:31,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:32,005 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 11:57:32,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:57:32,005 INFO L224 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-10-02 11:57:32,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:32,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:32,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 3180 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:57:32,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:57:32,688 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 11:57:32,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:57:32,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 11:57:32,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:57:32,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:57:32,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:57:32,710 INFO L87 Difference]: Start difference. First operand 568 states and 918 transitions. Second operand 6 states. [2019-10-02 11:57:32,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:32,969 INFO L93 Difference]: Finished difference Result 1108 states and 1809 transitions. [2019-10-02 11:57:32,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:57:32,970 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-10-02 11:57:32,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:32,982 INFO L225 Difference]: With dead ends: 1108 [2019-10-02 11:57:32,988 INFO L226 Difference]: Without dead ends: 568 [2019-10-02 11:57:32,992 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:57:32,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-10-02 11:57:33,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2019-10-02 11:57:33,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-10-02 11:57:33,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 917 transitions. [2019-10-02 11:57:33,054 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 917 transitions. Word has length 142 [2019-10-02 11:57:33,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:33,056 INFO L475 AbstractCegarLoop]: Abstraction has 568 states and 917 transitions. [2019-10-02 11:57:33,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:57:33,057 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 917 transitions. [2019-10-02 11:57:33,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-02 11:57:33,068 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:33,069 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 11:57:33,069 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:33,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:33,069 INFO L82 PathProgramCache]: Analyzing trace with hash 491565736, now seen corresponding path program 1 times [2019-10-02 11:57:33,069 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:33,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:33,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:33,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:33,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:33,241 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 11:57:33,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:57:33,241 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:57:33,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:33,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 3182 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:57:33,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:57:33,879 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:57:33,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:57:33,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 11:57:33,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:57:33,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:57:33,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:57:33,898 INFO L87 Difference]: Start difference. First operand 568 states and 917 transitions. Second operand 6 states. [2019-10-02 11:57:34,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:34,013 INFO L93 Difference]: Finished difference Result 1112 states and 1812 transitions. [2019-10-02 11:57:34,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:57:34,014 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-02 11:57:34,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:34,020 INFO L225 Difference]: With dead ends: 1112 [2019-10-02 11:57:34,021 INFO L226 Difference]: Without dead ends: 574 [2019-10-02 11:57:34,024 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:57:34,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-10-02 11:57:34,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-10-02 11:57:34,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-10-02 11:57:34,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 922 transitions. [2019-10-02 11:57:34,062 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 922 transitions. Word has length 144 [2019-10-02 11:57:34,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:34,063 INFO L475 AbstractCegarLoop]: Abstraction has 574 states and 922 transitions. [2019-10-02 11:57:34,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:57:34,063 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 922 transitions. [2019-10-02 11:57:34,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-02 11:57:34,068 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:34,068 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:57:34,069 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:34,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:34,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1278076607, now seen corresponding path program 1 times [2019-10-02 11:57:34,069 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:34,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:34,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:34,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:34,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:34,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:34,197 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 11:57:34,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:57:34,197 INFO L224 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-10-02 11:57:34,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:34,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:34,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 3183 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:57:34,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:57:34,837 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 11:57:34,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:57:34,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 11:57:34,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:57:34,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:57:34,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:57:34,854 INFO L87 Difference]: Start difference. First operand 574 states and 922 transitions. Second operand 6 states. [2019-10-02 11:57:34,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:34,955 INFO L93 Difference]: Finished difference Result 1111 states and 1803 transitions. [2019-10-02 11:57:34,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:57:34,955 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-10-02 11:57:34,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:34,961 INFO L225 Difference]: With dead ends: 1111 [2019-10-02 11:57:34,962 INFO L226 Difference]: Without dead ends: 574 [2019-10-02 11:57:34,966 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:57:34,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-10-02 11:57:34,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-10-02 11:57:34,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-10-02 11:57:34,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 921 transitions. [2019-10-02 11:57:34,998 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 921 transitions. Word has length 145 [2019-10-02 11:57:34,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:34,999 INFO L475 AbstractCegarLoop]: Abstraction has 574 states and 921 transitions. [2019-10-02 11:57:34,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:57:35,000 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 921 transitions. [2019-10-02 11:57:35,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-02 11:57:35,007 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:35,007 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 11:57:35,007 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:35,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:35,008 INFO L82 PathProgramCache]: Analyzing trace with hash 697827020, now seen corresponding path program 1 times [2019-10-02 11:57:35,008 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:35,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:35,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:35,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:35,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:35,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:35,179 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 11:57:35,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:57:35,179 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:57:35,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:35,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:35,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 3184 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:57:35,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:57:35,768 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 11:57:35,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:57:35,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 11:57:35,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:57:35,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:57:35,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:57:35,780 INFO L87 Difference]: Start difference. First operand 574 states and 921 transitions. Second operand 6 states. [2019-10-02 11:57:35,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:35,852 INFO L93 Difference]: Finished difference Result 1111 states and 1802 transitions. [2019-10-02 11:57:35,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:57:35,853 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 146 [2019-10-02 11:57:35,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:35,858 INFO L225 Difference]: With dead ends: 1111 [2019-10-02 11:57:35,859 INFO L226 Difference]: Without dead ends: 574 [2019-10-02 11:57:35,862 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:57:35,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-10-02 11:57:35,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-10-02 11:57:35,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-10-02 11:57:35,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 920 transitions. [2019-10-02 11:57:35,885 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 920 transitions. Word has length 146 [2019-10-02 11:57:35,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:35,886 INFO L475 AbstractCegarLoop]: Abstraction has 574 states and 920 transitions. [2019-10-02 11:57:35,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:57:35,886 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 920 transitions. [2019-10-02 11:57:35,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-02 11:57:35,890 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:35,890 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 11:57:35,890 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:35,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:35,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1473428571, now seen corresponding path program 1 times [2019-10-02 11:57:35,891 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:35,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:35,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:35,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:35,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:35,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:36,112 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 11:57:36,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:57:36,113 INFO L224 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:57:36,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:36,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 3185 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 11:57:36,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:57:36,756 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:57:36,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:57:36,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2019-10-02 11:57:36,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 11:57:36,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 11:57:36,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:57:36,766 INFO L87 Difference]: Start difference. First operand 574 states and 920 transitions. Second operand 15 states. [2019-10-02 11:57:37,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:37,036 INFO L93 Difference]: Finished difference Result 1116 states and 1809 transitions. [2019-10-02 11:57:37,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:57:37,036 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 147 [2019-10-02 11:57:37,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:37,041 INFO L225 Difference]: With dead ends: 1116 [2019-10-02 11:57:37,042 INFO L226 Difference]: Without dead ends: 583 [2019-10-02 11:57:37,045 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-10-02 11:57:37,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-02 11:57:37,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 581. [2019-10-02 11:57:37,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 581 states. [2019-10-02 11:57:37,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 930 transitions. [2019-10-02 11:57:37,072 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 930 transitions. Word has length 147 [2019-10-02 11:57:37,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:37,073 INFO L475 AbstractCegarLoop]: Abstraction has 581 states and 930 transitions. [2019-10-02 11:57:37,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 11:57:37,073 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 930 transitions. [2019-10-02 11:57:37,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-02 11:57:37,077 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:37,078 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 11:57:37,078 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:37,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:37,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1211131267, now seen corresponding path program 1 times [2019-10-02 11:57:37,078 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:37,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:37,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:37,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:37,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:37,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:37,266 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 11:57:37,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:57:37,267 INFO L224 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-10-02 11:57:37,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:37,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 3186 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:57:37,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:57:37,805 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:57:37,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:57:37,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 11:57:37,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:57:37,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:57:37,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:57:37,815 INFO L87 Difference]: Start difference. First operand 581 states and 930 transitions. Second operand 8 states. [2019-10-02 11:57:38,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:38,084 INFO L93 Difference]: Finished difference Result 1123 states and 1822 transitions. [2019-10-02 11:57:38,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:57:38,085 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 148 [2019-10-02 11:57:38,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:38,090 INFO L225 Difference]: With dead ends: 1123 [2019-10-02 11:57:38,090 INFO L226 Difference]: Without dead ends: 581 [2019-10-02 11:57:38,093 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:57:38,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2019-10-02 11:57:38,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 581. [2019-10-02 11:57:38,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 581 states. [2019-10-02 11:57:38,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 925 transitions. [2019-10-02 11:57:38,115 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 925 transitions. Word has length 148 [2019-10-02 11:57:38,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:38,116 INFO L475 AbstractCegarLoop]: Abstraction has 581 states and 925 transitions. [2019-10-02 11:57:38,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:57:38,116 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 925 transitions. [2019-10-02 11:57:38,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-02 11:57:38,120 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:38,120 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 11:57:38,121 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:38,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:38,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1933830183, now seen corresponding path program 1 times [2019-10-02 11:57:38,121 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:38,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:38,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:38,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:38,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:38,253 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 11:57:38,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:57:38,254 INFO L224 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-10-02 11:57:38,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:38,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:38,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 3188 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:57:38,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:57:38,843 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:57:38,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:57:38,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 11:57:38,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:57:38,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:57:38,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:57:38,853 INFO L87 Difference]: Start difference. First operand 581 states and 925 transitions. Second operand 8 states. [2019-10-02 11:57:39,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:39,118 INFO L93 Difference]: Finished difference Result 1123 states and 1812 transitions. [2019-10-02 11:57:39,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:57:39,119 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 150 [2019-10-02 11:57:39,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:39,124 INFO L225 Difference]: With dead ends: 1123 [2019-10-02 11:57:39,124 INFO L226 Difference]: Without dead ends: 581 [2019-10-02 11:57:39,127 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:57:39,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2019-10-02 11:57:39,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 581. [2019-10-02 11:57:39,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 581 states. [2019-10-02 11:57:39,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 920 transitions. [2019-10-02 11:57:39,157 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 920 transitions. Word has length 150 [2019-10-02 11:57:39,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:39,158 INFO L475 AbstractCegarLoop]: Abstraction has 581 states and 920 transitions. [2019-10-02 11:57:39,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:57:39,158 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 920 transitions. [2019-10-02 11:57:39,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-02 11:57:39,166 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:39,166 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 11:57:39,166 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:39,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:39,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1125851172, now seen corresponding path program 1 times [2019-10-02 11:57:39,167 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:39,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:39,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:39,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:39,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:39,312 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 11:57:39,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:57:39,313 INFO L224 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-10-02 11:57:39,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:39,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 3188 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:57:39,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:57:39,943 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:57:39,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:57:39,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 11:57:39,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:57:39,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:57:39,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:57:39,963 INFO L87 Difference]: Start difference. First operand 581 states and 920 transitions. Second operand 6 states. [2019-10-02 11:57:40,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:40,385 INFO L93 Difference]: Finished difference Result 1159 states and 1858 transitions. [2019-10-02 11:57:40,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:57:40,386 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 151 [2019-10-02 11:57:40,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:40,391 INFO L225 Difference]: With dead ends: 1159 [2019-10-02 11:57:40,391 INFO L226 Difference]: Without dead ends: 610 [2019-10-02 11:57:40,395 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 151 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-10-02 11:57:40,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-10-02 11:57:40,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 607. [2019-10-02 11:57:40,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-10-02 11:57:40,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 962 transitions. [2019-10-02 11:57:40,422 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 962 transitions. Word has length 151 [2019-10-02 11:57:40,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:40,422 INFO L475 AbstractCegarLoop]: Abstraction has 607 states and 962 transitions. [2019-10-02 11:57:40,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:57:40,422 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 962 transitions. [2019-10-02 11:57:40,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-02 11:57:40,427 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:40,427 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 11:57:40,428 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:40,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:40,428 INFO L82 PathProgramCache]: Analyzing trace with hash 98069497, now seen corresponding path program 1 times [2019-10-02 11:57:40,428 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:40,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:40,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:40,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:40,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:40,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:40,599 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 11:57:40,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:57:40,600 INFO L224 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-10-02 11:57:40,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:41,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 3186 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 11:57:41,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:57:41,292 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:57:41,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:57:41,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-10-02 11:57:41,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:57:41,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:57:41,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:57:41,303 INFO L87 Difference]: Start difference. First operand 607 states and 962 transitions. Second operand 14 states. [2019-10-02 11:57:41,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:41,623 INFO L93 Difference]: Finished difference Result 1160 states and 1860 transitions. [2019-10-02 11:57:41,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 11:57:41,624 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 152 [2019-10-02 11:57:41,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:41,630 INFO L225 Difference]: With dead ends: 1160 [2019-10-02 11:57:41,631 INFO L226 Difference]: Without dead ends: 601 [2019-10-02 11:57:41,634 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-10-02 11:57:41,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2019-10-02 11:57:41,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 596. [2019-10-02 11:57:41,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-02 11:57:41,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 942 transitions. [2019-10-02 11:57:41,672 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 942 transitions. Word has length 152 [2019-10-02 11:57:41,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:41,672 INFO L475 AbstractCegarLoop]: Abstraction has 596 states and 942 transitions. [2019-10-02 11:57:41,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:57:41,673 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 942 transitions. [2019-10-02 11:57:41,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-02 11:57:41,678 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:41,679 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 11:57:41,679 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:41,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:41,679 INFO L82 PathProgramCache]: Analyzing trace with hash 679493667, now seen corresponding path program 1 times [2019-10-02 11:57:41,680 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:41,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:41,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:41,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:41,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:41,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:41,847 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 11:57:41,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:57:41,848 INFO L224 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-10-02 11:57:41,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:42,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:42,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 3189 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:57:42,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:57:42,424 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:57:42,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:57:42,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 11:57:42,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:57:42,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:57:42,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:57:42,434 INFO L87 Difference]: Start difference. First operand 596 states and 942 transitions. Second operand 8 states. [2019-10-02 11:57:42,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:42,710 INFO L93 Difference]: Finished difference Result 1146 states and 1838 transitions. [2019-10-02 11:57:42,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:57:42,710 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 155 [2019-10-02 11:57:42,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:42,715 INFO L225 Difference]: With dead ends: 1146 [2019-10-02 11:57:42,715 INFO L226 Difference]: Without dead ends: 596 [2019-10-02 11:57:42,718 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:57:42,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-10-02 11:57:42,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2019-10-02 11:57:42,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-02 11:57:42,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 926 transitions. [2019-10-02 11:57:42,738 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 926 transitions. Word has length 155 [2019-10-02 11:57:42,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:42,739 INFO L475 AbstractCegarLoop]: Abstraction has 596 states and 926 transitions. [2019-10-02 11:57:42,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:57:42,739 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 926 transitions. [2019-10-02 11:57:42,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-02 11:57:42,743 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:42,743 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 11:57:42,744 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:42,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:42,744 INFO L82 PathProgramCache]: Analyzing trace with hash 825925279, now seen corresponding path program 1 times [2019-10-02 11:57:42,744 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:42,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:42,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:42,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:42,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:42,904 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 11:57:42,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:57:42,905 INFO L224 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-10-02 11:57:43,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:43,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 3190 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:57:43,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:57:43,535 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 11:57:43,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:57:43,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 11:57:43,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:57:43,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:57:43,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:57:43,553 INFO L87 Difference]: Start difference. First operand 596 states and 926 transitions. Second operand 8 states. [2019-10-02 11:57:43,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:43,822 INFO L93 Difference]: Finished difference Result 1142 states and 1798 transitions. [2019-10-02 11:57:43,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:57:43,823 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 156 [2019-10-02 11:57:43,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:43,830 INFO L225 Difference]: With dead ends: 1142 [2019-10-02 11:57:43,830 INFO L226 Difference]: Without dead ends: 596 [2019-10-02 11:57:43,834 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:57:43,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-10-02 11:57:43,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2019-10-02 11:57:43,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-02 11:57:43,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 925 transitions. [2019-10-02 11:57:43,860 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 925 transitions. Word has length 156 [2019-10-02 11:57:43,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:43,862 INFO L475 AbstractCegarLoop]: Abstraction has 596 states and 925 transitions. [2019-10-02 11:57:43,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:57:43,862 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 925 transitions. [2019-10-02 11:57:43,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-02 11:57:43,869 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:43,869 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 11:57:43,870 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:43,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:43,870 INFO L82 PathProgramCache]: Analyzing trace with hash 432391806, now seen corresponding path program 1 times [2019-10-02 11:57:43,871 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:43,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:43,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:43,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:43,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:44,222 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 11:57:44,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:57:44,223 INFO L224 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-10-02 11:57:44,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:44,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 3191 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 11:57:44,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:57:45,038 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 11:57:45,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:57:45,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2019-10-02 11:57:45,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 11:57:45,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 11:57:45,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-10-02 11:57:45,059 INFO L87 Difference]: Start difference. First operand 596 states and 925 transitions. Second operand 18 states. [2019-10-02 11:57:45,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:45,584 INFO L93 Difference]: Finished difference Result 1158 states and 1825 transitions. [2019-10-02 11:57:45,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 11:57:45,584 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 157 [2019-10-02 11:57:45,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:45,589 INFO L225 Difference]: With dead ends: 1158 [2019-10-02 11:57:45,589 INFO L226 Difference]: Without dead ends: 611 [2019-10-02 11:57:45,592 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-10-02 11:57:45,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-02 11:57:45,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 607. [2019-10-02 11:57:45,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-10-02 11:57:45,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 933 transitions. [2019-10-02 11:57:45,611 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 933 transitions. Word has length 157 [2019-10-02 11:57:45,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:45,611 INFO L475 AbstractCegarLoop]: Abstraction has 607 states and 933 transitions. [2019-10-02 11:57:45,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 11:57:45,612 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 933 transitions. [2019-10-02 11:57:45,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 11:57:45,615 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:45,615 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 11:57:45,616 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:45,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:45,616 INFO L82 PathProgramCache]: Analyzing trace with hash -841444963, now seen corresponding path program 1 times [2019-10-02 11:57:45,616 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:45,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:45,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:45,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:45,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:45,750 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 11:57:45,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:45,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:57:45,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:57:45,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:57:45,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:57:45,752 INFO L87 Difference]: Start difference. First operand 607 states and 933 transitions. Second operand 7 states. [2019-10-02 11:57:45,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:45,864 INFO L93 Difference]: Finished difference Result 1074 states and 1701 transitions. [2019-10-02 11:57:45,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:57:45,865 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 158 [2019-10-02 11:57:45,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:45,872 INFO L225 Difference]: With dead ends: 1074 [2019-10-02 11:57:45,872 INFO L226 Difference]: Without dead ends: 571 [2019-10-02 11:57:45,876 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-10-02 11:57:45,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-02 11:57:45,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 569. [2019-10-02 11:57:45,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-10-02 11:57:45,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 882 transitions. [2019-10-02 11:57:45,903 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 882 transitions. Word has length 158 [2019-10-02 11:57:45,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:45,904 INFO L475 AbstractCegarLoop]: Abstraction has 569 states and 882 transitions. [2019-10-02 11:57:45,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:57:45,904 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 882 transitions. [2019-10-02 11:57:45,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-02 11:57:45,910 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:45,910 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 11:57:45,911 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:45,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:45,911 INFO L82 PathProgramCache]: Analyzing trace with hash -2050945230, now seen corresponding path program 1 times [2019-10-02 11:57:45,912 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:45,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:45,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:45,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:45,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:46,217 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 11:57:46,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:46,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 11:57:46,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 11:57:46,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 11:57:46,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:57:46,219 INFO L87 Difference]: Start difference. First operand 569 states and 882 transitions. Second operand 13 states. [2019-10-02 11:57:46,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:46,647 INFO L93 Difference]: Finished difference Result 1105 states and 1740 transitions. [2019-10-02 11:57:46,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 11:57:46,647 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 160 [2019-10-02 11:57:46,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:46,652 INFO L225 Difference]: With dead ends: 1105 [2019-10-02 11:57:46,652 INFO L226 Difference]: Without dead ends: 583 [2019-10-02 11:57:46,655 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-10-02 11:57:46,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-02 11:57:46,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 581. [2019-10-02 11:57:46,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 581 states. [2019-10-02 11:57:46,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 897 transitions. [2019-10-02 11:57:46,675 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 897 transitions. Word has length 160 [2019-10-02 11:57:46,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:46,676 INFO L475 AbstractCegarLoop]: Abstraction has 581 states and 897 transitions. [2019-10-02 11:57:46,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 11:57:46,676 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 897 transitions. [2019-10-02 11:57:46,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 11:57:46,680 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:46,680 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 11:57:46,680 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:46,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:46,681 INFO L82 PathProgramCache]: Analyzing trace with hash -360388657, now seen corresponding path program 1 times [2019-10-02 11:57:46,681 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:46,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:46,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:46,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:46,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:46,946 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 11:57:46,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:46,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 11:57:46,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 11:57:46,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 11:57:46,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:57:46,949 INFO L87 Difference]: Start difference. First operand 581 states and 897 transitions. Second operand 13 states. [2019-10-02 11:57:47,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:47,262 INFO L93 Difference]: Finished difference Result 1049 states and 1663 transitions. [2019-10-02 11:57:47,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 11:57:47,263 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 159 [2019-10-02 11:57:47,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:47,267 INFO L225 Difference]: With dead ends: 1049 [2019-10-02 11:57:47,267 INFO L226 Difference]: Without dead ends: 574 [2019-10-02 11:57:47,271 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-10-02 11:57:47,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-10-02 11:57:47,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-10-02 11:57:47,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-10-02 11:57:47,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 888 transitions. [2019-10-02 11:57:47,289 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 888 transitions. Word has length 159 [2019-10-02 11:57:47,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:47,291 INFO L475 AbstractCegarLoop]: Abstraction has 574 states and 888 transitions. [2019-10-02 11:57:47,291 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 11:57:47,291 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 888 transitions. [2019-10-02 11:57:47,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-02 11:57:47,295 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:47,295 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 11:57:47,295 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:47,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:47,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1042000780, now seen corresponding path program 1 times [2019-10-02 11:57:47,296 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:47,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:47,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:47,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:47,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:47,564 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 11:57:47,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:47,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 11:57:47,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:57:47,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:57:47,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:57:47,573 INFO L87 Difference]: Start difference. First operand 574 states and 888 transitions. Second operand 11 states. [2019-10-02 11:57:47,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:47,798 INFO L93 Difference]: Finished difference Result 1042 states and 1654 transitions. [2019-10-02 11:57:47,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:57:47,798 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 161 [2019-10-02 11:57:47,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:47,802 INFO L225 Difference]: With dead ends: 1042 [2019-10-02 11:57:47,802 INFO L226 Difference]: Without dead ends: 574 [2019-10-02 11:57:47,805 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:57:47,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-10-02 11:57:47,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-10-02 11:57:47,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-10-02 11:57:47,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 887 transitions. [2019-10-02 11:57:47,822 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 887 transitions. Word has length 161 [2019-10-02 11:57:47,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:47,823 INFO L475 AbstractCegarLoop]: Abstraction has 574 states and 887 transitions. [2019-10-02 11:57:47,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:57:47,823 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 887 transitions. [2019-10-02 11:57:47,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-02 11:57:47,827 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:47,827 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 11:57:47,827 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:47,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:47,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1126708973, now seen corresponding path program 1 times [2019-10-02 11:57:47,828 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:47,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:47,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:47,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:47,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:48,039 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 11:57:48,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:48,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 11:57:48,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:57:48,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:57:48,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:57:48,041 INFO L87 Difference]: Start difference. First operand 574 states and 887 transitions. Second operand 11 states. [2019-10-02 11:57:48,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:48,277 INFO L93 Difference]: Finished difference Result 1091 states and 1711 transitions. [2019-10-02 11:57:48,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 11:57:48,277 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 162 [2019-10-02 11:57:48,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:48,282 INFO L225 Difference]: With dead ends: 1091 [2019-10-02 11:57:48,282 INFO L226 Difference]: Without dead ends: 571 [2019-10-02 11:57:48,285 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:57:48,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-02 11:57:48,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-10-02 11:57:48,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-02 11:57:48,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 879 transitions. [2019-10-02 11:57:48,301 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 879 transitions. Word has length 162 [2019-10-02 11:57:48,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:48,302 INFO L475 AbstractCegarLoop]: Abstraction has 571 states and 879 transitions. [2019-10-02 11:57:48,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:57:48,302 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 879 transitions. [2019-10-02 11:57:48,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-02 11:57:48,306 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:48,306 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 11:57:48,306 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:48,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:48,307 INFO L82 PathProgramCache]: Analyzing trace with hash -125398673, now seen corresponding path program 1 times [2019-10-02 11:57:48,307 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:48,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:48,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:48,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:48,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:48,516 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 11:57:48,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:48,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:57:48,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:57:48,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:57:48,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:57:48,518 INFO L87 Difference]: Start difference. First operand 571 states and 879 transitions. Second operand 9 states. [2019-10-02 11:57:51,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:51,902 INFO L93 Difference]: Finished difference Result 1036 states and 1660 transitions. [2019-10-02 11:57:51,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:57:51,903 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 163 [2019-10-02 11:57:51,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:51,907 INFO L225 Difference]: With dead ends: 1036 [2019-10-02 11:57:51,907 INFO L226 Difference]: Without dead ends: 577 [2019-10-02 11:57:51,909 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:57:51,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-10-02 11:57:51,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 575. [2019-10-02 11:57:51,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-10-02 11:57:51,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 898 transitions. [2019-10-02 11:57:51,941 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 898 transitions. Word has length 163 [2019-10-02 11:57:51,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:51,943 INFO L475 AbstractCegarLoop]: Abstraction has 575 states and 898 transitions. [2019-10-02 11:57:51,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:57:51,943 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 898 transitions. [2019-10-02 11:57:51,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-02 11:57:51,946 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:51,947 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 11:57:51,947 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:51,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:51,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1874100751, now seen corresponding path program 1 times [2019-10-02 11:57:51,947 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:51,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:51,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:51,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:51,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:51,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:52,111 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 11:57:52,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:52,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 11:57:52,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:57:52,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:57:52,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:57:52,115 INFO L87 Difference]: Start difference. First operand 575 states and 898 transitions. Second operand 8 states. [2019-10-02 11:57:57,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:57,325 INFO L93 Difference]: Finished difference Result 1888 states and 3131 transitions. [2019-10-02 11:57:57,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 11:57:57,326 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 164 [2019-10-02 11:57:57,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:57,340 INFO L225 Difference]: With dead ends: 1888 [2019-10-02 11:57:57,340 INFO L226 Difference]: Without dead ends: 1425 [2019-10-02 11:57:57,346 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-10-02 11:57:57,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2019-10-02 11:57:57,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 1386. [2019-10-02 11:57:57,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1386 states. [2019-10-02 11:57:57,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 2221 transitions. [2019-10-02 11:57:57,468 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 2221 transitions. Word has length 164 [2019-10-02 11:57:57,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:57,469 INFO L475 AbstractCegarLoop]: Abstraction has 1386 states and 2221 transitions. [2019-10-02 11:57:57,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:57:57,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 2221 transitions. [2019-10-02 11:57:57,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 11:57:57,475 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:57,475 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 11:57:57,476 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:57,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:57,476 INFO L82 PathProgramCache]: Analyzing trace with hash 569236907, now seen corresponding path program 1 times [2019-10-02 11:57:57,477 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:57,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:57,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:57,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:57,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:57,751 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 11:57:57,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:57:57,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:57:57,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:57:57,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:57:57,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:57:57,754 INFO L87 Difference]: Start difference. First operand 1386 states and 2221 transitions. Second operand 9 states. [2019-10-02 11:58:04,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:58:04,443 INFO L93 Difference]: Finished difference Result 4280 states and 7095 transitions. [2019-10-02 11:58:04,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 11:58:04,444 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 170 [2019-10-02 11:58:04,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:58:04,467 INFO L225 Difference]: With dead ends: 4280 [2019-10-02 11:58:04,467 INFO L226 Difference]: Without dead ends: 3006 [2019-10-02 11:58:04,475 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-10-02 11:58:04,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3006 states. [2019-10-02 11:58:04,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3006 to 2783. [2019-10-02 11:58:04,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2783 states. [2019-10-02 11:58:04,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2783 states to 2783 states and 4510 transitions. [2019-10-02 11:58:04,649 INFO L78 Accepts]: Start accepts. Automaton has 2783 states and 4510 transitions. Word has length 170 [2019-10-02 11:58:04,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:58:04,650 INFO L475 AbstractCegarLoop]: Abstraction has 2783 states and 4510 transitions. [2019-10-02 11:58:04,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:58:04,650 INFO L276 IsEmpty]: Start isEmpty. Operand 2783 states and 4510 transitions. [2019-10-02 11:58:04,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 11:58:04,653 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:58:04,654 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 11:58:04,654 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:58:04,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:58:04,655 INFO L82 PathProgramCache]: Analyzing trace with hash 561477548, now seen corresponding path program 1 times [2019-10-02 11:58:04,655 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:58:04,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:58:04,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:04,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:04,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:04,863 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 11:58:04,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:58:04,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:58:04,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:58:04,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:58:04,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:58:04,865 INFO L87 Difference]: Start difference. First operand 2783 states and 4510 transitions. Second operand 7 states. [2019-10-02 11:58:08,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:58:08,596 INFO L93 Difference]: Finished difference Result 7141 states and 11826 transitions. [2019-10-02 11:58:08,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:58:08,598 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 170 [2019-10-02 11:58:08,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:58:08,635 INFO L225 Difference]: With dead ends: 7141 [2019-10-02 11:58:08,635 INFO L226 Difference]: Without dead ends: 5161 [2019-10-02 11:58:08,648 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-10-02 11:58:08,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5161 states. [2019-10-02 11:58:08,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5161 to 5068. [2019-10-02 11:58:08,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5068 states. [2019-10-02 11:58:08,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5068 states to 5068 states and 8306 transitions. [2019-10-02 11:58:08,994 INFO L78 Accepts]: Start accepts. Automaton has 5068 states and 8306 transitions. Word has length 170 [2019-10-02 11:58:08,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:58:08,995 INFO L475 AbstractCegarLoop]: Abstraction has 5068 states and 8306 transitions. [2019-10-02 11:58:08,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:58:08,995 INFO L276 IsEmpty]: Start isEmpty. Operand 5068 states and 8306 transitions. [2019-10-02 11:58:08,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 11:58:08,999 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:58:09,001 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 11:58:09,002 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:58:09,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:58:09,002 INFO L82 PathProgramCache]: Analyzing trace with hash 560398415, now seen corresponding path program 1 times [2019-10-02 11:58:09,002 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:58:09,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:58:09,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:09,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:09,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:09,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:09,158 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 11:58:09,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:58:09,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:58:09,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:58:09,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:58:09,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:58:09,159 INFO L87 Difference]: Start difference. First operand 5068 states and 8306 transitions. Second operand 5 states. [2019-10-02 11:58:09,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:58:09,350 INFO L93 Difference]: Finished difference Result 9341 states and 15416 transitions. [2019-10-02 11:58:09,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:58:09,350 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2019-10-02 11:58:09,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:58:09,396 INFO L225 Difference]: With dead ends: 9341 [2019-10-02 11:58:09,396 INFO L226 Difference]: Without dead ends: 5186 [2019-10-02 11:58:09,419 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:58:09,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5186 states. [2019-10-02 11:58:09,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5186 to 5120. [2019-10-02 11:58:09,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5120 states. [2019-10-02 11:58:09,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5120 states to 5120 states and 8379 transitions. [2019-10-02 11:58:09,671 INFO L78 Accepts]: Start accepts. Automaton has 5120 states and 8379 transitions. Word has length 175 [2019-10-02 11:58:09,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:58:09,672 INFO L475 AbstractCegarLoop]: Abstraction has 5120 states and 8379 transitions. [2019-10-02 11:58:09,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:58:09,672 INFO L276 IsEmpty]: Start isEmpty. Operand 5120 states and 8379 transitions. [2019-10-02 11:58:09,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-02 11:58:09,678 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:58:09,678 INFO L411 BasicCegarLoop]: trace histogram [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-10-02 11:58:09,678 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:58:09,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:58:09,679 INFO L82 PathProgramCache]: Analyzing trace with hash -579591856, now seen corresponding path program 1 times [2019-10-02 11:58:09,679 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:58:09,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:58:09,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:09,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:09,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:09,820 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 11:58:09,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:58:09,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:58:09,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:58:09,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:58:09,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:58:09,821 INFO L87 Difference]: Start difference. First operand 5120 states and 8379 transitions. Second operand 7 states. [2019-10-02 11:58:10,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:58:10,086 INFO L93 Difference]: Finished difference Result 9917 states and 16532 transitions. [2019-10-02 11:58:10,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:58:10,087 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 182 [2019-10-02 11:58:10,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:58:10,119 INFO L225 Difference]: With dead ends: 9917 [2019-10-02 11:58:10,120 INFO L226 Difference]: Without dead ends: 5120 [2019-10-02 11:58:10,138 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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-10-02 11:58:10,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5120 states. [2019-10-02 11:58:10,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5120 to 5120. [2019-10-02 11:58:10,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5120 states. [2019-10-02 11:58:10,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5120 states to 5120 states and 8287 transitions. [2019-10-02 11:58:10,355 INFO L78 Accepts]: Start accepts. Automaton has 5120 states and 8287 transitions. Word has length 182 [2019-10-02 11:58:10,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:58:10,356 INFO L475 AbstractCegarLoop]: Abstraction has 5120 states and 8287 transitions. [2019-10-02 11:58:10,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:58:10,356 INFO L276 IsEmpty]: Start isEmpty. Operand 5120 states and 8287 transitions. [2019-10-02 11:58:10,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-02 11:58:10,362 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:58:10,362 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 11:58:10,363 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:58:10,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:58:10,363 INFO L82 PathProgramCache]: Analyzing trace with hash 397213162, now seen corresponding path program 1 times [2019-10-02 11:58:10,363 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:58:10,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:58:10,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:10,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:10,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:10,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:10,516 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 11:58:10,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:58:10,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:58:10,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:58:10,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:58:10,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:58:10,517 INFO L87 Difference]: Start difference. First operand 5120 states and 8287 transitions. Second operand 7 states. [2019-10-02 11:58:14,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:58:14,936 INFO L93 Difference]: Finished difference Result 9657 states and 15711 transitions. [2019-10-02 11:58:14,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 11:58:14,937 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 187 [2019-10-02 11:58:14,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:58:14,987 INFO L225 Difference]: With dead ends: 9657 [2019-10-02 11:58:14,987 INFO L226 Difference]: Without dead ends: 5467 [2019-10-02 11:58:15,008 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-10-02 11:58:15,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5467 states. [2019-10-02 11:58:15,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5467 to 5352. [2019-10-02 11:58:15,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5352 states. [2019-10-02 11:58:15,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5352 states to 5352 states and 8601 transitions. [2019-10-02 11:58:15,356 INFO L78 Accepts]: Start accepts. Automaton has 5352 states and 8601 transitions. Word has length 187 [2019-10-02 11:58:15,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:58:15,357 INFO L475 AbstractCegarLoop]: Abstraction has 5352 states and 8601 transitions. [2019-10-02 11:58:15,357 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:58:15,358 INFO L276 IsEmpty]: Start isEmpty. Operand 5352 states and 8601 transitions. [2019-10-02 11:58:15,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-02 11:58:15,364 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:58:15,365 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 11:58:15,365 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:58:15,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:58:15,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1073749924, now seen corresponding path program 1 times [2019-10-02 11:58:15,366 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:58:15,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:58:15,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:15,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:15,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:15,679 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 11:58:15,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:58:15,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 11:58:15,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:58:15,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:58:15,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:58:15,682 INFO L87 Difference]: Start difference. First operand 5352 states and 8601 transitions. Second operand 11 states. [2019-10-02 11:58:22,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:58:22,356 INFO L93 Difference]: Finished difference Result 11204 states and 17987 transitions. [2019-10-02 11:58:22,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 11:58:22,356 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 194 [2019-10-02 11:58:22,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:58:22,386 INFO L225 Difference]: With dead ends: 11204 [2019-10-02 11:58:22,387 INFO L226 Difference]: Without dead ends: 6661 [2019-10-02 11:58:22,399 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-10-02 11:58:22,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6661 states. [2019-10-02 11:58:22,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6661 to 6512. [2019-10-02 11:58:22,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6512 states. [2019-10-02 11:58:22,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6512 states to 6512 states and 10293 transitions. [2019-10-02 11:58:22,660 INFO L78 Accepts]: Start accepts. Automaton has 6512 states and 10293 transitions. Word has length 194 [2019-10-02 11:58:22,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:58:22,661 INFO L475 AbstractCegarLoop]: Abstraction has 6512 states and 10293 transitions. [2019-10-02 11:58:22,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:58:22,661 INFO L276 IsEmpty]: Start isEmpty. Operand 6512 states and 10293 transitions. [2019-10-02 11:58:22,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-02 11:58:22,666 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:58:22,666 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 11:58:22,666 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:58:22,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:58:22,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1171069108, now seen corresponding path program 1 times [2019-10-02 11:58:22,667 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:58:22,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:58:22,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:22,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:22,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:22,825 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 11:58:22,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:58:22,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:58:22,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:58:22,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:58:22,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:58:22,828 INFO L87 Difference]: Start difference. First operand 6512 states and 10293 transitions. Second operand 6 states. [2019-10-02 11:58:23,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:58:23,195 INFO L93 Difference]: Finished difference Result 15091 states and 24099 transitions. [2019-10-02 11:58:23,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:58:23,195 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 192 [2019-10-02 11:58:23,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:58:23,234 INFO L225 Difference]: With dead ends: 15091 [2019-10-02 11:58:23,234 INFO L226 Difference]: Without dead ends: 9509 [2019-10-02 11:58:23,252 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:58:23,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9509 states. [2019-10-02 11:58:23,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9509 to 8282. [2019-10-02 11:58:23,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8282 states. [2019-10-02 11:58:23,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8282 states to 8282 states and 13215 transitions. [2019-10-02 11:58:23,618 INFO L78 Accepts]: Start accepts. Automaton has 8282 states and 13215 transitions. Word has length 192 [2019-10-02 11:58:23,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:58:23,619 INFO L475 AbstractCegarLoop]: Abstraction has 8282 states and 13215 transitions. [2019-10-02 11:58:23,619 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:58:23,619 INFO L276 IsEmpty]: Start isEmpty. Operand 8282 states and 13215 transitions. [2019-10-02 11:58:23,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-02 11:58:23,624 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:58:23,624 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 11:58:23,625 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:58:23,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:58:23,625 INFO L82 PathProgramCache]: Analyzing trace with hash 397019965, now seen corresponding path program 1 times [2019-10-02 11:58:23,625 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:58:23,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:58:23,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:23,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:23,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:23,767 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 11:58:23,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:58:23,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:58:23,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:58:23,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:58:23,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:58:23,768 INFO L87 Difference]: Start difference. First operand 8282 states and 13215 transitions. Second operand 4 states. [2019-10-02 11:58:24,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:58:24,583 INFO L93 Difference]: Finished difference Result 16391 states and 26395 transitions. [2019-10-02 11:58:24,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:58:24,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2019-10-02 11:58:24,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:58:24,612 INFO L225 Difference]: With dead ends: 16391 [2019-10-02 11:58:24,613 INFO L226 Difference]: Without dead ends: 8221 [2019-10-02 11:58:24,633 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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-10-02 11:58:24,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8221 states. [2019-10-02 11:58:24,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8221 to 8221. [2019-10-02 11:58:24,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8221 states. [2019-10-02 11:58:24,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8221 states to 8221 states and 13093 transitions. [2019-10-02 11:58:24,996 INFO L78 Accepts]: Start accepts. Automaton has 8221 states and 13093 transitions. Word has length 194 [2019-10-02 11:58:24,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:58:24,996 INFO L475 AbstractCegarLoop]: Abstraction has 8221 states and 13093 transitions. [2019-10-02 11:58:24,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:58:24,996 INFO L276 IsEmpty]: Start isEmpty. Operand 8221 states and 13093 transitions. [2019-10-02 11:58:25,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-02 11:58:25,001 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:58:25,001 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 11:58:25,001 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:58:25,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:58:25,002 INFO L82 PathProgramCache]: Analyzing trace with hash -577531392, now seen corresponding path program 1 times [2019-10-02 11:58:25,002 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:58:25,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:58:25,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:25,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:25,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:25,155 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 11:58:25,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:58:25,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:58:25,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:58:25,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:58:25,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:58:25,157 INFO L87 Difference]: Start difference. First operand 8221 states and 13093 transitions. Second operand 6 states. [2019-10-02 11:58:26,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:58:26,147 INFO L93 Difference]: Finished difference Result 8288 states and 13204 transitions. [2019-10-02 11:58:26,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:58:26,148 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 195 [2019-10-02 11:58:26,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:58:26,175 INFO L225 Difference]: With dead ends: 8288 [2019-10-02 11:58:26,175 INFO L226 Difference]: Without dead ends: 8272 [2019-10-02 11:58:26,179 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:58:26,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8272 states. [2019-10-02 11:58:26,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8272 to 8233. [2019-10-02 11:58:26,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8233 states. [2019-10-02 11:58:26,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8233 states to 8233 states and 13105 transitions. [2019-10-02 11:58:26,578 INFO L78 Accepts]: Start accepts. Automaton has 8233 states and 13105 transitions. Word has length 195 [2019-10-02 11:58:26,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:58:26,579 INFO L475 AbstractCegarLoop]: Abstraction has 8233 states and 13105 transitions. [2019-10-02 11:58:26,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:58:26,579 INFO L276 IsEmpty]: Start isEmpty. Operand 8233 states and 13105 transitions. [2019-10-02 11:58:26,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-02 11:58:26,584 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:58:26,585 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 11:58:26,585 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:58:26,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:58:26,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1983665460, now seen corresponding path program 1 times [2019-10-02 11:58:26,586 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:58:26,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:58:26,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:26,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:26,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:26,739 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 11:58:26,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:58:26,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 11:58:26,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:58:26,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:58:26,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:58:26,741 INFO L87 Difference]: Start difference. First operand 8233 states and 13105 transitions. Second operand 8 states. [2019-10-02 11:58:27,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:58:27,065 INFO L93 Difference]: Finished difference Result 8257 states and 13135 transitions. [2019-10-02 11:58:27,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:58:27,065 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 199 [2019-10-02 11:58:27,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:58:27,095 INFO L225 Difference]: With dead ends: 8257 [2019-10-02 11:58:27,095 INFO L226 Difference]: Without dead ends: 8241 [2019-10-02 11:58:27,099 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:58:27,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8241 states. [2019-10-02 11:58:27,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8241 to 8233. [2019-10-02 11:58:27,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8233 states. [2019-10-02 11:58:27,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8233 states to 8233 states and 13091 transitions. [2019-10-02 11:58:27,461 INFO L78 Accepts]: Start accepts. Automaton has 8233 states and 13091 transitions. Word has length 199 [2019-10-02 11:58:27,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:58:27,462 INFO L475 AbstractCegarLoop]: Abstraction has 8233 states and 13091 transitions. [2019-10-02 11:58:27,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:58:27,462 INFO L276 IsEmpty]: Start isEmpty. Operand 8233 states and 13091 transitions. [2019-10-02 11:58:27,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-10-02 11:58:27,470 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:58:27,470 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 11:58:27,471 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:58:27,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:58:27,472 INFO L82 PathProgramCache]: Analyzing trace with hash -524327783, now seen corresponding path program 1 times [2019-10-02 11:58:27,472 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:58:27,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:58:27,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:27,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:27,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:27,700 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 11:58:27,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:58:27,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:58:27,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:58:27,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:58:27,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:58:27,704 INFO L87 Difference]: Start difference. First operand 8233 states and 13091 transitions. Second operand 9 states. [2019-10-02 11:58:30,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:58:30,838 INFO L93 Difference]: Finished difference Result 16366 states and 26165 transitions. [2019-10-02 11:58:30,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:58:30,838 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 219 [2019-10-02 11:58:30,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:58:30,870 INFO L225 Difference]: With dead ends: 16366 [2019-10-02 11:58:30,870 INFO L226 Difference]: Without dead ends: 8261 [2019-10-02 11:58:30,891 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:58:30,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8261 states. [2019-10-02 11:58:31,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8261 to 8233. [2019-10-02 11:58:31,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8233 states. [2019-10-02 11:58:31,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8233 states to 8233 states and 13077 transitions. [2019-10-02 11:58:31,299 INFO L78 Accepts]: Start accepts. Automaton has 8233 states and 13077 transitions. Word has length 219 [2019-10-02 11:58:31,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:58:31,299 INFO L475 AbstractCegarLoop]: Abstraction has 8233 states and 13077 transitions. [2019-10-02 11:58:31,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:58:31,300 INFO L276 IsEmpty]: Start isEmpty. Operand 8233 states and 13077 transitions. [2019-10-02 11:58:31,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-02 11:58:31,306 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:58:31,306 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 11:58:31,307 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:58:31,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:58:31,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1540713773, now seen corresponding path program 1 times [2019-10-02 11:58:31,307 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:58:31,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:58:31,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:31,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:31,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:31,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:31,523 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 11:58:31,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:58:31,523 INFO L224 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-10-02 11:58:31,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:32,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 3397 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-02 11:58:32,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:58:32,210 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:58:32,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:58:32,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-10-02 11:58:32,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 11:58:32,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 11:58:32,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:58:32,221 INFO L87 Difference]: Start difference. First operand 8233 states and 13077 transitions. Second operand 15 states. [2019-10-02 11:58:40,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:58:40,805 INFO L93 Difference]: Finished difference Result 17109 states and 27211 transitions. [2019-10-02 11:58:40,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-02 11:58:40,805 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 228 [2019-10-02 11:58:40,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:58:40,838 INFO L225 Difference]: With dead ends: 17109 [2019-10-02 11:58:40,839 INFO L226 Difference]: Without dead ends: 9691 [2019-10-02 11:58:40,858 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=1038, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 11:58:40,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9691 states. [2019-10-02 11:58:41,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9691 to 9498. [2019-10-02 11:58:41,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9498 states. [2019-10-02 11:58:41,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9498 states to 9498 states and 14709 transitions. [2019-10-02 11:58:41,189 INFO L78 Accepts]: Start accepts. Automaton has 9498 states and 14709 transitions. Word has length 228 [2019-10-02 11:58:41,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:58:41,189 INFO L475 AbstractCegarLoop]: Abstraction has 9498 states and 14709 transitions. [2019-10-02 11:58:41,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 11:58:41,189 INFO L276 IsEmpty]: Start isEmpty. Operand 9498 states and 14709 transitions. [2019-10-02 11:58:41,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-10-02 11:58:41,197 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:58:41,197 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 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] [2019-10-02 11:58:41,197 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:58:41,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:58:41,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1831424088, now seen corresponding path program 1 times [2019-10-02 11:58:41,198 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:58:41,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:58:41,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:41,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:41,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:41,436 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-10-02 11:58:41,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:58:41,437 INFO L224 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-10-02 11:58:41,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:42,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 3449 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 11:58:42,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:58:42,308 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 62 proven. 10 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (16)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:58:42,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:58:42,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2019-10-02 11:58:42,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 11:58:42,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 11:58:42,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-10-02 11:58:42,326 INFO L87 Difference]: Start difference. First operand 9498 states and 14709 transitions. Second operand 19 states. [2019-10-02 11:58:52,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:58:52,946 INFO L93 Difference]: Finished difference Result 29569 states and 46535 transitions. [2019-10-02 11:58:52,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 11:58:52,947 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 254 [2019-10-02 11:58:52,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:58:53,042 INFO L225 Difference]: With dead ends: 29569 [2019-10-02 11:58:53,043 INFO L226 Difference]: Without dead ends: 20195 [2019-10-02 11:58:53,066 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=777, Unknown=0, NotChecked=0, Total=930 [2019-10-02 11:58:53,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20195 states. [2019-10-02 11:58:53,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20195 to 20043. [2019-10-02 11:58:53,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20043 states. [2019-10-02 11:58:53,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20043 states to 20043 states and 31525 transitions. [2019-10-02 11:58:53,949 INFO L78 Accepts]: Start accepts. Automaton has 20043 states and 31525 transitions. Word has length 254 [2019-10-02 11:58:53,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:58:53,950 INFO L475 AbstractCegarLoop]: Abstraction has 20043 states and 31525 transitions. [2019-10-02 11:58:53,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 11:58:53,950 INFO L276 IsEmpty]: Start isEmpty. Operand 20043 states and 31525 transitions. [2019-10-02 11:58:53,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-10-02 11:58:53,959 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:58:53,960 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 5, 4, 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] [2019-10-02 11:58:53,960 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:58:53,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:58:53,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1624223284, now seen corresponding path program 1 times [2019-10-02 11:58:53,961 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:58:53,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:58:53,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:53,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:53,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:54,161 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-10-02 11:58:54,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:58:54,162 INFO L224 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-10-02 11:58:54,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:54,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 3450 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:58:54,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:58:54,774 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-10-02 11:58:54,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:58:54,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 11:58:54,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:58:54,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:58:54,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:58:54,791 INFO L87 Difference]: Start difference. First operand 20043 states and 31525 transitions. Second operand 6 states. [2019-10-02 11:58:55,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:58:55,628 INFO L93 Difference]: Finished difference Result 40532 states and 64451 transitions. [2019-10-02 11:58:55,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:58:55,629 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 255 [2019-10-02 11:58:55,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:58:55,735 INFO L225 Difference]: With dead ends: 40532 [2019-10-02 11:58:55,736 INFO L226 Difference]: Without dead ends: 20341 [2019-10-02 11:58:55,781 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:58:55,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20341 states. [2019-10-02 11:58:57,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20341 to 20339. [2019-10-02 11:58:57,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20339 states. [2019-10-02 11:58:57,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20339 states to 20339 states and 31450 transitions. [2019-10-02 11:58:57,646 INFO L78 Accepts]: Start accepts. Automaton has 20339 states and 31450 transitions. Word has length 255 [2019-10-02 11:58:57,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:58:57,647 INFO L475 AbstractCegarLoop]: Abstraction has 20339 states and 31450 transitions. [2019-10-02 11:58:57,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:58:57,647 INFO L276 IsEmpty]: Start isEmpty. Operand 20339 states and 31450 transitions. [2019-10-02 11:58:57,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-10-02 11:58:57,660 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:58:57,660 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 11:58:57,660 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:58:57,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:58:57,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1828347465, now seen corresponding path program 1 times [2019-10-02 11:58:57,661 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:58:57,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:58:57,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:57,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:57,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:57,852 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-10-02 11:58:57,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:58:57,852 INFO L224 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) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:58:57,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:58,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 4130 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:58:58,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:58:58,583 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-10-02 11:58:58,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:58:58,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-10-02 11:58:58,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:58:58,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:58:58,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:58:58,591 INFO L87 Difference]: Start difference. First operand 20339 states and 31450 transitions. Second operand 7 states. [2019-10-02 11:58:59,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:58:59,459 INFO L93 Difference]: Finished difference Result 41774 states and 65479 transitions. [2019-10-02 11:58:59,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:58:59,459 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 336 [2019-10-02 11:58:59,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:58:59,534 INFO L225 Difference]: With dead ends: 41774 [2019-10-02 11:58:59,535 INFO L226 Difference]: Without dead ends: 21555 [2019-10-02 11:58:59,578 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 336 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-10-02 11:58:59,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21555 states. [2019-10-02 11:59:00,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21555 to 21543. [2019-10-02 11:59:00,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21543 states. [2019-10-02 11:59:00,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21543 states to 21543 states and 33618 transitions. [2019-10-02 11:59:00,451 INFO L78 Accepts]: Start accepts. Automaton has 21543 states and 33618 transitions. Word has length 336 [2019-10-02 11:59:00,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:59:00,451 INFO L475 AbstractCegarLoop]: Abstraction has 21543 states and 33618 transitions. [2019-10-02 11:59:00,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:59:00,452 INFO L276 IsEmpty]: Start isEmpty. Operand 21543 states and 33618 transitions. [2019-10-02 11:59:00,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-10-02 11:59:00,462 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:59:00,463 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 11:59:00,463 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:59:00,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:59:00,464 INFO L82 PathProgramCache]: Analyzing trace with hash -617026457, now seen corresponding path program 1 times [2019-10-02 11:59:00,464 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:59:00,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:59:00,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:00,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:59:00,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:00,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:59:00,760 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-10-02 11:59:00,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:59:00,760 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:59:00,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:59:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:59:01,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 4135 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 11:59:01,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:59:01,790 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2019-10-02 11:59:01,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:59:01,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-10-02 11:59:01,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 11:59:01,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 11:59:01,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:59:01,805 INFO L87 Difference]: Start difference. First operand 21543 states and 33618 transitions. Second operand 15 states. [2019-10-02 11:59:14,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:59:14,953 INFO L93 Difference]: Finished difference Result 81052 states and 130087 transitions. [2019-10-02 11:59:14,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-02 11:59:14,954 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 343 [2019-10-02 11:59:14,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:59:15,201 INFO L225 Difference]: With dead ends: 81052 [2019-10-02 11:59:15,202 INFO L226 Difference]: Without dead ends: 59233 [2019-10-02 11:59:15,289 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=407, Invalid=1573, Unknown=0, NotChecked=0, Total=1980 [2019-10-02 11:59:15,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59233 states. [2019-10-02 11:59:17,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59233 to 58018. [2019-10-02 11:59:17,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58018 states. [2019-10-02 11:59:17,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58018 states to 58018 states and 90723 transitions. [2019-10-02 11:59:17,633 INFO L78 Accepts]: Start accepts. Automaton has 58018 states and 90723 transitions. Word has length 343 [2019-10-02 11:59:17,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:59:17,633 INFO L475 AbstractCegarLoop]: Abstraction has 58018 states and 90723 transitions. [2019-10-02 11:59:17,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 11:59:17,633 INFO L276 IsEmpty]: Start isEmpty. Operand 58018 states and 90723 transitions. [2019-10-02 11:59:17,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-10-02 11:59:17,640 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:59:17,640 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 11:59:17,640 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:59:17,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:59:17,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1307827563, now seen corresponding path program 1 times [2019-10-02 11:59:17,641 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:59:17,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:59:17,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:17,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:59:17,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:59:17,838 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-10-02 11:59:17,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:59:17,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 11:59:17,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:59:17,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:59:17,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:59:17,840 INFO L87 Difference]: Start difference. First operand 58018 states and 90723 transitions. Second operand 8 states. [2019-10-02 11:59:22,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:59:22,125 INFO L93 Difference]: Finished difference Result 111862 states and 176809 transitions. [2019-10-02 11:59:22,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:59:22,126 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 292 [2019-10-02 11:59:22,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:59:22,356 INFO L225 Difference]: With dead ends: 111862 [2019-10-02 11:59:22,356 INFO L226 Difference]: Without dead ends: 54054 [2019-10-02 11:59:22,468 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:59:22,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54054 states. [2019-10-02 11:59:23,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54054 to 54034. [2019-10-02 11:59:23,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54034 states. [2019-10-02 11:59:24,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54034 states to 54034 states and 85037 transitions. [2019-10-02 11:59:24,220 INFO L78 Accepts]: Start accepts. Automaton has 54034 states and 85037 transitions. Word has length 292 [2019-10-02 11:59:24,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:59:24,221 INFO L475 AbstractCegarLoop]: Abstraction has 54034 states and 85037 transitions. [2019-10-02 11:59:24,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:59:24,221 INFO L276 IsEmpty]: Start isEmpty. Operand 54034 states and 85037 transitions. [2019-10-02 11:59:24,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-10-02 11:59:24,228 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:59:24,228 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 11:59:24,228 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:59:24,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:59:24,228 INFO L82 PathProgramCache]: Analyzing trace with hash 2065159741, now seen corresponding path program 1 times [2019-10-02 11:59:24,228 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:59:24,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:59:24,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:24,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:59:24,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:59:24,973 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 23 proven. 19 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-02 11:59:24,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:59:24,973 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:59:25,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:59:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:59:25,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 3803 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:59:25,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:59:25,758 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 20 proven. 65 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-02 11:59:25,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:59:25,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-10-02 11:59:25,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 11:59:25,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 11:59:25,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:59:25,776 INFO L87 Difference]: Start difference. First operand 54034 states and 85037 transitions. Second operand 15 states. [2019-10-02 11:59:42,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:59:42,413 INFO L93 Difference]: Finished difference Result 133686 states and 215389 transitions. [2019-10-02 11:59:42,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-02 11:59:42,414 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 303 [2019-10-02 11:59:42,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:59:42,772 INFO L225 Difference]: With dead ends: 133686 [2019-10-02 11:59:42,773 INFO L226 Difference]: Without dead ends: 79752 [2019-10-02 11:59:42,909 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=372, Invalid=2280, Unknown=0, NotChecked=0, Total=2652 [2019-10-02 11:59:42,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79752 states. [2019-10-02 11:59:45,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79752 to 76170. [2019-10-02 11:59:45,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76170 states. [2019-10-02 11:59:46,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76170 states to 76170 states and 118008 transitions. [2019-10-02 11:59:46,167 INFO L78 Accepts]: Start accepts. Automaton has 76170 states and 118008 transitions. Word has length 303 [2019-10-02 11:59:46,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:59:46,168 INFO L475 AbstractCegarLoop]: Abstraction has 76170 states and 118008 transitions. [2019-10-02 11:59:46,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 11:59:46,168 INFO L276 IsEmpty]: Start isEmpty. Operand 76170 states and 118008 transitions. [2019-10-02 11:59:46,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-10-02 11:59:46,176 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:59:46,177 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 11:59:46,177 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:59:46,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:59:46,178 INFO L82 PathProgramCache]: Analyzing trace with hash -233037993, now seen corresponding path program 1 times [2019-10-02 11:59:46,178 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:59:46,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:59:46,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:46,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:59:46,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:59:46,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:59:46,446 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 19 proven. 15 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-10-02 11:59:46,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:59:46,447 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:59:49,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:59:49,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:59:49,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 3801 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:59:49,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:59:49,811 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2019-10-02 11:59:49,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:59:49,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2019-10-02 11:59:49,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 11:59:49,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 11:59:49,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:59:49,820 INFO L87 Difference]: Start difference. First operand 76170 states and 118008 transitions. Second operand 15 states. [2019-10-02 12:00:17,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:00:17,666 INFO L93 Difference]: Finished difference Result 332111 states and 548115 transitions. [2019-10-02 12:00:17,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-02 12:00:17,667 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 304 [2019-10-02 12:00:17,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:00:19,733 INFO L225 Difference]: With dead ends: 332111 [2019-10-02 12:00:19,733 INFO L226 Difference]: Without dead ends: 255499 [2019-10-02 12:00:20,036 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 332 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=337, Invalid=2015, Unknown=0, NotChecked=0, Total=2352 [2019-10-02 12:00:20,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255499 states. [2019-10-02 12:00:38,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255499 to 251493. [2019-10-02 12:00:38,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251493 states. [2019-10-02 12:00:40,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251493 states to 251493 states and 408717 transitions. [2019-10-02 12:00:40,955 INFO L78 Accepts]: Start accepts. Automaton has 251493 states and 408717 transitions. Word has length 304 [2019-10-02 12:00:40,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:00:40,956 INFO L475 AbstractCegarLoop]: Abstraction has 251493 states and 408717 transitions. [2019-10-02 12:00:40,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:00:40,956 INFO L276 IsEmpty]: Start isEmpty. Operand 251493 states and 408717 transitions. [2019-10-02 12:00:41,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-10-02 12:00:41,006 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:00:41,007 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-02 12:00:41,007 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:00:41,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:00:41,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1421726552, now seen corresponding path program 1 times [2019-10-02 12:00:41,008 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:00:41,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:00:41,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:41,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:41,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:41,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:41,187 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-10-02 12:00:41,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:00:41,188 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:00:41,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:41,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 3802 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 12:00:41,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:00:41,922 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-02 12:00:41,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:00:41,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2019-10-02 12:00:41,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:00:41,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:00:41,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:00:41,930 INFO L87 Difference]: Start difference. First operand 251493 states and 408717 transitions. Second operand 10 states. [2019-10-02 12:01:08,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:01:08,743 INFO L93 Difference]: Finished difference Result 521017 states and 841743 transitions. [2019-10-02 12:01:08,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-10-02 12:01:08,743 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 306 [2019-10-02 12:01:08,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:01:10,211 INFO L225 Difference]: With dead ends: 521017 [2019-10-02 12:01:10,211 INFO L226 Difference]: Without dead ends: 265379 [2019-10-02 12:01:10,881 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=291, Invalid=1191, Unknown=0, NotChecked=0, Total=1482 [2019-10-02 12:01:11,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265379 states. [2019-10-02 12:01:37,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265379 to 261133. [2019-10-02 12:01:37,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261133 states. [2019-10-02 12:01:40,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261133 states to 261133 states and 412406 transitions. [2019-10-02 12:01:40,708 INFO L78 Accepts]: Start accepts. Automaton has 261133 states and 412406 transitions. Word has length 306 [2019-10-02 12:01:40,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:01:40,709 INFO L475 AbstractCegarLoop]: Abstraction has 261133 states and 412406 transitions. [2019-10-02 12:01:40,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:01:40,709 INFO L276 IsEmpty]: Start isEmpty. Operand 261133 states and 412406 transitions. [2019-10-02 12:01:40,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-10-02 12:01:40,741 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:01:40,741 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 12:01:40,741 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:01:40,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:01:40,742 INFO L82 PathProgramCache]: Analyzing trace with hash 2085277358, now seen corresponding path program 1 times [2019-10-02 12:01:40,742 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:01:40,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:01:40,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:01:40,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:01:40,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:01:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:01:40,926 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-02 12:01:40,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:01:40,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:01:40,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:01:40,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:01:40,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:01:40,928 INFO L87 Difference]: Start difference. First operand 261133 states and 412406 transitions. Second operand 7 states. [2019-10-02 12:02:04,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:02:04,740 INFO L93 Difference]: Finished difference Result 571947 states and 917499 transitions. [2019-10-02 12:02:04,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:02:04,740 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 308 [2019-10-02 12:02:04,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:02:06,317 INFO L225 Difference]: With dead ends: 571947 [2019-10-02 12:02:06,317 INFO L226 Difference]: Without dead ends: 310255 [2019-10-02 12:02:06,960 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:02:07,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310255 states. [2019-10-02 12:02:40,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310255 to 308307. [2019-10-02 12:02:40,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308307 states. [2019-10-02 12:02:42,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308307 states to 308307 states and 489251 transitions. [2019-10-02 12:02:42,693 INFO L78 Accepts]: Start accepts. Automaton has 308307 states and 489251 transitions. Word has length 308 [2019-10-02 12:02:42,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:02:42,694 INFO L475 AbstractCegarLoop]: Abstraction has 308307 states and 489251 transitions. [2019-10-02 12:02:42,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:02:42,694 INFO L276 IsEmpty]: Start isEmpty. Operand 308307 states and 489251 transitions. [2019-10-02 12:02:42,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-10-02 12:02:42,722 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:02:42,722 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 12:02:42,722 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:02:42,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:02:42,722 INFO L82 PathProgramCache]: Analyzing trace with hash 2081642463, now seen corresponding path program 1 times [2019-10-02 12:02:42,722 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:02:42,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:02:42,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:42,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:42,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:42,909 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-02 12:02:42,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:02:42,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:02:42,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:02:42,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:02:42,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:02:42,911 INFO L87 Difference]: Start difference. First operand 308307 states and 489251 transitions. Second operand 7 states. [2019-10-02 12:03:12,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:12,449 INFO L93 Difference]: Finished difference Result 667542 states and 1081923 transitions. [2019-10-02 12:03:12,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:03:12,450 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 309 [2019-10-02 12:03:12,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:14,322 INFO L225 Difference]: With dead ends: 667542 [2019-10-02 12:03:14,323 INFO L226 Difference]: Without dead ends: 358494 [2019-10-02 12:03:15,142 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:03:15,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358494 states. [2019-10-02 12:03:48,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358494 to 356007. [2019-10-02 12:03:48,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356007 states. [2019-10-02 12:03:59,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356007 states to 356007 states and 563528 transitions. [2019-10-02 12:03:59,396 INFO L78 Accepts]: Start accepts. Automaton has 356007 states and 563528 transitions. Word has length 309 [2019-10-02 12:03:59,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:59,397 INFO L475 AbstractCegarLoop]: Abstraction has 356007 states and 563528 transitions. [2019-10-02 12:03:59,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:03:59,397 INFO L276 IsEmpty]: Start isEmpty. Operand 356007 states and 563528 transitions. [2019-10-02 12:03:59,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-10-02 12:03:59,453 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:59,454 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 12:03:59,454 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:59,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:59,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1365246478, now seen corresponding path program 1 times [2019-10-02 12:03:59,454 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:59,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:59,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:59,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:59,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:59,627 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-10-02 12:03:59,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:03:59,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:03:59,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:03:59,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:03:59,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:03:59,632 INFO L87 Difference]: Start difference. First operand 356007 states and 563528 transitions. Second operand 9 states. [2019-10-02 12:04:27,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:27,217 INFO L93 Difference]: Finished difference Result 522459 states and 814479 transitions. [2019-10-02 12:04:27,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:04:27,218 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 309 [2019-10-02 12:04:27,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:28,828 INFO L225 Difference]: With dead ends: 522459 [2019-10-02 12:04:28,829 INFO L226 Difference]: Without dead ends: 352119 [2019-10-02 12:04:29,194 INFO L640 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-10-02 12:04:29,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352119 states. [2019-10-02 12:05:01,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352119 to 352119. [2019-10-02 12:05:01,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352119 states. [2019-10-02 12:05:03,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352119 states to 352119 states and 552347 transitions. [2019-10-02 12:05:03,625 INFO L78 Accepts]: Start accepts. Automaton has 352119 states and 552347 transitions. Word has length 309 [2019-10-02 12:05:03,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:03,626 INFO L475 AbstractCegarLoop]: Abstraction has 352119 states and 552347 transitions. [2019-10-02 12:05:03,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:05:03,626 INFO L276 IsEmpty]: Start isEmpty. Operand 352119 states and 552347 transitions. [2019-10-02 12:05:03,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-10-02 12:05:03,645 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:03,646 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 12:05:03,646 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:03,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:03,646 INFO L82 PathProgramCache]: Analyzing trace with hash -551560886, now seen corresponding path program 1 times [2019-10-02 12:05:03,646 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:03,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:03,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:03,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:03,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:03,886 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-02 12:05:03,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:05:03,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:05:03,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:05:03,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:05:03,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:05:03,888 INFO L87 Difference]: Start difference. First operand 352119 states and 552347 transitions. Second operand 6 states. [2019-10-02 12:06:02,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:02,056 INFO L93 Difference]: Finished difference Result 1049765 states and 1685016 transitions. [2019-10-02 12:06:02,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:06:02,056 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 310 [2019-10-02 12:06:02,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:06,919 INFO L225 Difference]: With dead ends: 1049765 [2019-10-02 12:06:06,920 INFO L226 Difference]: Without dead ends: 694517 [2019-10-02 12:06:07,846 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:06:08,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694517 states. [2019-10-02 12:06:58,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694517 to 683575. [2019-10-02 12:06:58,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683575 states. [2019-10-02 12:07:18,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683575 states to 683575 states and 1086488 transitions. [2019-10-02 12:07:18,101 INFO L78 Accepts]: Start accepts. Automaton has 683575 states and 1086488 transitions. Word has length 310 [2019-10-02 12:07:18,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:18,102 INFO L475 AbstractCegarLoop]: Abstraction has 683575 states and 1086488 transitions. [2019-10-02 12:07:18,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:07:18,102 INFO L276 IsEmpty]: Start isEmpty. Operand 683575 states and 1086488 transitions. [2019-10-02 12:07:18,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-10-02 12:07:18,135 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:18,135 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-02 12:07:18,136 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:18,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:18,136 INFO L82 PathProgramCache]: Analyzing trace with hash 81514810, now seen corresponding path program 1 times [2019-10-02 12:07:18,136 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:18,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:18,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:18,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:18,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:18,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:18,329 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-10-02 12:07:18,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:07:18,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:07:18,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:07:18,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:07:18,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:07:18,330 INFO L87 Difference]: Start difference. First operand 683575 states and 1086488 transitions. Second operand 7 states.