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_spec3_product31.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:33:57,893 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:33:57,897 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:33:57,915 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:33:57,916 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:33:57,917 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:33:57,920 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:33:57,931 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:33:57,936 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:33:57,937 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:33:57,938 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:33:57,940 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:33:57,940 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:33:57,941 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:33:57,944 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:33:57,946 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:33:57,946 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:33:57,947 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:33:57,949 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:33:57,953 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:33:57,955 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:33:57,958 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:33:57,959 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:33:57,963 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:33:57,965 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:33:57,965 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:33:57,965 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:33:57,968 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:33:57,969 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:33:57,972 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:33:57,972 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:33:57,973 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:33:57,974 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:33:57,975 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:33:57,978 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:33:57,979 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:33:57,979 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:33:57,979 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:33:57,980 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:33:57,981 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:33:57,982 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:33:57,983 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:33:58,006 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:33:58,007 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:33:58,009 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:33:58,009 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:33:58,009 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:33:58,010 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:33:58,010 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:33:58,010 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:33:58,010 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:33:58,010 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:33:58,012 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:33:58,012 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:33:58,012 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:33:58,013 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:33:58,013 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:33:58,013 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:33:58,013 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:33:58,013 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:33:58,014 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:33:58,014 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:33:58,014 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:33:58,014 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:33:58,015 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:33:58,015 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:33:58,015 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:33:58,015 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:33:58,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:33:58,016 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:33:58,016 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:33:58,064 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:33:58,076 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:33:58,080 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:33:58,081 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:33:58,082 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:33:58,082 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec3_product31.cil.c [2019-10-02 12:33:58,144 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80eacc639/f6bbb24a5d014726bf3d84de9c10a4a1/FLAG840e063ed [2019-10-02 12:33:58,755 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:33:58,755 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec3_product31.cil.c [2019-10-02 12:33:58,777 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80eacc639/f6bbb24a5d014726bf3d84de9c10a4a1/FLAG840e063ed [2019-10-02 12:33:58,979 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80eacc639/f6bbb24a5d014726bf3d84de9c10a4a1 [2019-10-02 12:33:58,988 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:33:58,990 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:33:58,991 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:33:58,991 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:33:58,994 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:33:58,994 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:33:58" (1/1) ... [2019-10-02 12:33:58,997 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a5d2151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:33:58, skipping insertion in model container [2019-10-02 12:33:58,997 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:33:58" (1/1) ... [2019-10-02 12:33:59,004 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:33:59,091 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:33:59,822 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:33:59,845 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:33:59,952 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:34:00,021 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:34:00,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:34:00 WrapperNode [2019-10-02 12:34:00,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:34:00,023 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:34:00,023 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:34:00,023 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:34:00,033 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:34:00" (1/1) ... [2019-10-02 12:34:00,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:34:00" (1/1) ... [2019-10-02 12:34:00,070 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:34:00" (1/1) ... [2019-10-02 12:34:00,070 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:34:00" (1/1) ... [2019-10-02 12:34:00,138 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:34:00" (1/1) ... [2019-10-02 12:34:00,170 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:34:00" (1/1) ... [2019-10-02 12:34:00,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:34:00" (1/1) ... [2019-10-02 12:34:00,199 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:34:00,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:34:00,200 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:34:00,200 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:34:00,201 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:34:00" (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:34:00,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:34:00,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:34:00,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:34:00,289 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:34:00,290 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:34:00,290 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:34:00,290 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:34:00,290 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:34:00,291 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__1 [2019-10-02 12:34:00,291 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__2 [2019-10-02 12:34:00,291 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:34:00,291 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:34:00,292 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:34:00,292 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:34:00,293 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:34:00,293 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:34:00,295 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 12:34:00,295 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 12:34:00,295 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:34:00,296 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 12:34:00,296 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 12:34:00,296 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 12:34:00,296 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 12:34:00,297 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 12:34:00,297 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 12:34:00,297 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 12:34:00,297 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 12:34:00,297 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 12:34:00,297 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 12:34:00,298 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 12:34:00,298 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 12:34:00,298 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 12:34:00,298 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 12:34:00,298 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-02 12:34:00,298 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 12:34:00,299 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 12:34:00,299 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-02 12:34:00,299 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 12:34:00,299 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 12:34:00,299 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 12:34:00,299 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 12:34:00,300 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 12:34:00,300 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 12:34:00,300 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 12:34:00,301 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 12:34:00,301 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 12:34:00,301 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 12:34:00,301 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-02 12:34:00,301 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-02 12:34:00,301 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 12:34:00,302 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 12:34:00,302 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 12:34:00,302 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-02 12:34:00,302 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-02 12:34:00,302 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 12:34:00,303 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 12:34:00,303 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 12:34:00,303 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 12:34:00,303 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 12:34:00,303 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 12:34:00,303 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-02 12:34:00,304 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-02 12:34:00,304 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 12:34:00,304 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 12:34:00,304 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 12:34:00,304 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 12:34:00,305 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 12:34:00,305 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 12:34:00,305 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 12:34:00,306 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 12:34:00,306 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 12:34:00,306 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 12:34:00,306 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 12:34:00,306 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 12:34:00,307 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 12:34:00,307 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 12:34:00,307 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:34:00,308 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 12:34:00,308 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:34:00,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:34:00,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:34:00,308 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:34:00,309 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:34:00,309 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:34:00,309 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:34:00,309 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:34:00,310 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 12:34:00,310 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 12:34:00,311 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 12:34:00,311 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__1 [2019-10-02 12:34:00,311 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__2 [2019-10-02 12:34:00,312 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:34:00,312 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:34:00,312 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:34:00,312 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:34:00,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:34:00,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:34:00,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:34:00,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:34:00,313 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:34:00,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:34:00,313 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:34:00,314 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:34:00,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:34:00,314 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:34:00,314 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:34:00,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:34:00,314 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:34:00,314 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 12:34:00,315 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 12:34:00,315 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 12:34:00,315 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 12:34:00,315 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 12:34:00,315 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 12:34:00,316 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 12:34:00,316 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 12:34:00,316 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 12:34:00,316 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 12:34:00,316 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 12:34:00,317 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 12:34:00,317 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:34:00,317 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 12:34:00,317 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 12:34:00,318 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 12:34:00,319 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 12:34:00,319 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 12:34:00,319 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 12:34:00,319 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 12:34:00,319 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 12:34:00,319 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 12:34:00,320 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:34:00,320 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 12:34:00,323 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 12:34:00,323 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 12:34:00,323 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 12:34:00,324 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 12:34:00,324 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-02 12:34:00,324 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-02 12:34:00,324 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-02 12:34:00,325 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 12:34:00,328 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-02 12:34:00,328 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 12:34:00,329 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 12:34:00,329 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 12:34:00,335 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 12:34:00,335 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-02 12:34:00,335 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-02 12:34:00,335 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 12:34:00,336 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 12:34:00,336 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-02 12:34:00,336 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-02 12:34:00,336 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 12:34:00,336 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 12:34:00,336 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 12:34:00,336 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 12:34:00,337 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 12:34:00,337 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 12:34:00,337 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 12:34:00,337 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 12:34:00,337 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 12:34:00,337 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 12:34:00,338 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 12:34:00,338 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 12:34:00,338 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 12:34:00,338 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 12:34:00,338 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 12:34:00,338 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 12:34:00,338 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:34:00,338 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 12:34:00,339 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:34:00,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:34:00,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:34:00,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:34:02,789 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:34:02,789 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 12:34:02,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:34:02 BoogieIcfgContainer [2019-10-02 12:34:02,791 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:34:02,793 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:34:02,793 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:34:02,796 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:34:02,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:33:58" (1/3) ... [2019-10-02 12:34:02,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a43a8ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:34:02, skipping insertion in model container [2019-10-02 12:34:02,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:34:00" (2/3) ... [2019-10-02 12:34:02,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a43a8ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:34:02, skipping insertion in model container [2019-10-02 12:34:02,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:34:02" (3/3) ... [2019-10-02 12:34:02,801 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product31.cil.c [2019-10-02 12:34:02,811 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:34:02,822 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:34:02,839 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:34:02,883 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:34:02,884 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:34:02,884 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:34:02,884 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:34:02,885 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:34:02,885 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:34:02,885 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:34:02,885 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:34:02,885 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:34:02,930 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states. [2019-10-02 12:34:02,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-02 12:34:02,963 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:34:02,964 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-10-02 12:34:02,966 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:34:02,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:34:02,971 INFO L82 PathProgramCache]: Analyzing trace with hash -734738765, now seen corresponding path program 1 times [2019-10-02 12:34:02,973 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:34:02,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:34:03,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:03,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:34:03,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:03,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:34:03,801 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:34:03,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:34:03,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:34:03,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:34:03,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:34:03,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:34:03,826 INFO L87 Difference]: Start difference. First operand 837 states. Second operand 7 states. [2019-10-02 12:34:04,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:34:04,072 INFO L93 Difference]: Finished difference Result 1353 states and 2166 transitions. [2019-10-02 12:34:04,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:34:04,074 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 141 [2019-10-02 12:34:04,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:34:04,098 INFO L225 Difference]: With dead ends: 1353 [2019-10-02 12:34:04,099 INFO L226 Difference]: Without dead ends: 685 [2019-10-02 12:34:04,110 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:34:04,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2019-10-02 12:34:04,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 683. [2019-10-02 12:34:04,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683 states. [2019-10-02 12:34:04,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 1078 transitions. [2019-10-02 12:34:04,218 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 1078 transitions. Word has length 141 [2019-10-02 12:34:04,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:34:04,219 INFO L475 AbstractCegarLoop]: Abstraction has 683 states and 1078 transitions. [2019-10-02 12:34:04,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:34:04,219 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 1078 transitions. [2019-10-02 12:34:04,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-02 12:34:04,227 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:34:04,227 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:34:04,227 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:34:04,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:34:04,228 INFO L82 PathProgramCache]: Analyzing trace with hash -843585886, now seen corresponding path program 1 times [2019-10-02 12:34:04,228 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:34:04,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:34:04,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:04,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:34:04,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:34:04,454 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:34:04,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:34:04,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:34:04,465 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:34:04,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:34:04,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:34:04,466 INFO L87 Difference]: Start difference. First operand 683 states and 1078 transitions. Second operand 4 states. [2019-10-02 12:34:04,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:34:04,579 INFO L93 Difference]: Finished difference Result 1332 states and 2121 transitions. [2019-10-02 12:34:04,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:34:04,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-10-02 12:34:04,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:34:04,589 INFO L225 Difference]: With dead ends: 1332 [2019-10-02 12:34:04,589 INFO L226 Difference]: Without dead ends: 665 [2019-10-02 12:34:04,593 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:34:04,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2019-10-02 12:34:04,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 665. [2019-10-02 12:34:04,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2019-10-02 12:34:04,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 1045 transitions. [2019-10-02 12:34:04,653 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 1045 transitions. Word has length 142 [2019-10-02 12:34:04,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:34:04,658 INFO L475 AbstractCegarLoop]: Abstraction has 665 states and 1045 transitions. [2019-10-02 12:34:04,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:34:04,658 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 1045 transitions. [2019-10-02 12:34:04,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-02 12:34:04,671 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:34:04,671 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:34:04,672 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:34:04,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:34:04,672 INFO L82 PathProgramCache]: Analyzing trace with hash -71062830, now seen corresponding path program 1 times [2019-10-02 12:34:04,672 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:34:04,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:34:04,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:04,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:34:04,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:34:05,000 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:34:05,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:34:05,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:34:05,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:34:05,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:34:05,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:34:05,002 INFO L87 Difference]: Start difference. First operand 665 states and 1045 transitions. Second operand 7 states. [2019-10-02 12:34:05,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:34:05,139 INFO L93 Difference]: Finished difference Result 1301 states and 2063 transitions. [2019-10-02 12:34:05,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:34:05,140 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 142 [2019-10-02 12:34:05,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:34:05,146 INFO L225 Difference]: With dead ends: 1301 [2019-10-02 12:34:05,147 INFO L226 Difference]: Without dead ends: 659 [2019-10-02 12:34:05,150 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:34:05,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-10-02 12:34:05,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2019-10-02 12:34:05,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-10-02 12:34:05,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 1032 transitions. [2019-10-02 12:34:05,182 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 1032 transitions. Word has length 142 [2019-10-02 12:34:05,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:34:05,183 INFO L475 AbstractCegarLoop]: Abstraction has 659 states and 1032 transitions. [2019-10-02 12:34:05,183 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:34:05,183 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 1032 transitions. [2019-10-02 12:34:05,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-02 12:34:05,187 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:34:05,187 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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:34:05,188 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:34:05,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:34:05,188 INFO L82 PathProgramCache]: Analyzing trace with hash 406921655, now seen corresponding path program 1 times [2019-10-02 12:34:05,188 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:34:05,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:34:05,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:05,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:34:05,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:05,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:34:05,363 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:34:05,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:34:05,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:34:05,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:34:05,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:34:05,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:34:05,365 INFO L87 Difference]: Start difference. First operand 659 states and 1032 transitions. Second operand 7 states. [2019-10-02 12:34:05,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:34:05,471 INFO L93 Difference]: Finished difference Result 1289 states and 2037 transitions. [2019-10-02 12:34:05,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:34:05,472 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-10-02 12:34:05,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:34:05,480 INFO L225 Difference]: With dead ends: 1289 [2019-10-02 12:34:05,481 INFO L226 Difference]: Without dead ends: 653 [2019-10-02 12:34:05,486 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:34:05,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2019-10-02 12:34:05,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 653. [2019-10-02 12:34:05,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2019-10-02 12:34:05,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 1019 transitions. [2019-10-02 12:34:05,516 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 1019 transitions. Word has length 143 [2019-10-02 12:34:05,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:34:05,516 INFO L475 AbstractCegarLoop]: Abstraction has 653 states and 1019 transitions. [2019-10-02 12:34:05,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:34:05,517 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 1019 transitions. [2019-10-02 12:34:05,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-02 12:34:05,522 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:34:05,522 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:34:05,522 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:34:05,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:34:05,523 INFO L82 PathProgramCache]: Analyzing trace with hash -576561514, now seen corresponding path program 1 times [2019-10-02 12:34:05,523 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:34:05,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:34:05,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:05,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:34:05,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:34:05,688 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:34:05,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:34:05,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:34:05,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:34:05,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:34:05,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:34:05,690 INFO L87 Difference]: Start difference. First operand 653 states and 1019 transitions. Second operand 7 states. [2019-10-02 12:34:05,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:34:05,798 INFO L93 Difference]: Finished difference Result 1277 states and 2011 transitions. [2019-10-02 12:34:05,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:34:05,799 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 144 [2019-10-02 12:34:05,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:34:05,814 INFO L225 Difference]: With dead ends: 1277 [2019-10-02 12:34:05,814 INFO L226 Difference]: Without dead ends: 647 [2019-10-02 12:34:05,822 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:34:05,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-10-02 12:34:05,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2019-10-02 12:34:05,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-10-02 12:34:05,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 1006 transitions. [2019-10-02 12:34:05,856 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 1006 transitions. Word has length 144 [2019-10-02 12:34:05,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:34:05,857 INFO L475 AbstractCegarLoop]: Abstraction has 647 states and 1006 transitions. [2019-10-02 12:34:05,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:34:05,857 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1006 transitions. [2019-10-02 12:34:05,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-02 12:34:05,862 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:34:05,862 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:34:05,862 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:34:05,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:34:05,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1815508329, now seen corresponding path program 1 times [2019-10-02 12:34:05,863 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:34:05,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:34:05,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:05,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:34:05,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:34:06,162 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:34:06,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:34:06,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:34:06,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:34:06,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:34:06,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:34:06,166 INFO L87 Difference]: Start difference. First operand 647 states and 1006 transitions. Second operand 7 states. [2019-10-02 12:34:06,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:34:06,248 INFO L93 Difference]: Finished difference Result 1265 states and 1985 transitions. [2019-10-02 12:34:06,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:34:06,249 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 144 [2019-10-02 12:34:06,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:34:06,259 INFO L225 Difference]: With dead ends: 1265 [2019-10-02 12:34:06,259 INFO L226 Difference]: Without dead ends: 647 [2019-10-02 12:34:06,263 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:34:06,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-10-02 12:34:06,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2019-10-02 12:34:06,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-10-02 12:34:06,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 1005 transitions. [2019-10-02 12:34:06,292 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 1005 transitions. Word has length 144 [2019-10-02 12:34:06,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:34:06,292 INFO L475 AbstractCegarLoop]: Abstraction has 647 states and 1005 transitions. [2019-10-02 12:34:06,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:34:06,293 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1005 transitions. [2019-10-02 12:34:06,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-02 12:34:06,297 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:34:06,297 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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:34:06,298 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:34:06,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:34:06,298 INFO L82 PathProgramCache]: Analyzing trace with hash 379098299, now seen corresponding path program 1 times [2019-10-02 12:34:06,298 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:34:06,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:34:06,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:06,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:34:06,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:06,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:34:06,456 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:34:06,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:34:06,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:34:06,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:34:06,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:34:06,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:34:06,458 INFO L87 Difference]: Start difference. First operand 647 states and 1005 transitions. Second operand 5 states. [2019-10-02 12:34:06,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:34:06,537 INFO L93 Difference]: Finished difference Result 1264 states and 1982 transitions. [2019-10-02 12:34:06,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:34:06,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2019-10-02 12:34:06,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:34:06,542 INFO L225 Difference]: With dead ends: 1264 [2019-10-02 12:34:06,542 INFO L226 Difference]: Without dead ends: 647 [2019-10-02 12:34:06,545 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:34:06,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-10-02 12:34:06,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2019-10-02 12:34:06,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-10-02 12:34:06,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 1004 transitions. [2019-10-02 12:34:06,567 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 1004 transitions. Word has length 145 [2019-10-02 12:34:06,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:34:06,568 INFO L475 AbstractCegarLoop]: Abstraction has 647 states and 1004 transitions. [2019-10-02 12:34:06,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:34:06,568 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1004 transitions. [2019-10-02 12:34:06,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-02 12:34:06,573 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:34:06,573 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:34:06,574 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:34:06,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:34:06,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1077265188, now seen corresponding path program 1 times [2019-10-02 12:34:06,574 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:34:06,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:34:06,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:06,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:34:06,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:34:06,736 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:34:06,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:34:06,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:34:06,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:34:06,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:34:06,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:34:06,738 INFO L87 Difference]: Start difference. First operand 647 states and 1004 transitions. Second operand 5 states. [2019-10-02 12:34:06,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:34:06,833 INFO L93 Difference]: Finished difference Result 1264 states and 1980 transitions. [2019-10-02 12:34:06,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:34:06,833 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 146 [2019-10-02 12:34:06,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:34:06,840 INFO L225 Difference]: With dead ends: 1264 [2019-10-02 12:34:06,840 INFO L226 Difference]: Without dead ends: 647 [2019-10-02 12:34:06,844 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:34:06,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-10-02 12:34:06,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2019-10-02 12:34:06,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-10-02 12:34:06,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 1003 transitions. [2019-10-02 12:34:06,876 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 1003 transitions. Word has length 146 [2019-10-02 12:34:06,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:34:06,876 INFO L475 AbstractCegarLoop]: Abstraction has 647 states and 1003 transitions. [2019-10-02 12:34:06,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:34:06,876 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1003 transitions. [2019-10-02 12:34:06,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-02 12:34:06,880 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:34:06,881 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-10-02 12:34:06,881 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:34:06,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:34:06,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1621721034, now seen corresponding path program 1 times [2019-10-02 12:34:06,881 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:34:06,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:34:06,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:06,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:34:06,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:06,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:34:07,069 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:34:07,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:34:07,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:34:07,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:34:07,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:34:07,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:34:07,071 INFO L87 Difference]: Start difference. First operand 647 states and 1003 transitions. Second operand 5 states. [2019-10-02 12:34:07,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:34:07,148 INFO L93 Difference]: Finished difference Result 1264 states and 1978 transitions. [2019-10-02 12:34:07,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:34:07,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-10-02 12:34:07,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:34:07,153 INFO L225 Difference]: With dead ends: 1264 [2019-10-02 12:34:07,153 INFO L226 Difference]: Without dead ends: 647 [2019-10-02 12:34:07,157 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:34:07,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-10-02 12:34:07,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2019-10-02 12:34:07,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-10-02 12:34:07,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 1002 transitions. [2019-10-02 12:34:07,177 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 1002 transitions. Word has length 147 [2019-10-02 12:34:07,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:34:07,178 INFO L475 AbstractCegarLoop]: Abstraction has 647 states and 1002 transitions. [2019-10-02 12:34:07,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:34:07,178 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1002 transitions. [2019-10-02 12:34:07,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-02 12:34:07,182 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:34:07,182 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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:34:07,182 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:34:07,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:34:07,183 INFO L82 PathProgramCache]: Analyzing trace with hash 333156215, now seen corresponding path program 1 times [2019-10-02 12:34:07,183 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:34:07,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:34:07,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:07,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:34:07,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:34:07,382 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:34:07,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:34:07,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:34:07,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:34:07,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:34:07,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:34:07,385 INFO L87 Difference]: Start difference. First operand 647 states and 1002 transitions. Second operand 5 states. [2019-10-02 12:34:07,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:34:07,465 INFO L93 Difference]: Finished difference Result 1264 states and 1976 transitions. [2019-10-02 12:34:07,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:34:07,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-10-02 12:34:07,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:34:07,473 INFO L225 Difference]: With dead ends: 1264 [2019-10-02 12:34:07,473 INFO L226 Difference]: Without dead ends: 647 [2019-10-02 12:34:07,478 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:34:07,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-10-02 12:34:07,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2019-10-02 12:34:07,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2019-10-02 12:34:07,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 1001 transitions. [2019-10-02 12:34:07,503 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 1001 transitions. Word has length 148 [2019-10-02 12:34:07,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:34:07,504 INFO L475 AbstractCegarLoop]: Abstraction has 647 states and 1001 transitions. [2019-10-02 12:34:07,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:34:07,504 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 1001 transitions. [2019-10-02 12:34:07,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-02 12:34:07,510 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:34:07,510 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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:34:07,511 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:34:07,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:34:07,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1837019215, now seen corresponding path program 1 times [2019-10-02 12:34:07,511 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:34:07,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:34:07,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:07,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:34:07,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:07,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:34:07,743 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 12:34:07,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:34:07,743 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:34:07,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:34:08,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:34:08,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 3067 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 12:34:08,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:34:08,465 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:34:08,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:34:08,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-10-02 12:34:08,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:34:08,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:34:08,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:34:08,485 INFO L87 Difference]: Start difference. First operand 647 states and 1001 transitions. Second operand 12 states. [2019-10-02 12:34:14,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:34:14,806 INFO L93 Difference]: Finished difference Result 3645 states and 5844 transitions. [2019-10-02 12:34:14,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 12:34:14,806 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 149 [2019-10-02 12:34:14,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:34:14,830 INFO L225 Difference]: With dead ends: 3645 [2019-10-02 12:34:14,831 INFO L226 Difference]: Without dead ends: 3032 [2019-10-02 12:34:14,838 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=844, Unknown=0, NotChecked=0, Total=992 [2019-10-02 12:34:14,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3032 states. [2019-10-02 12:34:15,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3032 to 2898. [2019-10-02 12:34:15,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2898 states. [2019-10-02 12:34:15,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 4583 transitions. [2019-10-02 12:34:15,028 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 4583 transitions. Word has length 149 [2019-10-02 12:34:15,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:34:15,030 INFO L475 AbstractCegarLoop]: Abstraction has 2898 states and 4583 transitions. [2019-10-02 12:34:15,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:34:15,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 4583 transitions. [2019-10-02 12:34:15,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-02 12:34:15,037 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:34:15,037 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-10-02 12:34:15,037 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:34:15,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:34:15,038 INFO L82 PathProgramCache]: Analyzing trace with hash 392378366, now seen corresponding path program 1 times [2019-10-02 12:34:15,038 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:34:15,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:34:15,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:15,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:34:15,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:15,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:34:15,214 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:34:15,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:34:15,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:34:15,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:34:15,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:34:15,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:34:15,217 INFO L87 Difference]: Start difference. First operand 2898 states and 4583 transitions. Second operand 7 states. [2019-10-02 12:34:18,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:34:18,248 INFO L93 Difference]: Finished difference Result 8580 states and 13922 transitions. [2019-10-02 12:34:18,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:34:18,248 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 153 [2019-10-02 12:34:18,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:34:18,293 INFO L225 Difference]: With dead ends: 8580 [2019-10-02 12:34:18,294 INFO L226 Difference]: Without dead ends: 5716 [2019-10-02 12:34:18,316 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:34:18,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5716 states. [2019-10-02 12:34:18,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5716 to 5620. [2019-10-02 12:34:18,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5620 states. [2019-10-02 12:34:18,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5620 states to 5620 states and 8967 transitions. [2019-10-02 12:34:18,645 INFO L78 Accepts]: Start accepts. Automaton has 5620 states and 8967 transitions. Word has length 153 [2019-10-02 12:34:18,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:34:18,646 INFO L475 AbstractCegarLoop]: Abstraction has 5620 states and 8967 transitions. [2019-10-02 12:34:18,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:34:18,646 INFO L276 IsEmpty]: Start isEmpty. Operand 5620 states and 8967 transitions. [2019-10-02 12:34:18,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-02 12:34:18,653 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:34:18,653 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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:34:18,654 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:34:18,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:34:18,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1167003307, now seen corresponding path program 1 times [2019-10-02 12:34:18,654 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:34:18,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:34:18,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:18,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:34:18,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:18,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:34:18,902 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 12:34:18,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:34:18,903 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:34:19,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:34:19,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:34:19,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 3066 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 12:34:19,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:34:19,689 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:34:19,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:34:19,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-10-02 12:34:19,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:34:19,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:34:19,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:34:19,711 INFO L87 Difference]: Start difference. First operand 5620 states and 8967 transitions. Second operand 9 states. [2019-10-02 12:34:24,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:34:24,043 INFO L93 Difference]: Finished difference Result 20122 states and 32565 transitions. [2019-10-02 12:34:24,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 12:34:24,043 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 150 [2019-10-02 12:34:24,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:34:24,176 INFO L225 Difference]: With dead ends: 20122 [2019-10-02 12:34:24,177 INFO L226 Difference]: Without dead ends: 14536 [2019-10-02 12:34:24,227 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2019-10-02 12:34:24,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14536 states. [2019-10-02 12:34:24,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14536 to 9760. [2019-10-02 12:34:24,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9760 states. [2019-10-02 12:34:25,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9760 states to 9760 states and 15378 transitions. [2019-10-02 12:34:25,567 INFO L78 Accepts]: Start accepts. Automaton has 9760 states and 15378 transitions. Word has length 150 [2019-10-02 12:34:25,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:34:25,568 INFO L475 AbstractCegarLoop]: Abstraction has 9760 states and 15378 transitions. [2019-10-02 12:34:25,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:34:25,568 INFO L276 IsEmpty]: Start isEmpty. Operand 9760 states and 15378 transitions. [2019-10-02 12:34:25,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-02 12:34:25,575 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:34:25,575 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-10-02 12:34:25,576 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:34:25,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:34:25,577 INFO L82 PathProgramCache]: Analyzing trace with hash 672411, now seen corresponding path program 1 times [2019-10-02 12:34:25,577 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:34:25,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:34:25,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:25,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:34:25,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:25,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:34:25,755 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:34:25,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:34:25,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:34:25,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:34:25,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:34:25,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:34:25,758 INFO L87 Difference]: Start difference. First operand 9760 states and 15378 transitions. Second operand 4 states. [2019-10-02 12:34:26,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:34:26,145 INFO L93 Difference]: Finished difference Result 19055 states and 30349 transitions. [2019-10-02 12:34:26,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:34:26,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-10-02 12:34:26,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:34:26,224 INFO L225 Difference]: With dead ends: 19055 [2019-10-02 12:34:26,225 INFO L226 Difference]: Without dead ends: 9317 [2019-10-02 12:34:26,282 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:34:26,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9317 states. [2019-10-02 12:34:26,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9317 to 9259. [2019-10-02 12:34:26,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9259 states. [2019-10-02 12:34:26,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9259 states to 9259 states and 14570 transitions. [2019-10-02 12:34:26,721 INFO L78 Accepts]: Start accepts. Automaton has 9259 states and 14570 transitions. Word has length 153 [2019-10-02 12:34:26,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:34:26,722 INFO L475 AbstractCegarLoop]: Abstraction has 9259 states and 14570 transitions. [2019-10-02 12:34:26,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:34:26,722 INFO L276 IsEmpty]: Start isEmpty. Operand 9259 states and 14570 transitions. [2019-10-02 12:34:26,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-02 12:34:26,729 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:34:26,730 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:34:26,730 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:34:26,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:34:26,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1409498317, now seen corresponding path program 1 times [2019-10-02 12:34:26,731 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:34:26,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:34:26,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:26,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:34:26,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:26,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:34:26,942 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 12:34:26,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:34:26,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:34:26,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:34:26,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:34:26,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:34:26,946 INFO L87 Difference]: Start difference. First operand 9259 states and 14570 transitions. Second operand 7 states. [2019-10-02 12:34:30,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:34:30,085 INFO L93 Difference]: Finished difference Result 27658 states and 44655 transitions. [2019-10-02 12:34:30,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:34:30,085 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 161 [2019-10-02 12:34:30,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:34:30,222 INFO L225 Difference]: With dead ends: 27658 [2019-10-02 12:34:30,222 INFO L226 Difference]: Without dead ends: 18433 [2019-10-02 12:34:30,274 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:34:30,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18433 states. [2019-10-02 12:34:31,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18433 to 18301. [2019-10-02 12:34:31,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18301 states. [2019-10-02 12:34:31,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18301 states to 18301 states and 29161 transitions. [2019-10-02 12:34:31,244 INFO L78 Accepts]: Start accepts. Automaton has 18301 states and 29161 transitions. Word has length 161 [2019-10-02 12:34:31,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:34:31,245 INFO L475 AbstractCegarLoop]: Abstraction has 18301 states and 29161 transitions. [2019-10-02 12:34:31,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:34:31,245 INFO L276 IsEmpty]: Start isEmpty. Operand 18301 states and 29161 transitions. [2019-10-02 12:34:31,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-02 12:34:31,249 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:34:31,250 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:34:31,250 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:34:31,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:34:31,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1208852276, now seen corresponding path program 1 times [2019-10-02 12:34:31,250 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:34:31,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:34:31,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:31,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:34:31,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:34:31,400 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 12:34:31,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:34:31,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:34:31,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:34:31,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:34:31,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:34:31,402 INFO L87 Difference]: Start difference. First operand 18301 states and 29161 transitions. Second operand 4 states. [2019-10-02 12:34:32,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:34:32,190 INFO L93 Difference]: Finished difference Result 36189 states and 58382 transitions. [2019-10-02 12:34:32,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:34:32,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-10-02 12:34:32,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:34:32,328 INFO L225 Difference]: With dead ends: 36189 [2019-10-02 12:34:32,329 INFO L226 Difference]: Without dead ends: 17910 [2019-10-02 12:34:32,424 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:34:32,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17910 states. [2019-10-02 12:34:33,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17910 to 17826. [2019-10-02 12:34:33,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17826 states. [2019-10-02 12:34:34,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17826 states to 17826 states and 28360 transitions. [2019-10-02 12:34:34,058 INFO L78 Accepts]: Start accepts. Automaton has 17826 states and 28360 transitions. Word has length 162 [2019-10-02 12:34:34,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:34:34,058 INFO L475 AbstractCegarLoop]: Abstraction has 17826 states and 28360 transitions. [2019-10-02 12:34:34,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:34:34,058 INFO L276 IsEmpty]: Start isEmpty. Operand 17826 states and 28360 transitions. [2019-10-02 12:34:34,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-02 12:34:34,063 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:34:34,063 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:34,064 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:34:34,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:34:34,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1184889081, now seen corresponding path program 1 times [2019-10-02 12:34:34,064 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:34:34,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:34:34,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:34,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:34:34,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:34,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:34:34,225 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 12:34:34,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:34:34,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:34:34,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:34:34,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:34:34,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:34:34,228 INFO L87 Difference]: Start difference. First operand 17826 states and 28360 transitions. Second operand 7 states. [2019-10-02 12:34:37,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:34:37,397 INFO L93 Difference]: Finished difference Result 53500 states and 87771 transitions. [2019-10-02 12:34:37,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:34:37,397 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 171 [2019-10-02 12:34:37,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:34:37,630 INFO L225 Difference]: With dead ends: 53500 [2019-10-02 12:34:37,630 INFO L226 Difference]: Without dead ends: 35708 [2019-10-02 12:34:37,745 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:34:37,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35708 states. [2019-10-02 12:34:40,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35708 to 35508. [2019-10-02 12:34:40,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35508 states. [2019-10-02 12:34:40,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35508 states to 35508 states and 57685 transitions. [2019-10-02 12:34:40,281 INFO L78 Accepts]: Start accepts. Automaton has 35508 states and 57685 transitions. Word has length 171 [2019-10-02 12:34:40,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:34:40,282 INFO L475 AbstractCegarLoop]: Abstraction has 35508 states and 57685 transitions. [2019-10-02 12:34:40,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:34:40,282 INFO L276 IsEmpty]: Start isEmpty. Operand 35508 states and 57685 transitions. [2019-10-02 12:34:40,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-02 12:34:40,289 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:34:40,289 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:40,289 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:34:40,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:34:40,290 INFO L82 PathProgramCache]: Analyzing trace with hash 364480526, now seen corresponding path program 1 times [2019-10-02 12:34:40,290 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:34:40,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:34:40,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:40,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:34:40,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:34:40,404 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 12:34:40,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:34:40,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:34:40,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:34:40,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:34:40,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:34:40,406 INFO L87 Difference]: Start difference. First operand 35508 states and 57685 transitions. Second operand 4 states. [2019-10-02 12:34:41,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:34:41,358 INFO L93 Difference]: Finished difference Result 70659 states and 116767 transitions. [2019-10-02 12:34:41,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:34:41,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-10-02 12:34:41,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:34:41,627 INFO L225 Difference]: With dead ends: 70659 [2019-10-02 12:34:41,627 INFO L226 Difference]: Without dead ends: 35173 [2019-10-02 12:34:42,140 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:34:42,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35173 states. [2019-10-02 12:34:43,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35173 to 35041. [2019-10-02 12:34:43,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35041 states. [2019-10-02 12:34:43,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35041 states to 35041 states and 56837 transitions. [2019-10-02 12:34:43,328 INFO L78 Accepts]: Start accepts. Automaton has 35041 states and 56837 transitions. Word has length 172 [2019-10-02 12:34:43,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:34:43,329 INFO L475 AbstractCegarLoop]: Abstraction has 35041 states and 56837 transitions. [2019-10-02 12:34:43,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:34:43,329 INFO L276 IsEmpty]: Start isEmpty. Operand 35041 states and 56837 transitions. [2019-10-02 12:34:43,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-02 12:34:43,335 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:34:43,335 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:43,336 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:34:43,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:34:43,336 INFO L82 PathProgramCache]: Analyzing trace with hash -315972202, now seen corresponding path program 1 times [2019-10-02 12:34:43,336 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:34:43,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:34:43,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:43,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:34:43,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:43,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:34:43,477 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-02 12:34:43,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:34:43,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:34:43,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:34:43,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:34:43,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:34:43,479 INFO L87 Difference]: Start difference. First operand 35041 states and 56837 transitions. Second operand 7 states. [2019-10-02 12:34:48,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:34:48,714 INFO L93 Difference]: Finished difference Result 105350 states and 178238 transitions. [2019-10-02 12:34:48,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:34:48,715 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 182 [2019-10-02 12:34:48,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:34:49,058 INFO L225 Difference]: With dead ends: 105350 [2019-10-02 12:34:49,059 INFO L226 Difference]: Without dead ends: 70343 [2019-10-02 12:34:49,156 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:34:49,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70343 states. [2019-10-02 12:34:52,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70343 to 70027. [2019-10-02 12:34:52,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70027 states. [2019-10-02 12:34:53,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70027 states to 70027 states and 117803 transitions. [2019-10-02 12:34:53,081 INFO L78 Accepts]: Start accepts. Automaton has 70027 states and 117803 transitions. Word has length 182 [2019-10-02 12:34:53,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:34:53,081 INFO L475 AbstractCegarLoop]: Abstraction has 70027 states and 117803 transitions. [2019-10-02 12:34:53,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:34:53,082 INFO L276 IsEmpty]: Start isEmpty. Operand 70027 states and 117803 transitions. [2019-10-02 12:34:53,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-02 12:34:53,086 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:34:53,087 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:53,087 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:34:53,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:34:53,087 INFO L82 PathProgramCache]: Analyzing trace with hash -460844199, now seen corresponding path program 1 times [2019-10-02 12:34:53,087 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:34:53,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:34:53,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:53,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:34:53,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:34:53,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:34:53,216 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 12:34:53,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:34:53,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:34:53,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:34:53,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:34:53,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:34:53,217 INFO L87 Difference]: Start difference. First operand 70027 states and 117803 transitions. Second operand 4 states. [2019-10-02 12:34:55,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:34:55,736 INFO L93 Difference]: Finished difference Result 139436 states and 240917 transitions. [2019-10-02 12:34:55,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:34:55,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2019-10-02 12:34:55,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:34:56,066 INFO L225 Difference]: With dead ends: 139436 [2019-10-02 12:34:56,066 INFO L226 Difference]: Without dead ends: 69425 [2019-10-02 12:34:56,306 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:34:56,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69425 states. [2019-10-02 12:35:00,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69425 to 69157. [2019-10-02 12:35:00,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69157 states. [2019-10-02 12:35:01,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69157 states to 69157 states and 116134 transitions. [2019-10-02 12:35:01,238 INFO L78 Accepts]: Start accepts. Automaton has 69157 states and 116134 transitions. Word has length 183 [2019-10-02 12:35:01,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:35:01,238 INFO L475 AbstractCegarLoop]: Abstraction has 69157 states and 116134 transitions. [2019-10-02 12:35:01,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:35:01,239 INFO L276 IsEmpty]: Start isEmpty. Operand 69157 states and 116134 transitions. [2019-10-02 12:35:01,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-10-02 12:35:01,259 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:35:01,260 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:35:01,260 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:35:01,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:35:01,260 INFO L82 PathProgramCache]: Analyzing trace with hash 722143069, now seen corresponding path program 1 times [2019-10-02 12:35:01,260 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:35:01,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:35:01,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:01,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:01,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:01,507 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 14 proven. 25 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2019-10-02 12:35:01,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:35:01,508 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:35:01,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:02,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 3623 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:35:02,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:35:02,218 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:35:02,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:35:02,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2019-10-02 12:35:02,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:35:02,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:35:02,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:35:02,242 INFO L87 Difference]: Start difference. First operand 69157 states and 116134 transitions. Second operand 15 states. [2019-10-02 12:35:06,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:35:06,083 INFO L93 Difference]: Finished difference Result 138724 states and 243537 transitions. [2019-10-02 12:35:06,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:35:06,087 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 277 [2019-10-02 12:35:06,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:35:07,167 INFO L225 Difference]: With dead ends: 138724 [2019-10-02 12:35:07,167 INFO L226 Difference]: Without dead ends: 69601 [2019-10-02 12:35:07,408 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 277 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2019-10-02 12:35:07,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69601 states. [2019-10-02 12:35:08,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69601 to 69601. [2019-10-02 12:35:08,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69601 states. [2019-10-02 12:35:13,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69601 states to 69601 states and 116387 transitions. [2019-10-02 12:35:13,387 INFO L78 Accepts]: Start accepts. Automaton has 69601 states and 116387 transitions. Word has length 277 [2019-10-02 12:35:13,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:35:13,387 INFO L475 AbstractCegarLoop]: Abstraction has 69601 states and 116387 transitions. [2019-10-02 12:35:13,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:35:13,388 INFO L276 IsEmpty]: Start isEmpty. Operand 69601 states and 116387 transitions. [2019-10-02 12:35:13,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-10-02 12:35:13,401 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:35:13,402 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:35:13,402 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:35:13,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:35:13,402 INFO L82 PathProgramCache]: Analyzing trace with hash 392374877, now seen corresponding path program 1 times [2019-10-02 12:35:13,402 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:35:13,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:35:13,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:13,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:13,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:13,610 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 14 proven. 28 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-10-02 12:35:13,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:35:13,611 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:35:13,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:14,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:14,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 3627 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:35:14,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:35:14,346 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-10-02 12:35:14,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:35:14,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2019-10-02 12:35:14,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:35:14,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:35:14,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:35:14,356 INFO L87 Difference]: Start difference. First operand 69601 states and 116387 transitions. Second operand 15 states. [2019-10-02 12:35:18,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:35:18,164 INFO L93 Difference]: Finished difference Result 139755 states and 243866 transitions. [2019-10-02 12:35:18,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:35:18,167 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 281 [2019-10-02 12:35:18,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:35:18,547 INFO L225 Difference]: With dead ends: 139755 [2019-10-02 12:35:18,547 INFO L226 Difference]: Without dead ends: 70188 [2019-10-02 12:35:18,811 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 282 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2019-10-02 12:35:18,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70188 states. [2019-10-02 12:35:21,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70188 to 70188. [2019-10-02 12:35:21,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70188 states. [2019-10-02 12:35:21,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70188 states to 70188 states and 116879 transitions. [2019-10-02 12:35:21,468 INFO L78 Accepts]: Start accepts. Automaton has 70188 states and 116879 transitions. Word has length 281 [2019-10-02 12:35:21,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:35:21,469 INFO L475 AbstractCegarLoop]: Abstraction has 70188 states and 116879 transitions. [2019-10-02 12:35:21,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:35:21,469 INFO L276 IsEmpty]: Start isEmpty. Operand 70188 states and 116879 transitions. [2019-10-02 12:35:21,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2019-10-02 12:35:21,491 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:35:21,492 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:35:21,492 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:35:21,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:35:21,493 INFO L82 PathProgramCache]: Analyzing trace with hash -876735092, now seen corresponding path program 1 times [2019-10-02 12:35:21,493 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:35:21,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:35:21,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:21,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:21,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:21,790 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 23 proven. 51 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-10-02 12:35:21,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:35:21,790 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:35:21,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:22,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 4478 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:35:22,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:35:22,657 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2019-10-02 12:35:22,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:35:22,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2019-10-02 12:35:22,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:35:22,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:35:22,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:35:22,666 INFO L87 Difference]: Start difference. First operand 70188 states and 116879 transitions. Second operand 15 states. [2019-10-02 12:35:26,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:35:26,630 INFO L93 Difference]: Finished difference Result 141040 states and 244753 transitions. [2019-10-02 12:35:26,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:35:26,630 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 443 [2019-10-02 12:35:26,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:35:27,099 INFO L225 Difference]: With dead ends: 141040 [2019-10-02 12:35:27,099 INFO L226 Difference]: Without dead ends: 70886 [2019-10-02 12:35:27,364 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 444 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2019-10-02 12:35:27,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70886 states. [2019-10-02 12:35:29,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70886 to 70886. [2019-10-02 12:35:29,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70886 states. [2019-10-02 12:35:29,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70886 states to 70886 states and 117530 transitions. [2019-10-02 12:35:30,003 INFO L78 Accepts]: Start accepts. Automaton has 70886 states and 117530 transitions. Word has length 443 [2019-10-02 12:35:30,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:35:30,004 INFO L475 AbstractCegarLoop]: Abstraction has 70886 states and 117530 transitions. [2019-10-02 12:35:30,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:35:30,004 INFO L276 IsEmpty]: Start isEmpty. Operand 70886 states and 117530 transitions. [2019-10-02 12:35:30,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-10-02 12:35:30,022 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:35:30,022 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:35:30,022 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:35:30,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:35:30,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1611552349, now seen corresponding path program 1 times [2019-10-02 12:35:30,023 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:35:30,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:35:30,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:30,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:30,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:30,226 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 14 proven. 34 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-10-02 12:35:30,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:35:30,227 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:35:30,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:30,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 3635 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:35:30,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:35:30,950 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-10-02 12:35:30,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:35:30,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2019-10-02 12:35:30,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:35:30,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:35:30,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:35:30,959 INFO L87 Difference]: Start difference. First operand 70886 states and 117530 transitions. Second operand 15 states. [2019-10-02 12:35:35,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:35:35,002 INFO L93 Difference]: Finished difference Result 142539 states and 246014 transitions. [2019-10-02 12:35:35,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:35:35,002 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 289 [2019-10-02 12:35:35,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:35:35,446 INFO L225 Difference]: With dead ends: 142539 [2019-10-02 12:35:35,446 INFO L226 Difference]: Without dead ends: 71687 [2019-10-02 12:35:36,624 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 290 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2019-10-02 12:35:36,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71687 states. [2019-10-02 12:35:38,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71687 to 71687. [2019-10-02 12:35:38,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71687 states. [2019-10-02 12:35:43,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71687 states to 71687 states and 118308 transitions. [2019-10-02 12:35:43,699 INFO L78 Accepts]: Start accepts. Automaton has 71687 states and 118308 transitions. Word has length 289 [2019-10-02 12:35:43,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:35:43,699 INFO L475 AbstractCegarLoop]: Abstraction has 71687 states and 118308 transitions. [2019-10-02 12:35:43,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:35:43,700 INFO L276 IsEmpty]: Start isEmpty. Operand 71687 states and 118308 transitions. [2019-10-02 12:35:43,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-10-02 12:35:43,709 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:35:43,709 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:35:43,709 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:35:43,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:35:43,710 INFO L82 PathProgramCache]: Analyzing trace with hash -427755171, now seen corresponding path program 1 times [2019-10-02 12:35:43,710 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:35:43,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:35:43,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:43,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:43,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:35:43,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:43,948 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 16 proven. 12 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-10-02 12:35:43,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:35:43,948 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:35:44,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:35:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:35:44,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 3639 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 12:35:44,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:35:44,789 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-02 12:35:44,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:35:44,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2019-10-02 12:35:44,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 12:35:44,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 12:35:44,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:35:44,801 INFO L87 Difference]: Start difference. First operand 71687 states and 118308 transitions. Second operand 17 states. [2019-10-02 12:36:52,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:36:52,543 INFO L93 Difference]: Finished difference Result 464883 states and 990177 transitions. [2019-10-02 12:36:52,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-10-02 12:36:52,544 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 293 [2019-10-02 12:36:52,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:36:55,976 INFO L225 Difference]: With dead ends: 464883 [2019-10-02 12:36:55,977 INFO L226 Difference]: Without dead ends: 393230 [2019-10-02 12:36:57,517 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5224 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1585, Invalid=11987, Unknown=0, NotChecked=0, Total=13572 [2019-10-02 12:36:57,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393230 states. [2019-10-02 12:37:30,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393230 to 362859. [2019-10-02 12:37:30,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362859 states. [2019-10-02 12:37:35,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362859 states to 362859 states and 625669 transitions. [2019-10-02 12:37:35,241 INFO L78 Accepts]: Start accepts. Automaton has 362859 states and 625669 transitions. Word has length 293 [2019-10-02 12:37:35,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:37:35,242 INFO L475 AbstractCegarLoop]: Abstraction has 362859 states and 625669 transitions. [2019-10-02 12:37:35,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 12:37:35,242 INFO L276 IsEmpty]: Start isEmpty. Operand 362859 states and 625669 transitions. [2019-10-02 12:37:35,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2019-10-02 12:37:35,264 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:37:35,265 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 8, 8, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:37:35,265 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:37:35,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:37:35,266 INFO L82 PathProgramCache]: Analyzing trace with hash 789165175, now seen corresponding path program 1 times [2019-10-02 12:37:35,266 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:37:35,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:37:35,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:35,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:35,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:37:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:36,797 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 21 proven. 38 refuted. 0 times theorem prover too weak. 629 trivial. 0 not checked. [2019-10-02 12:37:36,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:37:36,797 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:37:36,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:37:37,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:37:37,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 4546 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 12:37:37,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:37:37,674 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2019-10-02 12:37:37,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:37:37,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [15] total 16 [2019-10-02 12:37:37,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 12:37:37,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 12:37:37,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:37:37,703 INFO L87 Difference]: Start difference. First operand 362859 states and 625669 transitions. Second operand 16 states. [2019-10-02 12:39:26,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:26,275 INFO L93 Difference]: Finished difference Result 1142325 states and 2187925 transitions. [2019-10-02 12:39:26,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-02 12:39:26,276 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 477 [2019-10-02 12:39:26,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:32,948 INFO L225 Difference]: With dead ends: 1142325 [2019-10-02 12:39:32,948 INFO L226 Difference]: Without dead ends: 778690 [2019-10-02 12:39:42,196 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 486 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=972, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 12:39:42,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778690 states.