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_product21.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:03:49,772 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:03:49,774 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:03:49,793 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:03:49,794 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:03:49,795 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:03:49,796 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:03:49,798 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:03:49,800 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:03:49,800 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:03:49,801 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:03:49,802 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:03:49,803 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:03:49,804 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:03:49,805 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:03:49,806 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:03:49,807 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:03:49,808 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:03:49,809 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:03:49,815 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:03:49,819 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:03:49,820 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:03:49,821 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:03:49,824 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:03:49,829 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:03:49,829 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:03:49,830 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:03:49,831 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:03:49,832 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:03:49,834 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:03:49,834 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:03:49,835 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:03:49,837 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:03:49,838 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:03:49,839 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:03:49,839 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:03:49,840 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:03:49,840 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:03:49,840 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:03:49,844 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:03:49,846 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:03:49,847 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 12:03:49,872 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:03:49,873 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:03:49,875 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:03:49,875 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:03:49,876 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:03:49,876 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:03:49,876 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:03:49,877 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:03:49,877 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:03:49,877 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:03:49,878 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:03:49,878 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:03:49,878 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:03:49,879 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:03:49,879 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:03:49,879 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:03:49,879 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:03:49,880 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:03:49,881 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:03:49,881 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:03:49,881 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:03:49,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:03:49,882 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:03:49,882 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:03:49,882 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:03:49,882 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:03:49,883 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:03:49,883 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:03:49,883 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:03:49,916 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:03:49,929 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:03:49,933 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:03:49,936 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:03:49,937 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:03:49,937 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_product21.cil.c [2019-10-02 12:03:50,022 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46cb97d19/30feb2d29e3c4431a1c9ca44819fe232/FLAG3e7d637a2 [2019-10-02 12:03:50,765 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:03:50,766 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_product21.cil.c [2019-10-02 12:03:50,798 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46cb97d19/30feb2d29e3c4431a1c9ca44819fe232/FLAG3e7d637a2 [2019-10-02 12:03:51,023 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46cb97d19/30feb2d29e3c4431a1c9ca44819fe232 [2019-10-02 12:03:51,035 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:03:51,037 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:03:51,038 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:03:51,038 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:03:51,041 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:03:51,042 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:03:51" (1/1) ... [2019-10-02 12:03:51,045 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15459dda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:03:51, skipping insertion in model container [2019-10-02 12:03:51,045 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:03:51" (1/1) ... [2019-10-02 12:03:51,051 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:03:51,125 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:03:51,814 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:03:51,838 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:03:52,017 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:03:52,087 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:03:52,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:03:52 WrapperNode [2019-10-02 12:03:52,088 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:03:52,089 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:03:52,089 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:03:52,089 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:03:52,104 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:03:52" (1/1) ... [2019-10-02 12:03:52,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:03:52" (1/1) ... [2019-10-02 12:03:52,143 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:03:52" (1/1) ... [2019-10-02 12:03:52,143 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:03:52" (1/1) ... [2019-10-02 12:03:52,229 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:03:52" (1/1) ... [2019-10-02 12:03:52,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:03:52" (1/1) ... [2019-10-02 12:03:52,278 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:03:52" (1/1) ... [2019-10-02 12:03:52,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:03:52,291 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:03:52,291 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:03:52,292 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:03:52,293 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:03:52" (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 12:03:52,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:03:52,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:03:52,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:03:52,372 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 12:03:52,372 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 12:03:52,372 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 12:03:52,372 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-02 12:03:52,372 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 12:03:52,373 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 12:03:52,373 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 12:03:52,373 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 12:03:52,373 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 12:03:52,373 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 12:03:52,374 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 12:03:52,374 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 12:03:52,374 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 12:03:52,374 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 12:03:52,374 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 12:03:52,375 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 12:03:52,375 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-10-02 12:03:52,375 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 12:03:52,375 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 12:03:52,375 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 12:03:52,376 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-02 12:03:52,376 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 12:03:52,376 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 12:03:52,376 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 12:03:52,376 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 12:03:52,376 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 12:03:52,377 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 12:03:52,377 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 12:03:52,377 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 12:03:52,377 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 12:03:52,377 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 12:03:52,377 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 12:03:52,377 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 12:03:52,378 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 12:03:52,378 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 12:03:52,378 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 12:03:52,378 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 12:03:52,378 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 12:03:52,379 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 12:03:52,379 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 12:03:52,379 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 12:03:52,379 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:03:52,379 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 12:03:52,379 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:03:52,380 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:03:52,380 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:03:52,380 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:03:52,380 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:03:52,380 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:03:52,380 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:03:52,381 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 12:03:52,381 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 12:03:52,381 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:03:52,381 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:03:52,381 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:03:52,382 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:03:52,382 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:03:52,382 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 12:03:52,382 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 12:03:52,382 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 12:03:52,383 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 12:03:52,383 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 12:03:52,383 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 12:03:52,383 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 12:03:52,383 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 12:03:52,384 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:03:52,384 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 12:03:52,384 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 12:03:52,384 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 12:03:52,384 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__1 [2019-10-02 12:03:52,385 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__2 [2019-10-02 12:03:52,385 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__3 [2019-10-02 12:03:52,385 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__4 [2019-10-02 12:03:52,385 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:03:52,385 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:03:52,386 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:03:52,386 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 12:03:52,386 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 12:03:52,386 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 12:03:52,386 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 12:03:52,387 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 12:03:52,387 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 12:03:52,387 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 12:03:52,387 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 12:03:52,387 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 12:03:52,388 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 12:03:52,388 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 12:03:52,388 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 12:03:52,388 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 12:03:52,388 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 12:03:52,388 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 12:03:52,389 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 12:03:52,389 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 12:03:52,389 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 12:03:52,389 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 12:03:52,389 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 12:03:52,389 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-02 12:03:52,390 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 12:03:52,390 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 12:03:52,390 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 12:03:52,390 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 12:03:52,390 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 12:03:52,391 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 12:03:52,391 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-10-02 12:03:52,391 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 12:03:52,391 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 12:03:52,391 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-02 12:03:52,391 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 12:03:52,392 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 12:03:52,392 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 12:03:52,392 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__3 [2019-10-02 12:03:52,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:03:52,392 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 12:03:52,392 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 12:03:52,393 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 12:03:52,393 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 12:03:52,393 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 12:03:52,393 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 12:03:52,393 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 12:03:52,394 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 12:03:52,394 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 12:03:52,394 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 12:03:52,394 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 12:03:52,394 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 12:03:52,395 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 12:03:52,395 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 12:03:52,396 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 12:03:52,396 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 12:03:52,397 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 12:03:52,397 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 12:03:52,397 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:03:52,397 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__1 [2019-10-02 12:03:52,397 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__4 [2019-10-02 12:03:52,397 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:03:52,398 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 12:03:52,398 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:03:52,399 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:03:52,402 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:03:52,402 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:03:52,402 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:03:52,403 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:03:52,409 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:03:52,409 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:03:52,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:03:52,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:03:52,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:03:52,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:03:52,410 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:03:52,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:03:52,411 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:03:52,411 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:03:52,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:03:52,411 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:03:52,411 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:03:52,411 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:03:52,411 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 12:03:52,412 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 12:03:52,412 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:03:52,412 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 12:03:52,412 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__2 [2019-10-02 12:03:52,412 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:03:52,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:03:52,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:03:52,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:03:54,688 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:03:54,689 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 12:03:54,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:03:54 BoogieIcfgContainer [2019-10-02 12:03:54,691 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:03:54,692 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:03:54,692 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:03:54,695 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:03:54,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:03:51" (1/3) ... [2019-10-02 12:03:54,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f09fc63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:03:54, skipping insertion in model container [2019-10-02 12:03:54,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:03:52" (2/3) ... [2019-10-02 12:03:54,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f09fc63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:03:54, skipping insertion in model container [2019-10-02 12:03:54,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:03:54" (3/3) ... [2019-10-02 12:03:54,699 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product21.cil.c [2019-10-02 12:03:54,709 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:03:54,721 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:03:54,737 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:03:54,783 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:03:54,783 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:03:54,784 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:03:54,784 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:03:54,784 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:03:54,784 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:03:54,784 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:03:54,784 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:03:54,784 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:03:54,833 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states. [2019-10-02 12:03:54,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-02 12:03:54,871 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:54,873 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] [2019-10-02 12:03:54,875 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:54,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:54,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1975081631, now seen corresponding path program 1 times [2019-10-02 12:03:54,884 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:54,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:54,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:54,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:54,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:55,571 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 12:03:55,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:55,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 12:03:55,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:56,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 3273 conjuncts, 1 conjunts are in the unsatisfiable core [2019-10-02 12:03:56,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:56,450 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 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 12:03:56,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:56,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2019-10-02 12:03:56,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:03:56,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:03:56,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:03:56,487 INFO L87 Difference]: Start difference. First operand 774 states. Second operand 4 states. [2019-10-02 12:03:56,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:56,708 INFO L93 Difference]: Finished difference Result 1232 states and 1991 transitions. [2019-10-02 12:03:56,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:03:56,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-10-02 12:03:56,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:56,744 INFO L225 Difference]: With dead ends: 1232 [2019-10-02 12:03:56,745 INFO L226 Difference]: Without dead ends: 620 [2019-10-02 12:03:56,758 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 156 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 12:03:56,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-10-02 12:03:56,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-10-02 12:03:56,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-02 12:03:56,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 989 transitions. [2019-10-02 12:03:56,891 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 989 transitions. Word has length 155 [2019-10-02 12:03:56,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:56,892 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 989 transitions. [2019-10-02 12:03:56,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:03:56,892 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 989 transitions. [2019-10-02 12:03:56,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 12:03:56,905 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:56,905 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:03:56,905 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:56,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:56,906 INFO L82 PathProgramCache]: Analyzing trace with hash 511513774, now seen corresponding path program 1 times [2019-10-02 12:03:56,906 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:56,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:56,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:56,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:56,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:57,198 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 12:03:57,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:57,199 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 12:03:57,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:57,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 3278 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:03:57,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:57,938 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:03:57,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:57,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:03:57,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:03:57,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:03:57,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:03:57,966 INFO L87 Difference]: Start difference. First operand 620 states and 989 transitions. Second operand 6 states. [2019-10-02 12:03:58,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:58,101 INFO L93 Difference]: Finished difference Result 1212 states and 1951 transitions. [2019-10-02 12:03:58,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:03:58,102 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 159 [2019-10-02 12:03:58,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:58,108 INFO L225 Difference]: With dead ends: 1212 [2019-10-02 12:03:58,108 INFO L226 Difference]: Without dead ends: 620 [2019-10-02 12:03:58,112 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 158 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 12:03:58,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-10-02 12:03:58,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-10-02 12:03:58,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-02 12:03:58,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 988 transitions. [2019-10-02 12:03:58,165 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 988 transitions. Word has length 159 [2019-10-02 12:03:58,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:58,165 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 988 transitions. [2019-10-02 12:03:58,165 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:03:58,165 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 988 transitions. [2019-10-02 12:03:58,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-02 12:03:58,175 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:58,175 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] [2019-10-02 12:03:58,175 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:58,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:58,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1781427860, now seen corresponding path program 1 times [2019-10-02 12:03:58,176 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:58,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:58,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:58,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:58,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:58,343 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 12:03:58,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:58,344 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 12:03:58,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:58,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 3280 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:03:58,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:59,004 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:03:59,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:59,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:03:59,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:03:59,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:03:59,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:03:59,013 INFO L87 Difference]: Start difference. First operand 620 states and 988 transitions. Second operand 6 states. [2019-10-02 12:03:59,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:59,109 INFO L93 Difference]: Finished difference Result 1216 states and 1954 transitions. [2019-10-02 12:03:59,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:03:59,110 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 161 [2019-10-02 12:03:59,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:59,115 INFO L225 Difference]: With dead ends: 1216 [2019-10-02 12:03:59,116 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 12:03:59,119 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 160 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 12:03:59,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 12:03:59,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 12:03:59,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 12:03:59,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 993 transitions. [2019-10-02 12:03:59,150 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 993 transitions. Word has length 161 [2019-10-02 12:03:59,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:59,150 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 993 transitions. [2019-10-02 12:03:59,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:03:59,150 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 993 transitions. [2019-10-02 12:03:59,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-02 12:03:59,157 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:59,157 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:03:59,157 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:59,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:59,158 INFO L82 PathProgramCache]: Analyzing trace with hash -831391142, now seen corresponding path program 1 times [2019-10-02 12:03:59,158 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:59,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:59,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:59,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:59,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:59,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:59,344 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 12:03:59,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:59,345 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 12:03:59,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:59,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:59,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 3281 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:03:59,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:00,027 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:04:00,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:00,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:04:00,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:04:00,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:04:00,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:04:00,038 INFO L87 Difference]: Start difference. First operand 626 states and 993 transitions. Second operand 6 states. [2019-10-02 12:04:00,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:00,135 INFO L93 Difference]: Finished difference Result 1215 states and 1945 transitions. [2019-10-02 12:04:00,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:04:00,135 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 162 [2019-10-02 12:04:00,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:00,140 INFO L225 Difference]: With dead ends: 1215 [2019-10-02 12:04:00,141 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 12:04:00,144 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 162 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 12:04:00,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 12:04:00,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 12:04:00,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 12:04:00,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 992 transitions. [2019-10-02 12:04:00,171 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 992 transitions. Word has length 162 [2019-10-02 12:04:00,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:00,171 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 992 transitions. [2019-10-02 12:04:00,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:04:00,171 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 992 transitions. [2019-10-02 12:04:00,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-02 12:04:00,177 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:00,177 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:00,178 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:00,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:00,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1680400040, now seen corresponding path program 1 times [2019-10-02 12:04:00,178 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:00,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:00,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:00,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:00,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:00,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:00,306 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 12:04:00,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:00,307 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 12:04:00,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:00,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 3282 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:04:00,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:00,932 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:04:00,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:00,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:04:00,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:04:00,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:04:00,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:04:00,952 INFO L87 Difference]: Start difference. First operand 626 states and 992 transitions. Second operand 6 states. [2019-10-02 12:04:01,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:01,037 INFO L93 Difference]: Finished difference Result 1215 states and 1944 transitions. [2019-10-02 12:04:01,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:04:01,038 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2019-10-02 12:04:01,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:01,050 INFO L225 Difference]: With dead ends: 1215 [2019-10-02 12:04:01,051 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 12:04:01,060 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 163 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 12:04:01,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 12:04:01,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 12:04:01,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 12:04:01,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 991 transitions. [2019-10-02 12:04:01,102 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 991 transitions. Word has length 163 [2019-10-02 12:04:01,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:01,103 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 991 transitions. [2019-10-02 12:04:01,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:04:01,103 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 991 transitions. [2019-10-02 12:04:01,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-02 12:04:01,112 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:01,112 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:01,113 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:01,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:01,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1066972054, now seen corresponding path program 1 times [2019-10-02 12:04:01,114 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:01,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:01,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:01,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:01,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:01,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:01,398 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 12:04:01,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:01,399 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 12:04:01,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:02,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 3283 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 12:04:02,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:02,246 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:04:02,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:02,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2019-10-02 12:04:02,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:04:02,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:04:02,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:04:02,261 INFO L87 Difference]: Start difference. First operand 626 states and 991 transitions. Second operand 15 states. [2019-10-02 12:04:02,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:02,502 INFO L93 Difference]: Finished difference Result 1220 states and 1951 transitions. [2019-10-02 12:04:02,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:04:02,503 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 164 [2019-10-02 12:04:02,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:02,509 INFO L225 Difference]: With dead ends: 1220 [2019-10-02 12:04:02,510 INFO L226 Difference]: Without dead ends: 635 [2019-10-02 12:04:02,540 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 163 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 12:04:02,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-10-02 12:04:02,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 633. [2019-10-02 12:04:02,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2019-10-02 12:04:02,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 1001 transitions. [2019-10-02 12:04:02,569 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 1001 transitions. Word has length 164 [2019-10-02 12:04:02,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:02,570 INFO L475 AbstractCegarLoop]: Abstraction has 633 states and 1001 transitions. [2019-10-02 12:04:02,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:04:02,570 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 1001 transitions. [2019-10-02 12:04:02,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-02 12:04:02,576 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:02,576 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, 1, 1, 1] [2019-10-02 12:04:02,576 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:02,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:02,577 INFO L82 PathProgramCache]: Analyzing trace with hash -146369345, now seen corresponding path program 1 times [2019-10-02 12:04:02,577 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:02,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:02,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:02,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:02,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:02,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:02,718 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 12:04:02,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:02,718 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 12:04:02,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:03,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 3284 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:04:03,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:03,357 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:04:03,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:03,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:04:03,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:04:03,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:04:03,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:04:03,375 INFO L87 Difference]: Start difference. First operand 633 states and 1001 transitions. Second operand 8 states. [2019-10-02 12:04:03,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:03,658 INFO L93 Difference]: Finished difference Result 1227 states and 1964 transitions. [2019-10-02 12:04:03,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:04:03,659 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 165 [2019-10-02 12:04:03,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:03,664 INFO L225 Difference]: With dead ends: 1227 [2019-10-02 12:04:03,665 INFO L226 Difference]: Without dead ends: 633 [2019-10-02 12:04:03,669 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 167 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 12:04:03,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-10-02 12:04:03,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 633. [2019-10-02 12:04:03,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2019-10-02 12:04:03,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 996 transitions. [2019-10-02 12:04:03,699 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 996 transitions. Word has length 165 [2019-10-02 12:04:03,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:03,699 INFO L475 AbstractCegarLoop]: Abstraction has 633 states and 996 transitions. [2019-10-02 12:04:03,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:04:03,700 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 996 transitions. [2019-10-02 12:04:03,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-02 12:04:03,708 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:03,708 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] [2019-10-02 12:04:03,709 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:03,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:03,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1928834139, now seen corresponding path program 1 times [2019-10-02 12:04:03,710 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:03,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:03,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:03,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:03,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:03,883 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-02 12:04:03,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:03,883 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 12:04:04,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:04,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 3284 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:04:04,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:04,551 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:04:04,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:04,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:04:04,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:04:04,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:04:04,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:04:04,561 INFO L87 Difference]: Start difference. First operand 633 states and 996 transitions. Second operand 6 states. [2019-10-02 12:04:04,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:04,868 INFO L93 Difference]: Finished difference Result 1227 states and 1952 transitions. [2019-10-02 12:04:04,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:04:04,869 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 166 [2019-10-02 12:04:04,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:04,879 INFO L225 Difference]: With dead ends: 1227 [2019-10-02 12:04:04,879 INFO L226 Difference]: Without dead ends: 629 [2019-10-02 12:04:04,884 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 166 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 12:04:04,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-10-02 12:04:04,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-10-02 12:04:04,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-10-02 12:04:04,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 984 transitions. [2019-10-02 12:04:04,909 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 984 transitions. Word has length 166 [2019-10-02 12:04:04,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:04,910 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 984 transitions. [2019-10-02 12:04:04,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:04:04,910 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 984 transitions. [2019-10-02 12:04:04,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-02 12:04:04,916 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:04,917 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:04,917 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:04,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:04,918 INFO L82 PathProgramCache]: Analyzing trace with hash 241086921, now seen corresponding path program 1 times [2019-10-02 12:04:04,918 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:04,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:04,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:04,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:04,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:04,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:05,066 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 12:04:05,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:05,068 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 12:04:05,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:05,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 3288 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:04:05,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:05,701 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:04:05,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:05,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:04:05,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:04:05,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:04:05,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:04:05,710 INFO L87 Difference]: Start difference. First operand 629 states and 984 transitions. Second operand 8 states. [2019-10-02 12:04:06,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:06,048 INFO L93 Difference]: Finished difference Result 1244 states and 1966 transitions. [2019-10-02 12:04:06,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:04:06,049 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 169 [2019-10-02 12:04:06,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:06,055 INFO L225 Difference]: With dead ends: 1244 [2019-10-02 12:04:06,055 INFO L226 Difference]: Without dead ends: 647 [2019-10-02 12:04:06,058 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 170 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 12:04:06,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-10-02 12:04:06,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 644. [2019-10-02 12:04:06,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-10-02 12:04:06,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 997 transitions. [2019-10-02 12:04:06,082 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 997 transitions. Word has length 169 [2019-10-02 12:04:06,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:06,083 INFO L475 AbstractCegarLoop]: Abstraction has 644 states and 997 transitions. [2019-10-02 12:04:06,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:04:06,083 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 997 transitions. [2019-10-02 12:04:06,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-10-02 12:04:06,088 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:06,089 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:06,089 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:06,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:06,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1962806857, now seen corresponding path program 1 times [2019-10-02 12:04:06,090 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:06,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:06,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:06,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:06,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:06,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:06,266 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 12:04:06,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:06,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 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 12:04:06,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:06,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:06,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 3284 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 12:04:06,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:06,997 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:04:07,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:07,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-10-02 12:04:07,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:04:07,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:04:07,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:04:07,008 INFO L87 Difference]: Start difference. First operand 644 states and 997 transitions. Second operand 14 states. [2019-10-02 12:04:07,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:07,313 INFO L93 Difference]: Finished difference Result 1234 states and 1931 transitions. [2019-10-02 12:04:07,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:04:07,314 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 169 [2019-10-02 12:04:07,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:07,320 INFO L225 Difference]: With dead ends: 1234 [2019-10-02 12:04:07,320 INFO L226 Difference]: Without dead ends: 638 [2019-10-02 12:04:07,324 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 165 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 12:04:07,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-10-02 12:04:07,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 633. [2019-10-02 12:04:07,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2019-10-02 12:04:07,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 977 transitions. [2019-10-02 12:04:07,346 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 977 transitions. Word has length 169 [2019-10-02 12:04:07,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:07,346 INFO L475 AbstractCegarLoop]: Abstraction has 633 states and 977 transitions. [2019-10-02 12:04:07,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:04:07,346 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 977 transitions. [2019-10-02 12:04:07,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-02 12:04:07,351 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:07,351 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] [2019-10-02 12:04:07,352 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:07,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:07,352 INFO L82 PathProgramCache]: Analyzing trace with hash 156761498, now seen corresponding path program 1 times [2019-10-02 12:04:07,352 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:07,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:07,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:07,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:07,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:07,488 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 12:04:07,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:07,489 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 12:04:07,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:08,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 3291 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:04:08,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:08,274 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:04:08,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:08,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:04:08,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:04:08,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:04:08,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:04:08,285 INFO L87 Difference]: Start difference. First operand 633 states and 977 transitions. Second operand 8 states. [2019-10-02 12:04:08,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:08,511 INFO L93 Difference]: Finished difference Result 1216 states and 1900 transitions. [2019-10-02 12:04:08,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:04:08,512 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 172 [2019-10-02 12:04:08,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:08,520 INFO L225 Difference]: With dead ends: 1216 [2019-10-02 12:04:08,521 INFO L226 Difference]: Without dead ends: 633 [2019-10-02 12:04:08,525 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 174 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 12:04:08,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-10-02 12:04:08,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 633. [2019-10-02 12:04:08,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2019-10-02 12:04:08,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 976 transitions. [2019-10-02 12:04:08,561 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 976 transitions. Word has length 172 [2019-10-02 12:04:08,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:08,564 INFO L475 AbstractCegarLoop]: Abstraction has 633 states and 976 transitions. [2019-10-02 12:04:08,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:04:08,565 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 976 transitions. [2019-10-02 12:04:08,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-02 12:04:08,569 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:08,570 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] [2019-10-02 12:04:08,570 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:08,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:08,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1153991963, now seen corresponding path program 1 times [2019-10-02 12:04:08,570 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:08,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:08,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:08,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:08,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:08,722 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 12:04:08,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:08,723 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 12:04:08,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:09,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:09,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 3292 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:04:09,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:09,308 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 12:04:09,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:09,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:04:09,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:04:09,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:04:09,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:04:09,315 INFO L87 Difference]: Start difference. First operand 633 states and 976 transitions. Second operand 8 states. [2019-10-02 12:04:09,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:09,493 INFO L93 Difference]: Finished difference Result 1216 states and 1899 transitions. [2019-10-02 12:04:09,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:04:09,494 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 173 [2019-10-02 12:04:09,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:09,499 INFO L225 Difference]: With dead ends: 1216 [2019-10-02 12:04:09,500 INFO L226 Difference]: Without dead ends: 633 [2019-10-02 12:04:09,503 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 175 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 12:04:09,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-10-02 12:04:09,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 633. [2019-10-02 12:04:09,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2019-10-02 12:04:09,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 975 transitions. [2019-10-02 12:04:09,523 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 975 transitions. Word has length 173 [2019-10-02 12:04:09,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:09,523 INFO L475 AbstractCegarLoop]: Abstraction has 633 states and 975 transitions. [2019-10-02 12:04:09,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:04:09,524 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 975 transitions. [2019-10-02 12:04:09,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-02 12:04:09,529 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:09,529 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] [2019-10-02 12:04:09,529 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:09,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:09,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1543315839, now seen corresponding path program 1 times [2019-10-02 12:04:09,530 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:09,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:09,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:09,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:09,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:09,811 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-02 12:04:09,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:09,814 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 12:04:09,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:10,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 3293 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 12:04:10,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:10,525 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:04:10,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:10,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2019-10-02 12:04:10,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 12:04:10,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 12:04:10,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:04:10,538 INFO L87 Difference]: Start difference. First operand 633 states and 975 transitions. Second operand 18 states. [2019-10-02 12:04:11,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:11,133 INFO L93 Difference]: Finished difference Result 1232 states and 1926 transitions. [2019-10-02 12:04:11,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 12:04:11,133 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 174 [2019-10-02 12:04:11,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:11,140 INFO L225 Difference]: With dead ends: 1232 [2019-10-02 12:04:11,140 INFO L226 Difference]: Without dead ends: 648 [2019-10-02 12:04:11,144 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 176 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 12:04:11,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-10-02 12:04:11,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 644. [2019-10-02 12:04:11,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-10-02 12:04:11,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 983 transitions. [2019-10-02 12:04:11,171 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 983 transitions. Word has length 174 [2019-10-02 12:04:11,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:11,172 INFO L475 AbstractCegarLoop]: Abstraction has 644 states and 983 transitions. [2019-10-02 12:04:11,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 12:04:11,172 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 983 transitions. [2019-10-02 12:04:11,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 12:04:11,177 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:11,177 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, 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:04:11,178 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:11,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:11,178 INFO L82 PathProgramCache]: Analyzing trace with hash 624972376, now seen corresponding path program 1 times [2019-10-02 12:04:11,178 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:11,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:11,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:11,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:11,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:11,414 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 12:04:11,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:11,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:04:11,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:04:11,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:04:11,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:04:11,417 INFO L87 Difference]: Start difference. First operand 644 states and 983 transitions. Second operand 9 states. [2019-10-02 12:04:11,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:11,606 INFO L93 Difference]: Finished difference Result 1163 states and 1822 transitions. [2019-10-02 12:04:11,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:04:11,607 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 175 [2019-10-02 12:04:11,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:11,612 INFO L225 Difference]: With dead ends: 1163 [2019-10-02 12:04:11,612 INFO L226 Difference]: Without dead ends: 641 [2019-10-02 12:04:11,615 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:04:11,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2019-10-02 12:04:11,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2019-10-02 12:04:11,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-10-02 12:04:11,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 978 transitions. [2019-10-02 12:04:11,637 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 978 transitions. Word has length 175 [2019-10-02 12:04:11,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:11,638 INFO L475 AbstractCegarLoop]: Abstraction has 641 states and 978 transitions. [2019-10-02 12:04:11,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:04:11,638 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 978 transitions. [2019-10-02 12:04:11,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-02 12:04:11,643 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:11,643 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] [2019-10-02 12:04:11,643 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:11,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:11,644 INFO L82 PathProgramCache]: Analyzing trace with hash 699664653, now seen corresponding path program 1 times [2019-10-02 12:04:11,644 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:11,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:11,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:11,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:11,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:11,820 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:04:11,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:11,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:04:11,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:04:11,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:04:11,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:04:11,824 INFO L87 Difference]: Start difference. First operand 641 states and 978 transitions. Second operand 7 states. [2019-10-02 12:04:11,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:11,938 INFO L93 Difference]: Finished difference Result 1160 states and 1817 transitions. [2019-10-02 12:04:11,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:04:11,939 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 176 [2019-10-02 12:04:11,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:11,945 INFO L225 Difference]: With dead ends: 1160 [2019-10-02 12:04:11,945 INFO L226 Difference]: Without dead ends: 620 [2019-10-02 12:04:11,951 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 12:04:11,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-10-02 12:04:11,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 618. [2019-10-02 12:04:11,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-10-02 12:04:11,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 948 transitions. [2019-10-02 12:04:11,972 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 948 transitions. Word has length 176 [2019-10-02 12:04:11,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:11,973 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 948 transitions. [2019-10-02 12:04:11,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:04:11,973 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 948 transitions. [2019-10-02 12:04:11,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-02 12:04:11,978 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:11,979 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] [2019-10-02 12:04:11,979 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:11,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:11,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1123374031, now seen corresponding path program 1 times [2019-10-02 12:04:11,980 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:11,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:11,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:11,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:11,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:12,222 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 12:04:12,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:12,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 12:04:12,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:04:12,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:04:12,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:04:12,224 INFO L87 Difference]: Start difference. First operand 618 states and 948 transitions. Second operand 13 states. [2019-10-02 12:04:12,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:12,575 INFO L93 Difference]: Finished difference Result 1138 states and 1785 transitions. [2019-10-02 12:04:12,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:04:12,576 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 176 [2019-10-02 12:04:12,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:12,580 INFO L225 Difference]: With dead ends: 1138 [2019-10-02 12:04:12,580 INFO L226 Difference]: Without dead ends: 611 [2019-10-02 12:04:12,585 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 12:04:12,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-02 12:04:12,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-10-02 12:04:12,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-02 12:04:12,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 939 transitions. [2019-10-02 12:04:12,608 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 939 transitions. Word has length 176 [2019-10-02 12:04:12,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:12,610 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 939 transitions. [2019-10-02 12:04:12,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:04:12,611 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 939 transitions. [2019-10-02 12:04:12,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-10-02 12:04:12,615 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:12,615 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] [2019-10-02 12:04:12,615 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:12,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:12,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1912182484, now seen corresponding path program 1 times [2019-10-02 12:04:12,616 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:12,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:12,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:12,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:12,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:12,866 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 12:04:12,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:12,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 12:04:12,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:04:12,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:04:12,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:04:12,867 INFO L87 Difference]: Start difference. First operand 611 states and 939 transitions. Second operand 13 states. [2019-10-02 12:04:13,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:13,203 INFO L93 Difference]: Finished difference Result 1189 states and 1853 transitions. [2019-10-02 12:04:13,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:04:13,204 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 177 [2019-10-02 12:04:13,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:13,209 INFO L225 Difference]: With dead ends: 1189 [2019-10-02 12:04:13,209 INFO L226 Difference]: Without dead ends: 625 [2019-10-02 12:04:13,213 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 12:04:13,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2019-10-02 12:04:13,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 623. [2019-10-02 12:04:13,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-02 12:04:13,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 954 transitions. [2019-10-02 12:04:13,234 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 954 transitions. Word has length 177 [2019-10-02 12:04:13,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:13,234 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 954 transitions. [2019-10-02 12:04:13,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:04:13,235 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 954 transitions. [2019-10-02 12:04:13,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-02 12:04:13,239 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:13,240 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:13,240 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:13,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:13,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1185903340, now seen corresponding path program 1 times [2019-10-02 12:04:13,241 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:13,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:13,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:13,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:13,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:13,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:13,428 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:04:13,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:13,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:04:13,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:04:13,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:04:13,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:04:13,430 INFO L87 Difference]: Start difference. First operand 623 states and 954 transitions. Second operand 11 states. [2019-10-02 12:04:13,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:13,652 INFO L93 Difference]: Finished difference Result 1143 states and 1791 transitions. [2019-10-02 12:04:13,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:04:13,653 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 178 [2019-10-02 12:04:13,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:13,657 INFO L225 Difference]: With dead ends: 1143 [2019-10-02 12:04:13,658 INFO L226 Difference]: Without dead ends: 623 [2019-10-02 12:04:13,661 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:04:13,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-02 12:04:13,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-10-02 12:04:13,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-02 12:04:13,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 953 transitions. [2019-10-02 12:04:13,680 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 953 transitions. Word has length 178 [2019-10-02 12:04:13,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:13,681 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 953 transitions. [2019-10-02 12:04:13,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:04:13,682 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 953 transitions. [2019-10-02 12:04:13,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-02 12:04:13,686 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:13,687 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, 1, 1, 1, 1, 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:04:13,687 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:13,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:13,687 INFO L82 PathProgramCache]: Analyzing trace with hash -645412386, now seen corresponding path program 1 times [2019-10-02 12:04:13,687 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:13,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:13,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:13,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:13,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:13,882 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:04:13,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:13,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:04:13,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:04:13,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:04:13,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:04:13,884 INFO L87 Difference]: Start difference. First operand 623 states and 953 transitions. Second operand 11 states. [2019-10-02 12:04:14,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:14,106 INFO L93 Difference]: Finished difference Result 1189 states and 1844 transitions. [2019-10-02 12:04:14,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:04:14,107 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 179 [2019-10-02 12:04:14,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:14,111 INFO L225 Difference]: With dead ends: 1189 [2019-10-02 12:04:14,111 INFO L226 Difference]: Without dead ends: 620 [2019-10-02 12:04:14,114 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:04:14,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-10-02 12:04:14,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-10-02 12:04:14,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-02 12:04:14,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 945 transitions. [2019-10-02 12:04:14,143 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 945 transitions. Word has length 179 [2019-10-02 12:04:14,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:14,145 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 945 transitions. [2019-10-02 12:04:14,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:04:14,145 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 945 transitions. [2019-10-02 12:04:14,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-02 12:04:14,153 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:14,153 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] [2019-10-02 12:04:14,154 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:14,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:14,154 INFO L82 PathProgramCache]: Analyzing trace with hash 962098353, now seen corresponding path program 1 times [2019-10-02 12:04:14,154 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:14,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:14,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:14,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:14,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:14,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:14,335 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:04:14,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:14,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:04:14,336 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:04:14,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:04:14,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:04:14,338 INFO L87 Difference]: Start difference. First operand 620 states and 945 transitions. Second operand 6 states. [2019-10-02 12:04:18,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:18,182 INFO L93 Difference]: Finished difference Result 1743 states and 2807 transitions. [2019-10-02 12:04:18,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:04:18,183 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 180 [2019-10-02 12:04:18,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:18,192 INFO L225 Difference]: With dead ends: 1743 [2019-10-02 12:04:18,192 INFO L226 Difference]: Without dead ends: 1232 [2019-10-02 12:04:18,196 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:04:18,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-10-02 12:04:18,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1149. [2019-10-02 12:04:18,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1149 states. [2019-10-02 12:04:18,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1805 transitions. [2019-10-02 12:04:18,246 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1805 transitions. Word has length 180 [2019-10-02 12:04:18,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:18,247 INFO L475 AbstractCegarLoop]: Abstraction has 1149 states and 1805 transitions. [2019-10-02 12:04:18,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:04:18,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1805 transitions. [2019-10-02 12:04:18,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-02 12:04:18,252 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:18,252 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] [2019-10-02 12:04:18,252 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:18,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:18,253 INFO L82 PathProgramCache]: Analyzing trace with hash -300726734, now seen corresponding path program 1 times [2019-10-02 12:04:18,253 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:18,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:18,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:18,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:18,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:18,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:18,434 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:04:18,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:18,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:04:18,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:04:18,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:04:18,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:04:18,436 INFO L87 Difference]: Start difference. First operand 1149 states and 1805 transitions. Second operand 6 states. [2019-10-02 12:04:22,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:22,323 INFO L93 Difference]: Finished difference Result 3545 states and 5819 transitions. [2019-10-02 12:04:22,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:04:22,325 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 181 [2019-10-02 12:04:22,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:22,348 INFO L225 Difference]: With dead ends: 3545 [2019-10-02 12:04:22,348 INFO L226 Difference]: Without dead ends: 2506 [2019-10-02 12:04:22,357 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:04:22,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2019-10-02 12:04:22,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2313. [2019-10-02 12:04:22,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2313 states. [2019-10-02 12:04:22,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 3716 transitions. [2019-10-02 12:04:22,488 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 3716 transitions. Word has length 181 [2019-10-02 12:04:22,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:22,488 INFO L475 AbstractCegarLoop]: Abstraction has 2313 states and 3716 transitions. [2019-10-02 12:04:22,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:04:22,488 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 3716 transitions. [2019-10-02 12:04:22,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-02 12:04:22,494 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:22,495 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] [2019-10-02 12:04:22,495 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:22,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:22,495 INFO L82 PathProgramCache]: Analyzing trace with hash -555803691, now seen corresponding path program 1 times [2019-10-02 12:04:22,495 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:22,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:22,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:22,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:22,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:22,656 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:04:22,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:22,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:04:22,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:04:22,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:04:22,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:04:22,658 INFO L87 Difference]: Start difference. First operand 2313 states and 3716 transitions. Second operand 6 states. [2019-10-02 12:04:26,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:26,714 INFO L93 Difference]: Finished difference Result 7636 states and 12779 transitions. [2019-10-02 12:04:26,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:04:26,716 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 182 [2019-10-02 12:04:26,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:26,764 INFO L225 Difference]: With dead ends: 7636 [2019-10-02 12:04:26,764 INFO L226 Difference]: Without dead ends: 5435 [2019-10-02 12:04:26,788 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:04:26,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5435 states. [2019-10-02 12:04:27,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5435 to 4935. [2019-10-02 12:04:27,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4935 states. [2019-10-02 12:04:27,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4935 states to 4935 states and 8085 transitions. [2019-10-02 12:04:27,079 INFO L78 Accepts]: Start accepts. Automaton has 4935 states and 8085 transitions. Word has length 182 [2019-10-02 12:04:27,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:27,080 INFO L475 AbstractCegarLoop]: Abstraction has 4935 states and 8085 transitions. [2019-10-02 12:04:27,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:04:27,080 INFO L276 IsEmpty]: Start isEmpty. Operand 4935 states and 8085 transitions. [2019-10-02 12:04:27,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-02 12:04:27,084 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:27,084 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] [2019-10-02 12:04:27,085 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:27,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:27,085 INFO L82 PathProgramCache]: Analyzing trace with hash 364540310, now seen corresponding path program 1 times [2019-10-02 12:04:27,085 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:27,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:27,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:27,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:27,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:27,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:27,224 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:04:27,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:27,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:04:27,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:04:27,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:04:27,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:04:27,225 INFO L87 Difference]: Start difference. First operand 4935 states and 8085 transitions. Second operand 6 states. [2019-10-02 12:04:31,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:31,849 INFO L93 Difference]: Finished difference Result 17197 states and 29419 transitions. [2019-10-02 12:04:31,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:04:31,850 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 183 [2019-10-02 12:04:31,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:32,026 INFO L225 Difference]: With dead ends: 17197 [2019-10-02 12:04:32,026 INFO L226 Difference]: Without dead ends: 12378 [2019-10-02 12:04:32,098 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:04:32,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12378 states. [2019-10-02 12:04:33,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12378 to 11013. [2019-10-02 12:04:33,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11013 states. [2019-10-02 12:04:34,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11013 states to 11013 states and 18416 transitions. [2019-10-02 12:04:34,091 INFO L78 Accepts]: Start accepts. Automaton has 11013 states and 18416 transitions. Word has length 183 [2019-10-02 12:04:34,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:34,092 INFO L475 AbstractCegarLoop]: Abstraction has 11013 states and 18416 transitions. [2019-10-02 12:04:34,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:04:34,092 INFO L276 IsEmpty]: Start isEmpty. Operand 11013 states and 18416 transitions. [2019-10-02 12:04:34,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-02 12:04:34,099 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:34,099 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] [2019-10-02 12:04:34,100 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:34,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:34,100 INFO L82 PathProgramCache]: Analyzing trace with hash -931771655, now seen corresponding path program 1 times [2019-10-02 12:04:34,103 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:34,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:34,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:34,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:34,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:34,344 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:04:34,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:34,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:04:34,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:04:34,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:04:34,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:04:34,347 INFO L87 Difference]: Start difference. First operand 11013 states and 18416 transitions. Second operand 6 states. [2019-10-02 12:04:39,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:39,289 INFO L93 Difference]: Finished difference Result 40262 states and 70641 transitions. [2019-10-02 12:04:39,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:04:39,290 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 184 [2019-10-02 12:04:39,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:39,528 INFO L225 Difference]: With dead ends: 40262 [2019-10-02 12:04:39,528 INFO L226 Difference]: Without dead ends: 29373 [2019-10-02 12:04:39,618 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:04:39,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29373 states. [2019-10-02 12:04:41,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29373 to 25555. [2019-10-02 12:04:41,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25555 states. [2019-10-02 12:04:41,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25555 states to 25555 states and 43733 transitions. [2019-10-02 12:04:41,740 INFO L78 Accepts]: Start accepts. Automaton has 25555 states and 43733 transitions. Word has length 184 [2019-10-02 12:04:41,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:41,740 INFO L475 AbstractCegarLoop]: Abstraction has 25555 states and 43733 transitions. [2019-10-02 12:04:41,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:04:41,741 INFO L276 IsEmpty]: Start isEmpty. Operand 25555 states and 43733 transitions. [2019-10-02 12:04:41,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-02 12:04:41,745 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:41,745 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] [2019-10-02 12:04:41,745 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:41,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:41,747 INFO L82 PathProgramCache]: Analyzing trace with hash 201418938, now seen corresponding path program 1 times [2019-10-02 12:04:41,747 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:41,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:41,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:41,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:41,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:41,916 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:04:41,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:41,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:04:41,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:04:41,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:04:41,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:04:41,918 INFO L87 Difference]: Start difference. First operand 25555 states and 43733 transitions. Second operand 9 states. [2019-10-02 12:04:50,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:50,638 INFO L93 Difference]: Finished difference Result 82273 states and 141153 transitions. [2019-10-02 12:04:50,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 12:04:50,643 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 184 [2019-10-02 12:04:50,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:50,991 INFO L225 Difference]: With dead ends: 82273 [2019-10-02 12:04:50,991 INFO L226 Difference]: Without dead ends: 56858 [2019-10-02 12:04:51,135 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2019-10-02 12:04:51,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56858 states. [2019-10-02 12:04:53,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56858 to 56039. [2019-10-02 12:04:53,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56039 states. [2019-10-02 12:04:53,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56039 states to 56039 states and 95329 transitions. [2019-10-02 12:04:53,953 INFO L78 Accepts]: Start accepts. Automaton has 56039 states and 95329 transitions. Word has length 184 [2019-10-02 12:04:53,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:53,954 INFO L475 AbstractCegarLoop]: Abstraction has 56039 states and 95329 transitions. [2019-10-02 12:04:53,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:04:53,954 INFO L276 IsEmpty]: Start isEmpty. Operand 56039 states and 95329 transitions. [2019-10-02 12:04:53,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-02 12:04:53,959 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:53,959 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, 1, 1, 1] [2019-10-02 12:04:53,960 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:53,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:53,960 INFO L82 PathProgramCache]: Analyzing trace with hash 923245333, now seen corresponding path program 1 times [2019-10-02 12:04:53,960 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:53,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:53,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:53,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:53,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:54,076 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:04:54,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:54,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:04:54,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:04:54,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:04:54,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:04:54,078 INFO L87 Difference]: Start difference. First operand 56039 states and 95329 transitions. Second operand 5 states. [2019-10-02 12:04:58,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:58,132 INFO L93 Difference]: Finished difference Result 112240 states and 190882 transitions. [2019-10-02 12:04:58,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:04:58,133 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 190 [2019-10-02 12:04:58,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:58,553 INFO L225 Difference]: With dead ends: 112240 [2019-10-02 12:04:58,554 INFO L226 Difference]: Without dead ends: 56341 [2019-10-02 12:04:59,174 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 12:04:59,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56341 states. [2019-10-02 12:05:03,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56341 to 56031. [2019-10-02 12:05:03,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56031 states. [2019-10-02 12:05:04,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56031 states to 56031 states and 95313 transitions. [2019-10-02 12:05:04,186 INFO L78 Accepts]: Start accepts. Automaton has 56031 states and 95313 transitions. Word has length 190 [2019-10-02 12:05:04,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:04,187 INFO L475 AbstractCegarLoop]: Abstraction has 56031 states and 95313 transitions. [2019-10-02 12:05:04,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:05:04,187 INFO L276 IsEmpty]: Start isEmpty. Operand 56031 states and 95313 transitions. [2019-10-02 12:05:04,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-02 12:05:04,193 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:04,194 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, 1, 1, 1] [2019-10-02 12:05:04,194 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:04,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:04,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1715588691, now seen corresponding path program 1 times [2019-10-02 12:05:04,195 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:04,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:04,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:04,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:04,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:04,354 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:05:04,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:05:04,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:05:04,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:05:04,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:05:04,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:05:04,357 INFO L87 Difference]: Start difference. First operand 56031 states and 95313 transitions. Second operand 7 states. [2019-10-02 12:05:07,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:07,306 INFO L93 Difference]: Finished difference Result 113298 states and 192652 transitions. [2019-10-02 12:05:07,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:05:07,307 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 190 [2019-10-02 12:05:07,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:07,611 INFO L225 Difference]: With dead ends: 113298 [2019-10-02 12:05:07,611 INFO L226 Difference]: Without dead ends: 57407 [2019-10-02 12:05:07,763 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:05:07,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57407 states. [2019-10-02 12:05:12,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57407 to 56703. [2019-10-02 12:05:12,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56703 states. [2019-10-02 12:05:12,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56703 states to 56703 states and 96270 transitions. [2019-10-02 12:05:12,918 INFO L78 Accepts]: Start accepts. Automaton has 56703 states and 96270 transitions. Word has length 190 [2019-10-02 12:05:12,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:12,919 INFO L475 AbstractCegarLoop]: Abstraction has 56703 states and 96270 transitions. [2019-10-02 12:05:12,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:05:12,919 INFO L276 IsEmpty]: Start isEmpty. Operand 56703 states and 96270 transitions. [2019-10-02 12:05:12,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-02 12:05:12,924 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:12,924 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, 1, 1] [2019-10-02 12:05:12,924 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:12,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:12,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1287196528, now seen corresponding path program 1 times [2019-10-02 12:05:12,925 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:12,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:12,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:12,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:12,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:13,055 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:05:13,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:05:13,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:05:13,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:05:13,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:05:13,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:05:13,056 INFO L87 Difference]: Start difference. First operand 56703 states and 96270 transitions. Second operand 7 states. [2019-10-02 12:05:15,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:15,764 INFO L93 Difference]: Finished difference Result 114450 states and 194185 transitions. [2019-10-02 12:05:15,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:05:15,765 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 189 [2019-10-02 12:05:15,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:16,065 INFO L225 Difference]: With dead ends: 114450 [2019-10-02 12:05:16,065 INFO L226 Difference]: Without dead ends: 57887 [2019-10-02 12:05:16,210 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:05:16,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57887 states. [2019-10-02 12:05:18,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57887 to 56799. [2019-10-02 12:05:18,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56799 states. [2019-10-02 12:05:19,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56799 states to 56799 states and 96366 transitions. [2019-10-02 12:05:19,051 INFO L78 Accepts]: Start accepts. Automaton has 56799 states and 96366 transitions. Word has length 189 [2019-10-02 12:05:19,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:19,052 INFO L475 AbstractCegarLoop]: Abstraction has 56799 states and 96366 transitions. [2019-10-02 12:05:19,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:05:19,052 INFO L276 IsEmpty]: Start isEmpty. Operand 56799 states and 96366 transitions. [2019-10-02 12:05:19,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-02 12:05:19,058 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:19,058 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:05:19,058 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:19,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:19,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1841226472, now seen corresponding path program 1 times [2019-10-02 12:05:19,059 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:19,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:19,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:19,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:19,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:19,257 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:05:19,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:05:19,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:05:19,258 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:05:19,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:05:19,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:05:19,258 INFO L87 Difference]: Start difference. First operand 56799 states and 96366 transitions. Second operand 8 states. [2019-10-02 12:05:30,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:30,196 INFO L93 Difference]: Finished difference Result 190851 states and 328034 transitions. [2019-10-02 12:05:30,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:05:30,196 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 199 [2019-10-02 12:05:30,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:31,287 INFO L225 Difference]: With dead ends: 190851 [2019-10-02 12:05:31,287 INFO L226 Difference]: Without dead ends: 134192 [2019-10-02 12:05:31,436 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:05:31,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134192 states. [2019-10-02 12:05:37,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134192 to 134062. [2019-10-02 12:05:37,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134062 states. [2019-10-02 12:05:38,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134062 states to 134062 states and 228522 transitions. [2019-10-02 12:05:38,712 INFO L78 Accepts]: Start accepts. Automaton has 134062 states and 228522 transitions. Word has length 199 [2019-10-02 12:05:38,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:38,713 INFO L475 AbstractCegarLoop]: Abstraction has 134062 states and 228522 transitions. [2019-10-02 12:05:38,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:05:38,713 INFO L276 IsEmpty]: Start isEmpty. Operand 134062 states and 228522 transitions. [2019-10-02 12:05:38,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-02 12:05:38,721 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:38,721 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:05:38,722 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:38,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:38,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1234978674, now seen corresponding path program 1 times [2019-10-02 12:05:38,722 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:38,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:38,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:38,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:38,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:38,884 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:05:38,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:05:38,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:05:38,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:05:38,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:05:38,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:05:38,888 INFO L87 Difference]: Start difference. First operand 134062 states and 228522 transitions. Second operand 7 states. [2019-10-02 12:05:49,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:49,504 INFO L93 Difference]: Finished difference Result 268815 states and 463967 transitions. [2019-10-02 12:05:49,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:05:49,504 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 200 [2019-10-02 12:05:49,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:50,335 INFO L225 Difference]: With dead ends: 268815 [2019-10-02 12:05:50,336 INFO L226 Difference]: Without dead ends: 134830 [2019-10-02 12:05:50,725 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 12:05:50,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134830 states. [2019-10-02 12:06:00,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134830 to 134830. [2019-10-02 12:06:00,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134830 states. [2019-10-02 12:06:01,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134830 states to 134830 states and 229226 transitions. [2019-10-02 12:06:01,664 INFO L78 Accepts]: Start accepts. Automaton has 134830 states and 229226 transitions. Word has length 200 [2019-10-02 12:06:01,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:01,665 INFO L475 AbstractCegarLoop]: Abstraction has 134830 states and 229226 transitions. [2019-10-02 12:06:01,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:06:01,665 INFO L276 IsEmpty]: Start isEmpty. Operand 134830 states and 229226 transitions. [2019-10-02 12:06:01,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-02 12:06:01,672 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:01,672 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:01,673 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:01,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:01,673 INFO L82 PathProgramCache]: Analyzing trace with hash 2030120533, now seen corresponding path program 1 times [2019-10-02 12:06:01,673 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:01,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:01,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:01,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:01,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:01,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:01,870 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:06:01,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:06:01,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:06:01,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:06:01,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:06:01,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:06:01,873 INFO L87 Difference]: Start difference. First operand 134830 states and 229226 transitions. Second operand 7 states. [2019-10-02 12:06:19,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:19,495 INFO L93 Difference]: Finished difference Result 251182 states and 427995 transitions. [2019-10-02 12:06:19,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:06:19,496 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 201 [2019-10-02 12:06:19,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:20,238 INFO L225 Difference]: With dead ends: 251182 [2019-10-02 12:06:20,238 INFO L226 Difference]: Without dead ends: 140097 [2019-10-02 12:06:20,533 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:06:20,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140097 states. [2019-10-02 12:06:26,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140097 to 138542. [2019-10-02 12:06:26,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138542 states. [2019-10-02 12:06:27,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138542 states to 138542 states and 234281 transitions. [2019-10-02 12:06:27,710 INFO L78 Accepts]: Start accepts. Automaton has 138542 states and 234281 transitions. Word has length 201 [2019-10-02 12:06:27,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:27,710 INFO L475 AbstractCegarLoop]: Abstraction has 138542 states and 234281 transitions. [2019-10-02 12:06:27,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:06:27,711 INFO L276 IsEmpty]: Start isEmpty. Operand 138542 states and 234281 transitions. [2019-10-02 12:06:27,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-10-02 12:06:27,718 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:27,718 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:27,718 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:27,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:27,719 INFO L82 PathProgramCache]: Analyzing trace with hash 589808930, now seen corresponding path program 1 times [2019-10-02 12:06:27,719 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:27,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:27,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:27,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:27,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:27,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:27,850 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 12:06:27,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:06:27,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:06:27,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:06:27,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:06:27,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:06:27,851 INFO L87 Difference]: Start difference. First operand 138542 states and 234281 transitions. Second operand 6 states. [2019-10-02 12:06:41,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:41,334 INFO L93 Difference]: Finished difference Result 290508 states and 491498 transitions. [2019-10-02 12:06:41,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:06:41,334 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 206 [2019-10-02 12:06:41,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:42,334 INFO L225 Difference]: With dead ends: 290508 [2019-10-02 12:06:42,334 INFO L226 Difference]: Without dead ends: 175711 [2019-10-02 12:06:43,104 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 12:06:43,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175711 states. [2019-10-02 12:06:50,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175711 to 167513. [2019-10-02 12:06:50,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167513 states. [2019-10-02 12:06:51,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167513 states to 167513 states and 283230 transitions. [2019-10-02 12:06:51,798 INFO L78 Accepts]: Start accepts. Automaton has 167513 states and 283230 transitions. Word has length 206 [2019-10-02 12:06:51,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:51,799 INFO L475 AbstractCegarLoop]: Abstraction has 167513 states and 283230 transitions. [2019-10-02 12:06:51,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:06:51,799 INFO L276 IsEmpty]: Start isEmpty. Operand 167513 states and 283230 transitions. [2019-10-02 12:06:51,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-10-02 12:06:51,803 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:51,804 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:51,804 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:51,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:51,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1291408804, now seen corresponding path program 1 times [2019-10-02 12:06:51,804 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:51,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:51,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:51,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:51,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:51,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:51,960 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 12:06:51,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:06:51,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:06:51,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:06:51,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:06:51,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:06:51,961 INFO L87 Difference]: Start difference. First operand 167513 states and 283230 transitions. Second operand 4 states. [2019-10-02 12:07:05,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:05,565 INFO L93 Difference]: Finished difference Result 334244 states and 574566 transitions. [2019-10-02 12:07:05,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:07:05,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2019-10-02 12:07:05,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:07,256 INFO L225 Difference]: With dead ends: 334244 [2019-10-02 12:07:07,256 INFO L226 Difference]: Without dead ends: 166840 [2019-10-02 12:07:07,660 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 12:07:07,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166840 states. [2019-10-02 12:07:21,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166840 to 166840. [2019-10-02 12:07:21,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166840 states. [2019-10-02 12:07:23,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166840 states to 166840 states and 281884 transitions. [2019-10-02 12:07:23,883 INFO L78 Accepts]: Start accepts. Automaton has 166840 states and 281884 transitions. Word has length 206 [2019-10-02 12:07:23,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:23,884 INFO L475 AbstractCegarLoop]: Abstraction has 166840 states and 281884 transitions. [2019-10-02 12:07:23,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:07:23,884 INFO L276 IsEmpty]: Start isEmpty. Operand 166840 states and 281884 transitions. [2019-10-02 12:07:23,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-02 12:07:23,891 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:23,891 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:07:23,892 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:23,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:23,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1378676698, now seen corresponding path program 1 times [2019-10-02 12:07:23,892 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:23,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:23,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:23,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:23,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:24,172 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 12:07:24,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:07:24,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:07:24,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:07:24,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:07:24,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:07:24,174 INFO L87 Difference]: Start difference. First operand 166840 states and 281884 transitions. Second operand 9 states. [2019-10-02 12:07:57,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:57,429 INFO L93 Difference]: Finished difference Result 539465 states and 928453 transitions. [2019-10-02 12:07:57,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:07:57,430 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 207 [2019-10-02 12:07:57,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:59,590 INFO L225 Difference]: With dead ends: 539465 [2019-10-02 12:07:59,590 INFO L226 Difference]: Without dead ends: 372734 [2019-10-02 12:08:01,202 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:08:01,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372734 states. [2019-10-02 12:08:36,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372734 to 354792. [2019-10-02 12:08:36,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354792 states. [2019-10-02 12:08:39,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354792 states to 354792 states and 610908 transitions. [2019-10-02 12:08:39,896 INFO L78 Accepts]: Start accepts. Automaton has 354792 states and 610908 transitions. Word has length 207 [2019-10-02 12:08:39,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:08:39,897 INFO L475 AbstractCegarLoop]: Abstraction has 354792 states and 610908 transitions. [2019-10-02 12:08:39,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:08:39,897 INFO L276 IsEmpty]: Start isEmpty. Operand 354792 states and 610908 transitions. [2019-10-02 12:08:39,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-02 12:08:39,901 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:08:39,902 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:08:39,902 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:08:39,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:08:39,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1982057674, now seen corresponding path program 1 times [2019-10-02 12:08:39,903 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:08:39,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:08:39,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:39,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:39,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:39,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:40,088 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 12:08:40,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:08:40,089 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 12:08:40,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:40,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:40,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 3369 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 12:08:40,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:08:42,021 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:08:42,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:08:42,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2019-10-02 12:08:42,030 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:08:42,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:08:42,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:08:42,031 INFO L87 Difference]: Start difference. First operand 354792 states and 610908 transitions. Second operand 14 states. [2019-10-02 12:09:35,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:09:35,152 INFO L93 Difference]: Finished difference Result 760607 states and 1329185 transitions. [2019-10-02 12:09:35,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 12:09:35,153 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 208 [2019-10-02 12:09:35,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:09:37,879 INFO L225 Difference]: With dead ends: 760607 [2019-10-02 12:09:37,879 INFO L226 Difference]: Without dead ends: 405924 [2019-10-02 12:09:39,745 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2019-10-02 12:09:40,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405924 states. [2019-10-02 12:10:16,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405924 to 385356. [2019-10-02 12:10:16,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385356 states. [2019-10-02 12:10:20,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385356 states to 385356 states and 667048 transitions. [2019-10-02 12:10:21,046 INFO L78 Accepts]: Start accepts. Automaton has 385356 states and 667048 transitions. Word has length 208 [2019-10-02 12:10:21,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:10:21,046 INFO L475 AbstractCegarLoop]: Abstraction has 385356 states and 667048 transitions. [2019-10-02 12:10:21,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:10:21,046 INFO L276 IsEmpty]: Start isEmpty. Operand 385356 states and 667048 transitions. [2019-10-02 12:10:21,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-10-02 12:10:21,051 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:21,052 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:10:21,052 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:21,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:21,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1301140338, now seen corresponding path program 1 times [2019-10-02 12:10:21,053 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:21,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:21,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:21,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:21,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:21,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:21,186 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 12:10:21,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:10:21,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:10:21,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:10:21,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:10:21,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:10:21,188 INFO L87 Difference]: Start difference. First operand 385356 states and 667048 transitions. Second operand 6 states. [2019-10-02 12:10:53,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:53,259 INFO L93 Difference]: Finished difference Result 385922 states and 669437 transitions. [2019-10-02 12:10:53,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:10:53,260 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 215 [2019-10-02 12:10:53,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:56,550 INFO L225 Difference]: With dead ends: 385922 [2019-10-02 12:10:56,550 INFO L226 Difference]: Without dead ends: 385906 [2019-10-02 12:10:56,741 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 12:10:57,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385906 states. [2019-10-02 12:11:32,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385906 to 385461. [2019-10-02 12:11:32,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385461 states. [2019-10-02 12:11:36,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385461 states to 385461 states and 667153 transitions. [2019-10-02 12:11:36,513 INFO L78 Accepts]: Start accepts. Automaton has 385461 states and 667153 transitions. Word has length 215 [2019-10-02 12:11:36,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:11:36,514 INFO L475 AbstractCegarLoop]: Abstraction has 385461 states and 667153 transitions. [2019-10-02 12:11:36,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:11:36,514 INFO L276 IsEmpty]: Start isEmpty. Operand 385461 states and 667153 transitions. [2019-10-02 12:11:36,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-10-02 12:11:36,519 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:11:36,519 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, 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:11:36,519 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:11:36,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:11:36,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1617237261, now seen corresponding path program 1 times [2019-10-02 12:11:36,520 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:11:36,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:11:36,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:36,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:11:36,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:36,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:11:36,658 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 12:11:36,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:11:36,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:11:36,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:11:36,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:11:36,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:11:36,660 INFO L87 Difference]: Start difference. First operand 385461 states and 667153 transitions. Second operand 8 states. [2019-10-02 12:12:07,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:12:07,194 INFO L93 Difference]: Finished difference Result 385547 states and 667276 transitions. [2019-10-02 12:12:07,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:12:07,194 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 221 [2019-10-02 12:12:07,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:12:09,347 INFO L225 Difference]: With dead ends: 385547 [2019-10-02 12:12:09,348 INFO L226 Difference]: Without dead ends: 385531 [2019-10-02 12:12:09,545 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 12:12:09,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385531 states. [2019-10-02 12:12:45,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385531 to 385461. [2019-10-02 12:12:45,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385461 states. [2019-10-02 12:12:50,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385461 states to 385461 states and 666763 transitions. [2019-10-02 12:12:50,051 INFO L78 Accepts]: Start accepts. Automaton has 385461 states and 666763 transitions. Word has length 221 [2019-10-02 12:12:50,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:12:50,051 INFO L475 AbstractCegarLoop]: Abstraction has 385461 states and 666763 transitions. [2019-10-02 12:12:50,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:12:50,051 INFO L276 IsEmpty]: Start isEmpty. Operand 385461 states and 666763 transitions. [2019-10-02 12:12:50,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-10-02 12:12:50,061 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:12:50,061 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:50,062 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:12:50,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:12:50,062 INFO L82 PathProgramCache]: Analyzing trace with hash 2040394586, now seen corresponding path program 1 times [2019-10-02 12:12:50,062 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:12:50,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:12:50,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:12:50,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:12:50,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:12:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:12:50,276 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:12:50,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:12:50,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:12:50,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:12:50,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:12:50,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:12:50,278 INFO L87 Difference]: Start difference. First operand 385461 states and 666763 transitions. Second operand 9 states. [2019-10-02 12:13:30,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:30,994 INFO L93 Difference]: Finished difference Result 771063 states and 1335509 transitions. [2019-10-02 12:13:30,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:13:30,995 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 240 [2019-10-02 12:13:30,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:34,298 INFO L225 Difference]: With dead ends: 771063 [2019-10-02 12:13:34,298 INFO L226 Difference]: Without dead ends: 385851 [2019-10-02 12:13:36,394 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 12:13:36,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385851 states.