/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/ntdrivers/kbfiltr.i.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 01:43:15,047 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 01:43:15,050 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 01:43:15,089 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 01:43:15,090 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 01:43:15,092 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 01:43:15,094 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 01:43:15,097 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 01:43:15,099 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 01:43:15,100 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 01:43:15,102 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 01:43:15,103 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 01:43:15,104 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 01:43:15,105 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 01:43:15,107 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 01:43:15,108 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 01:43:15,110 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 01:43:15,111 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 01:43:15,113 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 01:43:15,116 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 01:43:15,118 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 01:43:15,120 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 01:43:15,121 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 01:43:15,122 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 01:43:15,126 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 01:43:15,127 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 01:43:15,127 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 01:43:15,128 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 01:43:15,137 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 01:43:15,146 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 01:43:15,146 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 01:43:15,147 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 01:43:15,149 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 01:43:15,150 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 01:43:15,151 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 01:43:15,151 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 01:43:15,152 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 01:43:15,153 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 01:43:15,153 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 01:43:15,154 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 01:43:15,155 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 01:43:15,156 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 01:43:15,184 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 01:43:15,184 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 01:43:15,186 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 01:43:15,186 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 01:43:15,186 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 01:43:15,187 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 01:43:15,187 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 01:43:15,187 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 01:43:15,187 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 01:43:15,187 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 01:43:15,188 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 01:43:15,188 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 01:43:15,188 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 01:43:15,188 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 01:43:15,188 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 01:43:15,189 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 01:43:15,189 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 01:43:15,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 01:43:15,189 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 01:43:15,189 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 01:43:15,190 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 01:43:15,190 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 01:43:15,190 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 01:43:15,190 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 01:43:15,190 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 01:43:15,190 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 01:43:15,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 01:43:15,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 01:43:15,680 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 01:43:15,681 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 01:43:15,683 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 01:43:15,684 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers/kbfiltr.i.cil-2.c [2020-12-23 01:43:15,770 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/01d7c5d83/6b2ecd8e40ab40b59a6f774de11850e2/FLAG5a7e358aa [2020-12-23 01:43:16,696 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 01:43:16,697 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ntdrivers/kbfiltr.i.cil-2.c [2020-12-23 01:43:16,755 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/01d7c5d83/6b2ecd8e40ab40b59a6f774de11850e2/FLAG5a7e358aa [2020-12-23 01:43:16,784 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/01d7c5d83/6b2ecd8e40ab40b59a6f774de11850e2 [2020-12-23 01:43:16,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 01:43:16,791 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 01:43:16,794 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 01:43:16,795 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 01:43:16,799 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 01:43:16,800 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:43:16" (1/1) ... [2020-12-23 01:43:16,803 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a6393de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:43:16, skipping insertion in model container [2020-12-23 01:43:16,803 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:43:16" (1/1) ... [2020-12-23 01:43:16,812 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 01:43:16,931 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 01:43:17,624 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ntdrivers/kbfiltr.i.cil-2.c[62209,62222] left hand side expression in assignment: lhs: VariableLHS[~UNLOADED~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~NP~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~DC~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~SKIP1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~SKIP2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~MPR1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~MPR3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~IPC~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~pended~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~compFptr~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~compRegistered~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~setEventCalled~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~customIrp~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~DriverObject,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[104],StructAccessExpression[IdentifierExpression[~DriverObject,],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[8],IfThenElseExpression[BinaryExpression[COMPLEQ,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~0,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[9223372036854775807]],BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~0,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~0,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~DriverObject,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[104],StructAccessExpression[IdentifierExpression[~DriverObject,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~DriverObject,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[120],StructAccessExpression[IdentifierExpression[~DriverObject,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~DriverObject,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[320],StructAccessExpression[IdentifierExpression[~DriverObject,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~DriverObject,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[280],StructAccessExpression[IdentifierExpression[~DriverObject,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~DriverObject,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[224],StructAccessExpression[IdentifierExpression[~DriverObject,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~DriverObject,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~DriverObject,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem24,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem24,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~status~0,] left hand side expression in assignment: lhs: VariableLHS[~status~0,] left hand side expression in assignment: lhs: VariableLHS[~devExt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devExt~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~devExt~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devExt~0,],base],StructAccessExpression[IdentifierExpression[~devExt~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devExt~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~devExt~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devExt~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~devExt~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devExt~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[101],StructAccessExpression[IdentifierExpression[~devExt~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devExt~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[102],StructAccessExpression[IdentifierExpression[~devExt~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devExt~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[100],StructAccessExpression[IdentifierExpression[~devExt~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~event~0,] left hand side expression in assignment: lhs: VariableLHS[~irpStack~0,] left hand side expression in assignment: lhs: VariableLHS[~devExt~1,] left hand side expression in assignment: lhs: VariableLHS[~status~1,] left hand side expression in assignment: lhs: VariableLHS[~status~1,] left hand side expression in assignment: lhs: VariableLHS[~status~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~Irp,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[~Irp,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~myStatus~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~irpStack~1,] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~Irp,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[63],StructAccessExpression[IdentifierExpression[~Irp,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~status~2,] left hand side expression in assignment: lhs: VariableLHS[~devExt~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~Irp,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[52],StructAccessExpression[IdentifierExpression[~Irp,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~irpStack~2,] left hand side expression in assignment: lhs: VariableLHS[~status~2,] left hand side expression in assignment: lhs: VariableLHS[~status~2,] left hand side expression in assignment: lhs: VariableLHS[~connectData~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devExt~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~devExt~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~connectData~0,],base],StructAccessExpression[IdentifierExpression[~connectData~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~connectData~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~connectData~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~status~2,] left hand side expression in assignment: lhs: VariableLHS[~status~2,] left hand side expression in assignment: lhs: VariableLHS[~hookKeyboard~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devExt~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~devExt~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~hookKeyboard~0,],base],StructAccessExpression[IdentifierExpression[~hookKeyboard~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devExt~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~devExt~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~hookKeyboard~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~hookKeyboard~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devExt~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~devExt~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~hookKeyboard~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~hookKeyboard~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devExt~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~devExt~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devExt~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~devExt~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devExt~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devExt~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~status~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~Irp,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[~Irp,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~myStatus~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~status~3,] left hand side expression in assignment: lhs: VariableLHS[~devExt~3,] left hand side expression in assignment: lhs: VariableLHS[~irpStack~3,] left hand side expression in assignment: lhs: VariableLHS[~irpSp~0,] left hand side expression in assignment: lhs: VariableLHS[~nextIrpSp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~nextIrpSp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~nextIrpSp~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~compRegistered~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~compFptr~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~irpSp___0~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~irpSp___0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[52],StructAccessExpression[IdentifierExpression[~irpSp___0~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~irpSp___0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~irpSp___0~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~irpSp___0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~irpSp___0~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~irpSp___0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~irpSp___0~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~irpSp___0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~irpSp___0~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~irpSp___0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~irpSp___0~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~status~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devExt~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[100],StructAccessExpression[IdentifierExpression[~devExt~3,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devExt~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[102],StructAccessExpression[IdentifierExpression[~devExt~3,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devExt~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[101],StructAccessExpression[IdentifierExpression[~devExt~3,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~Irp,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[~Irp,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~myStatus~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~Irp,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[52],StructAccessExpression[IdentifierExpression[~Irp,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devExt~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[101],StructAccessExpression[IdentifierExpression[~devExt~3,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~Irp,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[63],StructAccessExpression[IdentifierExpression[~Irp,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~status~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devExt~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[102],StructAccessExpression[IdentifierExpression[~devExt~3,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~Irp,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[63],StructAccessExpression[IdentifierExpression[~Irp,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~status~3,] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~Irp,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[63],StructAccessExpression[IdentifierExpression[~Irp,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~status~3,] left hand side expression in assignment: lhs: VariableLHS[~devExt~4,] left hand side expression in assignment: lhs: VariableLHS[~irpStack~4,] left hand side expression in assignment: lhs: VariableLHS[~powerType~0,] left hand side expression in assignment: lhs: VariableLHS[~powerState~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devExt~4,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~devExt~4,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~Irp,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[63],StructAccessExpression[IdentifierExpression[~Irp,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~status~4,] left hand side expression in assignment: lhs: VariableLHS[~devExt~5,] left hand side expression in assignment: lhs: VariableLHS[~status~4,] left hand side expression in assignment: address: IdentifierExpression[~TurnTranslationOn,] left hand side expression in assignment: lhs: VariableLHS[~retVal~0,] left hand side expression in assignment: lhs: VariableLHS[~devExt~6,] left hand side expression in assignment: lhs: VariableLHS[~retVal~0,] left hand side expression in assignment: address: IdentifierExpression[~ContinueProcessing,] left hand side expression in assignment: lhs: VariableLHS[~devExt~7,] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~pended~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~compFptr~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~compRegistered~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~setEventCalled~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~customIrp~0,GLOBAL] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~devobj~0,],DeviceExtension] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~d~0,],DriverExtension] left hand side expression in assignment: lhs: StructLHS[ArrayLHS[VariableLHS[~stack~0,],[IntegerLiteral[0]]],MajorFunction] left hand side expression in assignment: lhs: StructLHS[ArrayLHS[VariableLHS[~stack~0,],[IntegerLiteral[1]]],MajorFunction] left hand side expression in assignment: lhs: StructLHS[ArrayLHS[VariableLHS[~stack~0,],[IntegerLiteral[2]]],MajorFunction] left hand side expression in assignment: lhs: StructLHS[ArrayLHS[VariableLHS[~stack~0,],[IntegerLiteral[0]]],MinorFunction] left hand side expression in assignment: lhs: StructLHS[ArrayLHS[VariableLHS[~stack~0,],[IntegerLiteral[1]]],MinorFunction] left hand side expression in assignment: lhs: StructLHS[ArrayLHS[VariableLHS[~stack~0,],[IntegerLiteral[2]]],MinorFunction] left hand side expression in assignment: lhs: StructLHS[StructLHS[StructLHS[ArrayLHS[VariableLHS[~stack~0,],[IntegerLiteral[0]]],Parameters],DeviceIoControl],Type3InputBuffer] left hand side expression in assignment: lhs: StructLHS[StructLHS[StructLHS[ArrayLHS[VariableLHS[~stack~0,],[IntegerLiteral[1]]],Parameters],DeviceIoControl],Type3InputBuffer] left hand side expression in assignment: lhs: StructLHS[StructLHS[StructLHS[ArrayLHS[VariableLHS[~stack~0,],[IntegerLiteral[2]]],Parameters],DeviceIoControl],Type3InputBuffer] left hand side expression in assignment: lhs: StructLHS[StructLHS[StructLHS[ArrayLHS[VariableLHS[~stack~0,],[IntegerLiteral[0]]],Parameters],DeviceIoControl],InputBufferLength] left hand side expression in assignment: lhs: StructLHS[StructLHS[StructLHS[ArrayLHS[VariableLHS[~stack~0,],[IntegerLiteral[1]]],Parameters],DeviceIoControl],InputBufferLength] left hand side expression in assignment: lhs: StructLHS[StructLHS[StructLHS[ArrayLHS[VariableLHS[~stack~0,],[IntegerLiteral[2]]],Parameters],DeviceIoControl],InputBufferLength] left hand side expression in assignment: lhs: StructLHS[StructLHS[StructLHS[ArrayLHS[VariableLHS[~stack~0,],[IntegerLiteral[0]]],Parameters],DeviceIoControl],IoControlCode] left hand side expression in assignment: lhs: StructLHS[StructLHS[StructLHS[ArrayLHS[VariableLHS[~stack~0,],[IntegerLiteral[1]]],Parameters],DeviceIoControl],IoControlCode] left hand side expression in assignment: lhs: StructLHS[StructLHS[StructLHS[ArrayLHS[VariableLHS[~stack~0,],[IntegerLiteral[2]]],Parameters],DeviceIoControl],IoControlCode] left hand side expression in assignment: lhs: StructLHS[StructLHS[StructLHS[StructLHS[StructLHS[VariableLHS[~irp~0,],Tail],Overlay],__annonCompField17],__annonCompField16],CurrentStackLocation] left hand side expression in assignment: lhs: VariableLHS[~pirp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~status~5,] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~customIrp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~setEventCalled~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~compRegistered~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~compFptr~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~pended~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pirp~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[~pirp~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~myStatus~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pirp~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[~pirp~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~myStatus~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~status~5,] left hand side expression in assignment: lhs: VariableLHS[~status~5,] left hand side expression in assignment: lhs: VariableLHS[~status~5,] left hand side expression in assignment: lhs: VariableLHS[~status~5,] left hand side expression in assignment: lhs: VariableLHS[~status~5,] left hand side expression in assignment: lhs: VariableLHS[~status~5,] left hand side expression in assignment: lhs: VariableLHS[~status~5,] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~customIrp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~customIrp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] left hand side expression in assignment: address: IdentifierExpression[~DeviceObject,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem183,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[76],StructAccessExpression[IdentifierExpression[#t~mem183,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~compRetStatus~0,] left hand side expression in assignment: lhs: VariableLHS[~returnVal2~0,] left hand side expression in assignment: lhs: VariableLHS[~returnVal2~0,] left hand side expression in assignment: lhs: VariableLHS[~returnVal2~0,] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~setEventCalled~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~setEventCalled~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~customIrp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~compRetStatus~1,] left hand side expression in assignment: lhs: VariableLHS[~returnVal~0,] left hand side expression in assignment: lhs: VariableLHS[~returnVal~0,] left hand side expression in assignment: lhs: VariableLHS[~returnVal~0,] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] [2020-12-23 01:43:17,967 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 01:43:17,989 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 01:43:18,089 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ntdrivers/kbfiltr.i.cil-2.c[62209,62222] left hand side expression in assignment: lhs: VariableLHS[~UNLOADED~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~NP~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~DC~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~SKIP1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~SKIP2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~MPR1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~MPR3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~IPC~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~pended~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~compFptr~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~compRegistered~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~setEventCalled~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~customIrp~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~DriverObject,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[104],StructAccessExpression[IdentifierExpression[~DriverObject,],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[8],IfThenElseExpression[BinaryExpression[COMPLEQ,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~0,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[9223372036854775807]],BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~0,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~0,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~DriverObject,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[104],StructAccessExpression[IdentifierExpression[~DriverObject,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~DriverObject,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[120],StructAccessExpression[IdentifierExpression[~DriverObject,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~DriverObject,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[320],StructAccessExpression[IdentifierExpression[~DriverObject,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~DriverObject,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[280],StructAccessExpression[IdentifierExpression[~DriverObject,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~DriverObject,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[224],StructAccessExpression[IdentifierExpression[~DriverObject,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~DriverObject,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~DriverObject,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem24,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem24,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~status~0,] left hand side expression in assignment: lhs: VariableLHS[~status~0,] left hand side expression in assignment: lhs: VariableLHS[~devExt~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devExt~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~devExt~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devExt~0,],base],StructAccessExpression[IdentifierExpression[~devExt~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devExt~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~devExt~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devExt~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~devExt~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devExt~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[101],StructAccessExpression[IdentifierExpression[~devExt~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devExt~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[102],StructAccessExpression[IdentifierExpression[~devExt~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devExt~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[100],StructAccessExpression[IdentifierExpression[~devExt~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~event~0,] left hand side expression in assignment: lhs: VariableLHS[~irpStack~0,] left hand side expression in assignment: lhs: VariableLHS[~devExt~1,] left hand side expression in assignment: lhs: VariableLHS[~status~1,] left hand side expression in assignment: lhs: VariableLHS[~status~1,] left hand side expression in assignment: lhs: VariableLHS[~status~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~Irp,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[~Irp,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~myStatus~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~irpStack~1,] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~Irp,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[63],StructAccessExpression[IdentifierExpression[~Irp,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~status~2,] left hand side expression in assignment: lhs: VariableLHS[~devExt~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~Irp,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[52],StructAccessExpression[IdentifierExpression[~Irp,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~irpStack~2,] left hand side expression in assignment: lhs: VariableLHS[~status~2,] left hand side expression in assignment: lhs: VariableLHS[~status~2,] left hand side expression in assignment: lhs: VariableLHS[~connectData~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devExt~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~devExt~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~connectData~0,],base],StructAccessExpression[IdentifierExpression[~connectData~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~connectData~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~connectData~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~status~2,] left hand side expression in assignment: lhs: VariableLHS[~status~2,] left hand side expression in assignment: lhs: VariableLHS[~hookKeyboard~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devExt~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[48],StructAccessExpression[IdentifierExpression[~devExt~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~hookKeyboard~0,],base],StructAccessExpression[IdentifierExpression[~hookKeyboard~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devExt~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[56],StructAccessExpression[IdentifierExpression[~devExt~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~hookKeyboard~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~hookKeyboard~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devExt~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[64],StructAccessExpression[IdentifierExpression[~devExt~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~hookKeyboard~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~hookKeyboard~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devExt~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[72],StructAccessExpression[IdentifierExpression[~devExt~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devExt~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~devExt~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devExt~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~devExt~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~status~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~Irp,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[~Irp,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~myStatus~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~status~3,] left hand side expression in assignment: lhs: VariableLHS[~devExt~3,] left hand side expression in assignment: lhs: VariableLHS[~irpStack~3,] left hand side expression in assignment: lhs: VariableLHS[~irpSp~0,] left hand side expression in assignment: lhs: VariableLHS[~nextIrpSp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~nextIrpSp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~nextIrpSp~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~compRegistered~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~compFptr~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~irpSp___0~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~irpSp___0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[52],StructAccessExpression[IdentifierExpression[~irpSp___0~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~irpSp___0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[60],StructAccessExpression[IdentifierExpression[~irpSp___0~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~irpSp___0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~irpSp___0~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~irpSp___0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~irpSp___0~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~irpSp___0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~irpSp___0~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~irpSp___0~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~irpSp___0~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~status~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devExt~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[100],StructAccessExpression[IdentifierExpression[~devExt~3,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devExt~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[102],StructAccessExpression[IdentifierExpression[~devExt~3,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devExt~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[101],StructAccessExpression[IdentifierExpression[~devExt~3,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~Irp,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[~Irp,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~myStatus~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~Irp,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[52],StructAccessExpression[IdentifierExpression[~Irp,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devExt~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[101],StructAccessExpression[IdentifierExpression[~devExt~3,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~Irp,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[63],StructAccessExpression[IdentifierExpression[~Irp,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~status~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devExt~3,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[102],StructAccessExpression[IdentifierExpression[~devExt~3,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~Irp,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[63],StructAccessExpression[IdentifierExpression[~Irp,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~status~3,] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~Irp,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[63],StructAccessExpression[IdentifierExpression[~Irp,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~status~3,] left hand side expression in assignment: lhs: VariableLHS[~devExt~4,] left hand side expression in assignment: lhs: VariableLHS[~irpStack~4,] left hand side expression in assignment: lhs: VariableLHS[~powerType~0,] left hand side expression in assignment: address: IdentifierExpression[~#powerState~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~devExt~4,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~devExt~4,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~Irp,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[63],StructAccessExpression[IdentifierExpression[~Irp,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~status~4,] left hand side expression in assignment: lhs: VariableLHS[~devExt~5,] left hand side expression in assignment: lhs: VariableLHS[~status~4,] left hand side expression in assignment: address: IdentifierExpression[~TurnTranslationOn,] left hand side expression in assignment: lhs: VariableLHS[~retVal~0,] left hand side expression in assignment: lhs: VariableLHS[~devExt~6,] left hand side expression in assignment: lhs: VariableLHS[~retVal~0,] left hand side expression in assignment: address: IdentifierExpression[~ContinueProcessing,] left hand side expression in assignment: lhs: VariableLHS[~devExt~7,] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~pended~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~compFptr~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~compRegistered~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~setEventCalled~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~customIrp~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#devobj~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[76],StructAccessExpression[IdentifierExpression[~#devobj~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#d~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[~#d~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#stack~0,],base],StructAccessExpression[IdentifierExpression[~#stack~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#stack~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[68],StructAccessExpression[IdentifierExpression[~#stack~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#stack~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[136],StructAccessExpression[IdentifierExpression[~#stack~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#stack~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~#stack~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#stack~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[69],StructAccessExpression[IdentifierExpression[~#stack~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#stack~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[137],StructAccessExpression[IdentifierExpression[~#stack~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#stack~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~#stack~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#stack~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[96],StructAccessExpression[IdentifierExpression[~#stack~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#stack~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[164],StructAccessExpression[IdentifierExpression[~#stack~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#stack~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~#stack~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#stack~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[80],StructAccessExpression[IdentifierExpression[~#stack~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#stack~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[148],StructAccessExpression[IdentifierExpression[~#stack~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#stack~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~#stack~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#stack~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~#stack~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#stack~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[156],StructAccessExpression[IdentifierExpression[~#stack~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#irp~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[180],StructAccessExpression[IdentifierExpression[~#irp~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~pirp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~status~5,] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~customIrp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~setEventCalled~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~compRegistered~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~compFptr~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~pended~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pirp~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[~pirp~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~myStatus~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~pirp~0,GLOBAL],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[~pirp~0,GLOBAL],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~myStatus~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~status~5,] left hand side expression in assignment: lhs: VariableLHS[~status~5,] left hand side expression in assignment: lhs: VariableLHS[~status~5,] left hand side expression in assignment: lhs: VariableLHS[~status~5,] left hand side expression in assignment: lhs: VariableLHS[~status~5,] left hand side expression in assignment: lhs: VariableLHS[~status~5,] left hand side expression in assignment: lhs: VariableLHS[~status~5,] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~customIrp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~customIrp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] left hand side expression in assignment: address: IdentifierExpression[~DeviceObject,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem190,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[76],StructAccessExpression[IdentifierExpression[#t~mem190,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~compRetStatus~0,] left hand side expression in assignment: lhs: VariableLHS[~returnVal2~0,] left hand side expression in assignment: lhs: VariableLHS[~returnVal2~0,] left hand side expression in assignment: lhs: VariableLHS[~returnVal2~0,] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~setEventCalled~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~setEventCalled~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~customIrp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~compRetStatus~1,] left hand side expression in assignment: lhs: VariableLHS[~returnVal~0,] left hand side expression in assignment: lhs: VariableLHS[~returnVal~0,] left hand side expression in assignment: lhs: VariableLHS[~returnVal~0,] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~lowerDriverReturn~0,GLOBAL] [2020-12-23 01:43:18,219 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 01:43:18,288 INFO L208 MainTranslator]: Completed translation [2020-12-23 01:43:18,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:43:18 WrapperNode [2020-12-23 01:43:18,288 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 01:43:18,290 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 01:43:18,290 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 01:43:18,290 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 01:43:18,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:43:18" (1/1) ... [2020-12-23 01:43:18,348 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:43:18" (1/1) ... [2020-12-23 01:43:18,477 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 01:43:18,479 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 01:43:18,480 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 01:43:18,480 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 01:43:18,491 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:43:18" (1/1) ... [2020-12-23 01:43:18,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:43:18" (1/1) ... [2020-12-23 01:43:18,523 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:43:18" (1/1) ... [2020-12-23 01:43:18,525 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:43:18" (1/1) ... [2020-12-23 01:43:18,623 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:43:18" (1/1) ... [2020-12-23 01:43:18,654 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:43:18" (1/1) ... [2020-12-23 01:43:18,689 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:43:18" (1/1) ... [2020-12-23 01:43:18,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 01:43:18,718 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 01:43:18,718 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 01:43:18,718 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 01:43:18,719 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:43:18" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/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 [2020-12-23 01:43:18,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2020-12-23 01:43:18,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2020-12-23 01:43:18,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2020-12-23 01:43:18,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 01:43:18,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 01:43:18,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-12-23 01:43:18,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-12-23 01:43:18,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 01:43:18,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-12-23 01:43:18,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 01:43:18,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 01:43:18,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2020-12-23 01:43:18,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 01:43:18,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 01:43:19,389 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 01:43:19,392 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 01:43:19,396 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 01:43:19,404 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 01:43:19,411 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 01:43:19,418 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 01:43:19,425 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 01:43:19,432 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 01:43:19,440 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 01:43:19,446 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 01:43:19,455 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 01:43:19,458 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 01:43:19,460 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 01:43:19,466 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-12-23 01:43:23,570 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##427: assume false; [2020-12-23 01:43:23,570 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##428: assume !false; [2020-12-23 01:43:23,570 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##201: assume !false; [2020-12-23 01:43:23,570 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##200: assume false; [2020-12-23 01:43:23,571 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##258: assume false; [2020-12-23 01:43:23,571 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##259: assume !false; [2020-12-23 01:43:23,571 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##289: assume !false; [2020-12-23 01:43:23,571 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##288: assume false; [2020-12-23 01:43:23,572 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##231: assume !false; [2020-12-23 01:43:23,572 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##230: assume false; [2020-12-23 01:43:23,572 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##319: assume !false; [2020-12-23 01:43:23,572 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##318: assume false; [2020-12-23 01:43:23,573 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##173: assume false; [2020-12-23 01:43:23,573 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##174: assume !false; [2020-12-23 01:43:23,573 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##69: assume !false; [2020-12-23 01:43:23,573 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##68: assume false; [2020-12-23 01:43:23,573 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##36: assume !false; [2020-12-23 01:43:23,574 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##35: assume false; [2020-12-23 01:43:23,574 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume !false; [2020-12-23 01:43:23,574 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume false; [2020-12-23 01:43:23,574 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2020-12-23 01:43:23,574 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2020-12-23 01:43:23,574 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##341: assume !false; [2020-12-23 01:43:23,574 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##340: assume false; [2020-12-23 01:43:23,575 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##114: assume !false; [2020-12-23 01:43:23,575 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##113: assume false; [2020-12-23 01:43:23,575 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##360: assume false; [2020-12-23 01:43:23,575 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##361: assume !false; [2020-12-23 01:43:23,590 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 01:43:23,590 INFO L299 CfgBuilder]: Removed 178 assume(true) statements. [2020-12-23 01:43:23,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:43:23 BoogieIcfgContainer [2020-12-23 01:43:23,593 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 01:43:23,595 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 01:43:23,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 01:43:23,600 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 01:43:23,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 01:43:16" (1/3) ... [2020-12-23 01:43:23,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6136655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:43:23, skipping insertion in model container [2020-12-23 01:43:23,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:43:18" (2/3) ... [2020-12-23 01:43:23,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6136655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:43:23, skipping insertion in model container [2020-12-23 01:43:23,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:43:23" (3/3) ... [2020-12-23 01:43:23,604 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr.i.cil-2.c [2020-12-23 01:43:23,612 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 01:43:23,618 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 30 error locations. [2020-12-23 01:43:23,640 INFO L253 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2020-12-23 01:43:23,673 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 01:43:23,674 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 01:43:23,674 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 01:43:23,674 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 01:43:23,674 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 01:43:23,674 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 01:43:23,674 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 01:43:23,675 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 01:43:23,705 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states. [2020-12-23 01:43:23,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-23 01:43:23,712 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:43:23,713 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:43:23,714 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:43:23,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:43:23,721 INFO L82 PathProgramCache]: Analyzing trace with hash -570802095, now seen corresponding path program 1 times [2020-12-23 01:43:23,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:43:23,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866694475] [2020-12-23 01:43:23,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:43:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:43:24,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:43:24,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866694475] [2020-12-23 01:43:24,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:43:24,212 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 01:43:24,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613694031] [2020-12-23 01:43:24,219 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-23 01:43:24,219 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:43:24,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-23 01:43:24,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 01:43:24,237 INFO L87 Difference]: Start difference. First operand 361 states. Second operand 2 states. [2020-12-23 01:43:24,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:43:24,302 INFO L93 Difference]: Finished difference Result 718 states and 1071 transitions. [2020-12-23 01:43:24,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-23 01:43:24,304 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2020-12-23 01:43:24,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:43:24,321 INFO L225 Difference]: With dead ends: 718 [2020-12-23 01:43:24,322 INFO L226 Difference]: Without dead ends: 355 [2020-12-23 01:43:24,328 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-23 01:43:24,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2020-12-23 01:43:24,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2020-12-23 01:43:24,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2020-12-23 01:43:24,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 488 transitions. [2020-12-23 01:43:24,410 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 488 transitions. Word has length 15 [2020-12-23 01:43:24,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:43:24,411 INFO L481 AbstractCegarLoop]: Abstraction has 355 states and 488 transitions. [2020-12-23 01:43:24,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-23 01:43:24,411 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 488 transitions. [2020-12-23 01:43:24,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-23 01:43:24,412 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:43:24,412 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:43:24,412 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 01:43:24,413 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:43:24,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:43:24,414 INFO L82 PathProgramCache]: Analyzing trace with hash -312636657, now seen corresponding path program 1 times [2020-12-23 01:43:24,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:43:24,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216176641] [2020-12-23 01:43:24,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:43:24,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:43:24,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:43:24,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216176641] [2020-12-23 01:43:24,601 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:43:24,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:43:24,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001999609] [2020-12-23 01:43:24,603 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:43:24,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:43:24,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:43:24,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:43:24,605 INFO L87 Difference]: Start difference. First operand 355 states and 488 transitions. Second operand 4 states. [2020-12-23 01:43:26,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:43:26,721 INFO L93 Difference]: Finished difference Result 372 states and 508 transitions. [2020-12-23 01:43:26,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:43:26,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-12-23 01:43:26,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:43:26,728 INFO L225 Difference]: With dead ends: 372 [2020-12-23 01:43:26,728 INFO L226 Difference]: Without dead ends: 355 [2020-12-23 01:43:26,730 INFO L677 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 [2020-12-23 01:43:26,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2020-12-23 01:43:26,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2020-12-23 01:43:26,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2020-12-23 01:43:26,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 487 transitions. [2020-12-23 01:43:26,758 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 487 transitions. Word has length 15 [2020-12-23 01:43:26,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:43:26,758 INFO L481 AbstractCegarLoop]: Abstraction has 355 states and 487 transitions. [2020-12-23 01:43:26,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:43:26,759 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 487 transitions. [2020-12-23 01:43:26,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-23 01:43:26,760 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:43:26,760 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:43:26,761 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 01:43:26,761 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:43:26,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:43:26,762 INFO L82 PathProgramCache]: Analyzing trace with hash -830050372, now seen corresponding path program 1 times [2020-12-23 01:43:26,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:43:26,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469602718] [2020-12-23 01:43:26,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:43:26,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:43:26,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:43:26,873 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469602718] [2020-12-23 01:43:26,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:43:26,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:43:26,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309789403] [2020-12-23 01:43:26,874 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:43:26,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:43:26,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:43:26,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:43:26,876 INFO L87 Difference]: Start difference. First operand 355 states and 487 transitions. Second operand 4 states. [2020-12-23 01:43:28,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:43:28,141 INFO L93 Difference]: Finished difference Result 1033 states and 1422 transitions. [2020-12-23 01:43:28,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:43:28,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-12-23 01:43:28,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:43:28,149 INFO L225 Difference]: With dead ends: 1033 [2020-12-23 01:43:28,150 INFO L226 Difference]: Without dead ends: 698 [2020-12-23 01:43:28,155 INFO L677 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 [2020-12-23 01:43:28,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2020-12-23 01:43:28,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 357. [2020-12-23 01:43:28,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2020-12-23 01:43:28,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 489 transitions. [2020-12-23 01:43:28,206 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 489 transitions. Word has length 23 [2020-12-23 01:43:28,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:43:28,207 INFO L481 AbstractCegarLoop]: Abstraction has 357 states and 489 transitions. [2020-12-23 01:43:28,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:43:28,207 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 489 transitions. [2020-12-23 01:43:28,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-23 01:43:28,210 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:43:28,210 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:43:28,211 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 01:43:28,211 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:43:28,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:43:28,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1866993660, now seen corresponding path program 1 times [2020-12-23 01:43:28,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:43:28,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113723974] [2020-12-23 01:43:28,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:43:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:43:28,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:43:28,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113723974] [2020-12-23 01:43:28,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:43:28,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:43:28,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391678865] [2020-12-23 01:43:28,404 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:43:28,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:43:28,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:43:28,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:43:28,410 INFO L87 Difference]: Start difference. First operand 357 states and 489 transitions. Second operand 3 states. [2020-12-23 01:43:30,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:43:30,691 INFO L93 Difference]: Finished difference Result 465 states and 625 transitions. [2020-12-23 01:43:30,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:43:30,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-12-23 01:43:30,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:43:30,695 INFO L225 Difference]: With dead ends: 465 [2020-12-23 01:43:30,695 INFO L226 Difference]: Without dead ends: 400 [2020-12-23 01:43:30,696 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:43:30,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2020-12-23 01:43:30,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 383. [2020-12-23 01:43:30,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-12-23 01:43:30,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 526 transitions. [2020-12-23 01:43:30,718 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 526 transitions. Word has length 23 [2020-12-23 01:43:30,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:43:30,719 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 526 transitions. [2020-12-23 01:43:30,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:43:30,719 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 526 transitions. [2020-12-23 01:43:30,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-23 01:43:30,721 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:43:30,721 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:43:30,721 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 01:43:30,722 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:43:30,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:43:30,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1383977505, now seen corresponding path program 1 times [2020-12-23 01:43:30,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:43:30,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753740280] [2020-12-23 01:43:30,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:43:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:43:30,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:43:30,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753740280] [2020-12-23 01:43:30,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:43:30,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:43:30,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509990368] [2020-12-23 01:43:30,826 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:43:30,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:43:30,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:43:30,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:43:30,827 INFO L87 Difference]: Start difference. First operand 383 states and 526 transitions. Second operand 3 states. [2020-12-23 01:43:30,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:43:30,873 INFO L93 Difference]: Finished difference Result 467 states and 640 transitions. [2020-12-23 01:43:30,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:43:30,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-12-23 01:43:30,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:43:30,876 INFO L225 Difference]: With dead ends: 467 [2020-12-23 01:43:30,876 INFO L226 Difference]: Without dead ends: 384 [2020-12-23 01:43:30,877 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:43:30,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2020-12-23 01:43:30,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2020-12-23 01:43:30,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2020-12-23 01:43:30,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 527 transitions. [2020-12-23 01:43:30,897 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 527 transitions. Word has length 28 [2020-12-23 01:43:30,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:43:30,897 INFO L481 AbstractCegarLoop]: Abstraction has 384 states and 527 transitions. [2020-12-23 01:43:30,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:43:30,898 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 527 transitions. [2020-12-23 01:43:30,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-23 01:43:30,899 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:43:30,899 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:43:30,899 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 01:43:30,900 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:43:30,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:43:30,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1992526103, now seen corresponding path program 1 times [2020-12-23 01:43:30,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:43:30,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253885013] [2020-12-23 01:43:30,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:43:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:43:31,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:43:31,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253885013] [2020-12-23 01:43:31,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:43:31,032 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:43:31,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127573129] [2020-12-23 01:43:31,033 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:43:31,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:43:31,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:43:31,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:43:31,034 INFO L87 Difference]: Start difference. First operand 384 states and 527 transitions. Second operand 3 states. [2020-12-23 01:43:31,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:43:31,095 INFO L93 Difference]: Finished difference Result 580 states and 779 transitions. [2020-12-23 01:43:31,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:43:31,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2020-12-23 01:43:31,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:43:31,100 INFO L225 Difference]: With dead ends: 580 [2020-12-23 01:43:31,100 INFO L226 Difference]: Without dead ends: 393 [2020-12-23 01:43:31,101 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:43:31,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2020-12-23 01:43:31,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 340. [2020-12-23 01:43:31,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2020-12-23 01:43:31,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 469 transitions. [2020-12-23 01:43:31,126 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 469 transitions. Word has length 29 [2020-12-23 01:43:31,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:43:31,126 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 469 transitions. [2020-12-23 01:43:31,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:43:31,126 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 469 transitions. [2020-12-23 01:43:31,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-23 01:43:31,128 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:43:31,129 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:43:31,129 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 01:43:31,129 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:43:31,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:43:31,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1953514739, now seen corresponding path program 1 times [2020-12-23 01:43:31,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:43:31,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362369052] [2020-12-23 01:43:31,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:43:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:43:31,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:43:31,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362369052] [2020-12-23 01:43:31,222 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:43:31,222 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:43:31,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733572224] [2020-12-23 01:43:31,223 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:43:31,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:43:31,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:43:31,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:43:31,224 INFO L87 Difference]: Start difference. First operand 340 states and 469 transitions. Second operand 3 states. [2020-12-23 01:43:33,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:43:33,413 INFO L93 Difference]: Finished difference Result 340 states and 469 transitions. [2020-12-23 01:43:33,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:43:33,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2020-12-23 01:43:33,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:43:33,416 INFO L225 Difference]: With dead ends: 340 [2020-12-23 01:43:33,416 INFO L226 Difference]: Without dead ends: 326 [2020-12-23 01:43:33,417 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:43:33,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2020-12-23 01:43:33,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2020-12-23 01:43:33,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2020-12-23 01:43:33,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 455 transitions. [2020-12-23 01:43:33,436 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 455 transitions. Word has length 30 [2020-12-23 01:43:33,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:43:33,436 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 455 transitions. [2020-12-23 01:43:33,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:43:33,437 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 455 transitions. [2020-12-23 01:43:33,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-23 01:43:33,438 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:43:33,438 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:43:33,438 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 01:43:33,438 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:43:33,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:43:33,439 INFO L82 PathProgramCache]: Analyzing trace with hash -865410036, now seen corresponding path program 1 times [2020-12-23 01:43:33,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:43:33,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873516321] [2020-12-23 01:43:33,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:43:33,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:43:33,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:43:33,628 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873516321] [2020-12-23 01:43:33,628 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:43:33,628 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:43:33,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698045952] [2020-12-23 01:43:33,629 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:43:33,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:43:33,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:43:33,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:43:33,630 INFO L87 Difference]: Start difference. First operand 326 states and 455 transitions. Second operand 4 states. [2020-12-23 01:43:35,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:43:35,957 INFO L93 Difference]: Finished difference Result 351 states and 480 transitions. [2020-12-23 01:43:35,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:43:35,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2020-12-23 01:43:35,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:43:35,960 INFO L225 Difference]: With dead ends: 351 [2020-12-23 01:43:35,960 INFO L226 Difference]: Without dead ends: 343 [2020-12-23 01:43:35,961 INFO L677 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 [2020-12-23 01:43:35,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2020-12-23 01:43:35,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 331. [2020-12-23 01:43:35,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2020-12-23 01:43:35,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 461 transitions. [2020-12-23 01:43:35,985 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 461 transitions. Word has length 30 [2020-12-23 01:43:35,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:43:35,986 INFO L481 AbstractCegarLoop]: Abstraction has 331 states and 461 transitions. [2020-12-23 01:43:35,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:43:35,986 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 461 transitions. [2020-12-23 01:43:35,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-23 01:43:35,987 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:43:35,987 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:43:35,987 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 01:43:35,989 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:43:35,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:43:35,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1071046773, now seen corresponding path program 1 times [2020-12-23 01:43:35,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:43:35,994 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853980312] [2020-12-23 01:43:35,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:43:36,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:43:36,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:43:36,206 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853980312] [2020-12-23 01:43:36,206 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:43:36,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:43:36,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983355952] [2020-12-23 01:43:36,207 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:43:36,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:43:36,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:43:36,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:43:36,209 INFO L87 Difference]: Start difference. First operand 331 states and 461 transitions. Second operand 4 states. [2020-12-23 01:43:38,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:43:38,473 INFO L93 Difference]: Finished difference Result 351 states and 479 transitions. [2020-12-23 01:43:38,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:43:38,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2020-12-23 01:43:38,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:43:38,476 INFO L225 Difference]: With dead ends: 351 [2020-12-23 01:43:38,476 INFO L226 Difference]: Without dead ends: 343 [2020-12-23 01:43:38,477 INFO L677 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 [2020-12-23 01:43:38,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2020-12-23 01:43:38,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 332. [2020-12-23 01:43:38,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2020-12-23 01:43:38,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 462 transitions. [2020-12-23 01:43:38,500 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 462 transitions. Word has length 31 [2020-12-23 01:43:38,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:43:38,500 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 462 transitions. [2020-12-23 01:43:38,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:43:38,501 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 462 transitions. [2020-12-23 01:43:38,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-12-23 01:43:38,502 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:43:38,502 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:43:38,502 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 01:43:38,502 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:43:38,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:43:38,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1149600725, now seen corresponding path program 1 times [2020-12-23 01:43:38,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:43:38,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070874753] [2020-12-23 01:43:38,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:43:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:43:38,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:43:38,649 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070874753] [2020-12-23 01:43:38,649 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:43:38,649 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 01:43:38,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619218432] [2020-12-23 01:43:38,650 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 01:43:38,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:43:38,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 01:43:38,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-23 01:43:38,651 INFO L87 Difference]: Start difference. First operand 332 states and 462 transitions. Second operand 6 states. [2020-12-23 01:43:43,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:43:43,108 INFO L93 Difference]: Finished difference Result 352 states and 482 transitions. [2020-12-23 01:43:43,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 01:43:43,109 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2020-12-23 01:43:43,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:43:43,110 INFO L225 Difference]: With dead ends: 352 [2020-12-23 01:43:43,111 INFO L226 Difference]: Without dead ends: 299 [2020-12-23 01:43:43,111 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-23 01:43:43,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-12-23 01:43:43,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2020-12-23 01:43:43,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2020-12-23 01:43:43,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 415 transitions. [2020-12-23 01:43:43,131 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 415 transitions. Word has length 32 [2020-12-23 01:43:43,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:43:43,131 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 415 transitions. [2020-12-23 01:43:43,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 01:43:43,131 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 415 transitions. [2020-12-23 01:43:43,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-23 01:43:43,132 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:43:43,132 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:43:43,133 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 01:43:43,133 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:43:43,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:43:43,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1880920567, now seen corresponding path program 1 times [2020-12-23 01:43:43,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:43:43,134 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026298606] [2020-12-23 01:43:43,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:43:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:43:43,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:43:43,304 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026298606] [2020-12-23 01:43:43,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:43:43,305 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:43:43,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180485150] [2020-12-23 01:43:43,305 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:43:43,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:43:43,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:43:43,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:43:43,306 INFO L87 Difference]: Start difference. First operand 297 states and 415 transitions. Second operand 4 states. [2020-12-23 01:43:45,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:43:45,536 INFO L93 Difference]: Finished difference Result 323 states and 445 transitions. [2020-12-23 01:43:45,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:43:45,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2020-12-23 01:43:45,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:43:45,539 INFO L225 Difference]: With dead ends: 323 [2020-12-23 01:43:45,540 INFO L226 Difference]: Without dead ends: 315 [2020-12-23 01:43:45,540 INFO L677 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 [2020-12-23 01:43:45,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2020-12-23 01:43:45,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 308. [2020-12-23 01:43:45,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2020-12-23 01:43:45,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 429 transitions. [2020-12-23 01:43:45,562 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 429 transitions. Word has length 38 [2020-12-23 01:43:45,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:43:45,562 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 429 transitions. [2020-12-23 01:43:45,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:43:45,563 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 429 transitions. [2020-12-23 01:43:45,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-12-23 01:43:45,563 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:43:45,564 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:43:45,564 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 01:43:45,564 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:43:45,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:43:45,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1807865134, now seen corresponding path program 1 times [2020-12-23 01:43:45,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:43:45,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899145624] [2020-12-23 01:43:45,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:43:45,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:43:45,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:43:45,739 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899145624] [2020-12-23 01:43:45,739 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:43:45,739 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:43:45,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567148846] [2020-12-23 01:43:45,740 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:43:45,740 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:43:45,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:43:45,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:43:45,741 INFO L87 Difference]: Start difference. First operand 308 states and 429 transitions. Second operand 4 states. [2020-12-23 01:43:47,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:43:47,953 INFO L93 Difference]: Finished difference Result 323 states and 444 transitions. [2020-12-23 01:43:47,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:43:47,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-12-23 01:43:47,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:43:47,956 INFO L225 Difference]: With dead ends: 323 [2020-12-23 01:43:47,956 INFO L226 Difference]: Without dead ends: 315 [2020-12-23 01:43:47,957 INFO L677 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 [2020-12-23 01:43:47,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2020-12-23 01:43:47,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 309. [2020-12-23 01:43:47,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2020-12-23 01:43:47,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 430 transitions. [2020-12-23 01:43:47,980 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 430 transitions. Word has length 39 [2020-12-23 01:43:47,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:43:47,980 INFO L481 AbstractCegarLoop]: Abstraction has 309 states and 430 transitions. [2020-12-23 01:43:47,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:43:47,981 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 430 transitions. [2020-12-23 01:43:47,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-23 01:43:47,982 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:43:47,982 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:43:47,982 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 01:43:47,982 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:43:47,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:43:47,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1438598816, now seen corresponding path program 1 times [2020-12-23 01:43:47,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:43:47,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180749352] [2020-12-23 01:43:47,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:43:48,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:43:48,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:43:48,157 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180749352] [2020-12-23 01:43:48,157 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:43:48,157 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:43:48,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277395049] [2020-12-23 01:43:48,158 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:43:48,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:43:48,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:43:48,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:43:48,159 INFO L87 Difference]: Start difference. First operand 309 states and 430 transitions. Second operand 4 states. [2020-12-23 01:43:48,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:43:48,377 INFO L93 Difference]: Finished difference Result 371 states and 499 transitions. [2020-12-23 01:43:48,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:43:48,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2020-12-23 01:43:48,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:43:48,386 INFO L225 Difference]: With dead ends: 371 [2020-12-23 01:43:48,386 INFO L226 Difference]: Without dead ends: 330 [2020-12-23 01:43:48,387 INFO L677 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 [2020-12-23 01:43:48,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2020-12-23 01:43:48,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 309. [2020-12-23 01:43:48,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2020-12-23 01:43:48,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 423 transitions. [2020-12-23 01:43:48,409 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 423 transitions. Word has length 40 [2020-12-23 01:43:48,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:43:48,410 INFO L481 AbstractCegarLoop]: Abstraction has 309 states and 423 transitions. [2020-12-23 01:43:48,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:43:48,410 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 423 transitions. [2020-12-23 01:43:48,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-23 01:43:48,411 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:43:48,411 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:43:48,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 01:43:48,411 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:43:48,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:43:48,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1816693626, now seen corresponding path program 1 times [2020-12-23 01:43:48,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:43:48,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833503532] [2020-12-23 01:43:48,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:43:48,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:43:48,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 01:43:48,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833503532] [2020-12-23 01:43:48,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:43:48,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:43:48,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78713777] [2020-12-23 01:43:48,501 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:43:48,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:43:48,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:43:48,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:43:48,502 INFO L87 Difference]: Start difference. First operand 309 states and 423 transitions. Second operand 4 states. [2020-12-23 01:43:48,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:43:48,553 INFO L93 Difference]: Finished difference Result 408 states and 551 transitions. [2020-12-23 01:43:48,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:43:48,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2020-12-23 01:43:48,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:43:48,555 INFO L225 Difference]: With dead ends: 408 [2020-12-23 01:43:48,556 INFO L226 Difference]: Without dead ends: 328 [2020-12-23 01:43:48,556 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:43:48,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2020-12-23 01:43:48,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 310. [2020-12-23 01:43:48,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2020-12-23 01:43:48,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 424 transitions. [2020-12-23 01:43:48,579 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 424 transitions. Word has length 40 [2020-12-23 01:43:48,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:43:48,580 INFO L481 AbstractCegarLoop]: Abstraction has 310 states and 424 transitions. [2020-12-23 01:43:48,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:43:48,580 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 424 transitions. [2020-12-23 01:43:48,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-23 01:43:48,581 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:43:48,581 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:43:48,581 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 01:43:48,581 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:43:48,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:43:48,582 INFO L82 PathProgramCache]: Analyzing trace with hash 201556626, now seen corresponding path program 1 times [2020-12-23 01:43:48,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:43:48,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108858190] [2020-12-23 01:43:48,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:43:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:43:48,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:43:48,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108858190] [2020-12-23 01:43:48,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:43:48,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:43:48,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036497827] [2020-12-23 01:43:48,661 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:43:48,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:43:48,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:43:48,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:43:48,662 INFO L87 Difference]: Start difference. First operand 310 states and 424 transitions. Second operand 3 states. [2020-12-23 01:43:48,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:43:48,709 INFO L93 Difference]: Finished difference Result 326 states and 444 transitions. [2020-12-23 01:43:48,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:43:48,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2020-12-23 01:43:48,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:43:48,711 INFO L225 Difference]: With dead ends: 326 [2020-12-23 01:43:48,712 INFO L226 Difference]: Without dead ends: 303 [2020-12-23 01:43:48,712 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:43:48,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2020-12-23 01:43:48,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2020-12-23 01:43:48,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2020-12-23 01:43:48,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 413 transitions. [2020-12-23 01:43:48,736 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 413 transitions. Word has length 40 [2020-12-23 01:43:48,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:43:48,736 INFO L481 AbstractCegarLoop]: Abstraction has 303 states and 413 transitions. [2020-12-23 01:43:48,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:43:48,736 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 413 transitions. [2020-12-23 01:43:48,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-23 01:43:48,737 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:43:48,737 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:43:48,737 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 01:43:48,738 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:43:48,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:43:48,738 INFO L82 PathProgramCache]: Analyzing trace with hash 249426005, now seen corresponding path program 1 times [2020-12-23 01:43:48,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:43:48,739 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341973885] [2020-12-23 01:43:48,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:43:48,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:43:48,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 01:43:48,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341973885] [2020-12-23 01:43:48,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:43:48,851 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:43:48,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98347242] [2020-12-23 01:43:48,852 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:43:48,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:43:48,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:43:48,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:43:48,852 INFO L87 Difference]: Start difference. First operand 303 states and 413 transitions. Second operand 3 states. [2020-12-23 01:43:50,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:43:50,999 INFO L93 Difference]: Finished difference Result 345 states and 465 transitions. [2020-12-23 01:43:50,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:43:50,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2020-12-23 01:43:51,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:43:51,001 INFO L225 Difference]: With dead ends: 345 [2020-12-23 01:43:51,001 INFO L226 Difference]: Without dead ends: 300 [2020-12-23 01:43:51,002 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:43:51,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2020-12-23 01:43:51,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2020-12-23 01:43:51,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2020-12-23 01:43:51,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 409 transitions. [2020-12-23 01:43:51,024 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 409 transitions. Word has length 41 [2020-12-23 01:43:51,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:43:51,024 INFO L481 AbstractCegarLoop]: Abstraction has 300 states and 409 transitions. [2020-12-23 01:43:51,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:43:51,025 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 409 transitions. [2020-12-23 01:43:51,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-23 01:43:51,025 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:43:51,026 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:43:51,026 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 01:43:51,026 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:43:51,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:43:51,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1909865667, now seen corresponding path program 1 times [2020-12-23 01:43:51,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:43:51,027 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39249677] [2020-12-23 01:43:51,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:43:51,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:43:51,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 01:43:51,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39249677] [2020-12-23 01:43:51,106 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:43:51,106 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:43:51,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330082385] [2020-12-23 01:43:51,107 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:43:51,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:43:51,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:43:51,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:43:51,108 INFO L87 Difference]: Start difference. First operand 300 states and 409 transitions. Second operand 3 states. [2020-12-23 01:43:53,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:43:53,171 INFO L93 Difference]: Finished difference Result 361 states and 482 transitions. [2020-12-23 01:43:53,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:43:53,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2020-12-23 01:43:53,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:43:53,174 INFO L225 Difference]: With dead ends: 361 [2020-12-23 01:43:53,174 INFO L226 Difference]: Without dead ends: 313 [2020-12-23 01:43:53,175 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:43:53,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2020-12-23 01:43:53,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 300. [2020-12-23 01:43:53,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2020-12-23 01:43:53,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 408 transitions. [2020-12-23 01:43:53,195 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 408 transitions. Word has length 41 [2020-12-23 01:43:53,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:43:53,196 INFO L481 AbstractCegarLoop]: Abstraction has 300 states and 408 transitions. [2020-12-23 01:43:53,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:43:53,196 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 408 transitions. [2020-12-23 01:43:53,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-23 01:43:53,197 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:43:53,197 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:43:53,197 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 01:43:53,197 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:43:53,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:43:53,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1953658895, now seen corresponding path program 1 times [2020-12-23 01:43:53,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:43:53,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451366368] [2020-12-23 01:43:53,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:43:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:43:53,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:43:53,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451366368] [2020-12-23 01:43:53,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:43:53,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 01:43:53,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294776580] [2020-12-23 01:43:53,294 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 01:43:53,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:43:53,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 01:43:53,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:43:53,295 INFO L87 Difference]: Start difference. First operand 300 states and 408 transitions. Second operand 5 states. [2020-12-23 01:43:55,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:43:55,447 INFO L93 Difference]: Finished difference Result 344 states and 459 transitions. [2020-12-23 01:43:55,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 01:43:55,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2020-12-23 01:43:55,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:43:55,449 INFO L225 Difference]: With dead ends: 344 [2020-12-23 01:43:55,450 INFO L226 Difference]: Without dead ends: 299 [2020-12-23 01:43:55,450 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 01:43:55,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2020-12-23 01:43:55,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2020-12-23 01:43:55,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2020-12-23 01:43:55,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 403 transitions. [2020-12-23 01:43:55,471 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 403 transitions. Word has length 41 [2020-12-23 01:43:55,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:43:55,471 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 403 transitions. [2020-12-23 01:43:55,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 01:43:55,471 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 403 transitions. [2020-12-23 01:43:55,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-12-23 01:43:55,472 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:43:55,472 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:43:55,472 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 01:43:55,473 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:43:55,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:43:55,473 INFO L82 PathProgramCache]: Analyzing trace with hash -480741563, now seen corresponding path program 1 times [2020-12-23 01:43:55,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:43:55,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912466973] [2020-12-23 01:43:55,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:43:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:43:55,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:43:55,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912466973] [2020-12-23 01:43:55,583 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:43:55,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:43:55,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142201667] [2020-12-23 01:43:55,584 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:43:55,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:43:55,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:43:55,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:43:55,585 INFO L87 Difference]: Start difference. First operand 299 states and 403 transitions. Second operand 3 states. [2020-12-23 01:43:55,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:43:55,612 INFO L93 Difference]: Finished difference Result 325 states and 431 transitions. [2020-12-23 01:43:55,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:43:55,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2020-12-23 01:43:55,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:43:55,614 INFO L225 Difference]: With dead ends: 325 [2020-12-23 01:43:55,614 INFO L226 Difference]: Without dead ends: 309 [2020-12-23 01:43:55,615 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:43:55,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2020-12-23 01:43:55,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 296. [2020-12-23 01:43:55,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2020-12-23 01:43:55,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 399 transitions. [2020-12-23 01:43:55,638 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 399 transitions. Word has length 42 [2020-12-23 01:43:55,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:43:55,638 INFO L481 AbstractCegarLoop]: Abstraction has 296 states and 399 transitions. [2020-12-23 01:43:55,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:43:55,638 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 399 transitions. [2020-12-23 01:43:55,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-12-23 01:43:55,639 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:43:55,639 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:43:55,639 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 01:43:55,640 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:43:55,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:43:55,640 INFO L82 PathProgramCache]: Analyzing trace with hash 370151206, now seen corresponding path program 1 times [2020-12-23 01:43:55,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:43:55,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003055864] [2020-12-23 01:43:55,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:43:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:43:55,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:43:55,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003055864] [2020-12-23 01:43:55,720 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:43:55,720 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:43:55,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913581309] [2020-12-23 01:43:55,720 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:43:55,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:43:55,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:43:55,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:43:55,721 INFO L87 Difference]: Start difference. First operand 296 states and 399 transitions. Second operand 3 states. [2020-12-23 01:43:55,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:43:55,915 INFO L93 Difference]: Finished difference Result 469 states and 611 transitions. [2020-12-23 01:43:55,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:43:55,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2020-12-23 01:43:55,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:43:55,918 INFO L225 Difference]: With dead ends: 469 [2020-12-23 01:43:55,918 INFO L226 Difference]: Without dead ends: 394 [2020-12-23 01:43:55,919 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:43:55,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2020-12-23 01:43:55,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 311. [2020-12-23 01:43:55,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2020-12-23 01:43:55,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 415 transitions. [2020-12-23 01:43:55,952 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 415 transitions. Word has length 43 [2020-12-23 01:43:55,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:43:55,952 INFO L481 AbstractCegarLoop]: Abstraction has 311 states and 415 transitions. [2020-12-23 01:43:55,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:43:55,953 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 415 transitions. [2020-12-23 01:43:55,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-12-23 01:43:55,954 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:43:55,954 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:43:55,954 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 01:43:55,955 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:43:55,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:43:55,955 INFO L82 PathProgramCache]: Analyzing trace with hash -243642330, now seen corresponding path program 1 times [2020-12-23 01:43:55,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:43:55,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509840978] [2020-12-23 01:43:55,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:43:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:43:56,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:43:56,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509840978] [2020-12-23 01:43:56,100 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:43:56,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 01:43:56,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981800952] [2020-12-23 01:43:56,101 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 01:43:56,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:43:56,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 01:43:56,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 01:43:56,102 INFO L87 Difference]: Start difference. First operand 311 states and 415 transitions. Second operand 7 states. [2020-12-23 01:43:58,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:43:58,517 INFO L93 Difference]: Finished difference Result 420 states and 546 transitions. [2020-12-23 01:43:58,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 01:43:58,518 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2020-12-23 01:43:58,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:43:58,520 INFO L225 Difference]: With dead ends: 420 [2020-12-23 01:43:58,520 INFO L226 Difference]: Without dead ends: 391 [2020-12-23 01:43:58,520 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-12-23 01:43:58,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2020-12-23 01:43:58,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 305. [2020-12-23 01:43:58,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2020-12-23 01:43:58,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 407 transitions. [2020-12-23 01:43:58,542 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 407 transitions. Word has length 43 [2020-12-23 01:43:58,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:43:58,542 INFO L481 AbstractCegarLoop]: Abstraction has 305 states and 407 transitions. [2020-12-23 01:43:58,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 01:43:58,543 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 407 transitions. [2020-12-23 01:43:58,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-23 01:43:58,544 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:43:58,544 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:43:58,544 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 01:43:58,544 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:43:58,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:43:58,545 INFO L82 PathProgramCache]: Analyzing trace with hash -693282345, now seen corresponding path program 1 times [2020-12-23 01:43:58,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:43:58,545 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346671184] [2020-12-23 01:43:58,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:43:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:43:58,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:43:58,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346671184] [2020-12-23 01:43:58,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:43:58,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:43:58,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886591525] [2020-12-23 01:43:58,638 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:43:58,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:43:58,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:43:58,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:43:58,639 INFO L87 Difference]: Start difference. First operand 305 states and 407 transitions. Second operand 3 states. [2020-12-23 01:43:58,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:43:58,816 INFO L93 Difference]: Finished difference Result 478 states and 619 transitions. [2020-12-23 01:43:58,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:43:58,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2020-12-23 01:43:58,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:43:58,819 INFO L225 Difference]: With dead ends: 478 [2020-12-23 01:43:58,819 INFO L226 Difference]: Without dead ends: 403 [2020-12-23 01:43:58,820 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:43:58,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2020-12-23 01:43:58,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 309. [2020-12-23 01:43:58,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2020-12-23 01:43:58,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 411 transitions. [2020-12-23 01:43:58,850 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 411 transitions. Word has length 44 [2020-12-23 01:43:58,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:43:58,850 INFO L481 AbstractCegarLoop]: Abstraction has 309 states and 411 transitions. [2020-12-23 01:43:58,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:43:58,851 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 411 transitions. [2020-12-23 01:43:58,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-23 01:43:58,852 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:43:58,852 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:43:58,852 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 01:43:58,853 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:43:58,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:43:58,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1307075881, now seen corresponding path program 1 times [2020-12-23 01:43:58,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:43:58,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693458712] [2020-12-23 01:43:58,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:43:58,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:43:59,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:43:59,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693458712] [2020-12-23 01:43:59,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:43:59,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:43:59,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080358540] [2020-12-23 01:43:59,018 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:43:59,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:43:59,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:43:59,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:43:59,019 INFO L87 Difference]: Start difference. First operand 309 states and 411 transitions. Second operand 4 states. [2020-12-23 01:43:59,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:43:59,203 INFO L93 Difference]: Finished difference Result 347 states and 451 transitions. [2020-12-23 01:43:59,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:43:59,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2020-12-23 01:43:59,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:43:59,205 INFO L225 Difference]: With dead ends: 347 [2020-12-23 01:43:59,205 INFO L226 Difference]: Without dead ends: 280 [2020-12-23 01:43:59,206 INFO L677 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 [2020-12-23 01:43:59,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-12-23 01:43:59,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2020-12-23 01:43:59,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2020-12-23 01:43:59,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 364 transitions. [2020-12-23 01:43:59,228 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 364 transitions. Word has length 44 [2020-12-23 01:43:59,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:43:59,228 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 364 transitions. [2020-12-23 01:43:59,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:43:59,228 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 364 transitions. [2020-12-23 01:43:59,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-23 01:43:59,229 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:43:59,229 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:43:59,229 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 01:43:59,230 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:43:59,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:43:59,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1507726140, now seen corresponding path program 1 times [2020-12-23 01:43:59,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:43:59,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932582316] [2020-12-23 01:43:59,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:43:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:43:59,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 01:43:59,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932582316] [2020-12-23 01:43:59,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:43:59,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 01:43:59,354 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278404025] [2020-12-23 01:43:59,354 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 01:43:59,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:43:59,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 01:43:59,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:43:59,355 INFO L87 Difference]: Start difference. First operand 280 states and 364 transitions. Second operand 5 states. [2020-12-23 01:43:59,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:43:59,582 INFO L93 Difference]: Finished difference Result 373 states and 478 transitions. [2020-12-23 01:43:59,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 01:43:59,583 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2020-12-23 01:43:59,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:43:59,585 INFO L225 Difference]: With dead ends: 373 [2020-12-23 01:43:59,585 INFO L226 Difference]: Without dead ends: 330 [2020-12-23 01:43:59,585 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 01:43:59,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2020-12-23 01:43:59,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 292. [2020-12-23 01:43:59,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2020-12-23 01:43:59,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 377 transitions. [2020-12-23 01:43:59,608 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 377 transitions. Word has length 44 [2020-12-23 01:43:59,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:43:59,608 INFO L481 AbstractCegarLoop]: Abstraction has 292 states and 377 transitions. [2020-12-23 01:43:59,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 01:43:59,609 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 377 transitions. [2020-12-23 01:43:59,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-23 01:43:59,609 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:43:59,610 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:43:59,610 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 01:43:59,610 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:43:59,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:43:59,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1353012916, now seen corresponding path program 1 times [2020-12-23 01:43:59,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:43:59,611 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576949837] [2020-12-23 01:43:59,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:43:59,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:43:59,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 01:43:59,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576949837] [2020-12-23 01:43:59,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:43:59,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:43:59,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828292196] [2020-12-23 01:43:59,756 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:43:59,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:43:59,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:43:59,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:43:59,757 INFO L87 Difference]: Start difference. First operand 292 states and 377 transitions. Second operand 4 states. [2020-12-23 01:43:59,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:43:59,935 INFO L93 Difference]: Finished difference Result 326 states and 422 transitions. [2020-12-23 01:43:59,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:43:59,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2020-12-23 01:43:59,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:43:59,937 INFO L225 Difference]: With dead ends: 326 [2020-12-23 01:43:59,937 INFO L226 Difference]: Without dead ends: 148 [2020-12-23 01:43:59,938 INFO L677 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 [2020-12-23 01:43:59,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-12-23 01:43:59,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 122. [2020-12-23 01:43:59,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-12-23 01:43:59,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 153 transitions. [2020-12-23 01:43:59,951 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 153 transitions. Word has length 45 [2020-12-23 01:43:59,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:43:59,951 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 153 transitions. [2020-12-23 01:43:59,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:43:59,951 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 153 transitions. [2020-12-23 01:43:59,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-23 01:43:59,952 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:43:59,952 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:43:59,952 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 01:43:59,952 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:43:59,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:43:59,953 INFO L82 PathProgramCache]: Analyzing trace with hash 760190907, now seen corresponding path program 1 times [2020-12-23 01:43:59,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:43:59,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400249007] [2020-12-23 01:43:59,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:43:59,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:44:00,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 01:44:00,100 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400249007] [2020-12-23 01:44:00,100 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:44:00,100 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:44:00,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419242963] [2020-12-23 01:44:00,101 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:44:00,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:44:00,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:44:00,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:44:00,102 INFO L87 Difference]: Start difference. First operand 122 states and 153 transitions. Second operand 3 states. [2020-12-23 01:44:00,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:44:00,140 INFO L93 Difference]: Finished difference Result 238 states and 299 transitions. [2020-12-23 01:44:00,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:44:00,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2020-12-23 01:44:00,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:44:00,143 INFO L225 Difference]: With dead ends: 238 [2020-12-23 01:44:00,143 INFO L226 Difference]: Without dead ends: 217 [2020-12-23 01:44:00,143 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:44:00,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2020-12-23 01:44:00,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 213. [2020-12-23 01:44:00,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-12-23 01:44:00,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 273 transitions. [2020-12-23 01:44:00,166 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 273 transitions. Word has length 45 [2020-12-23 01:44:00,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:44:00,166 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 273 transitions. [2020-12-23 01:44:00,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:44:00,166 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 273 transitions. [2020-12-23 01:44:00,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-12-23 01:44:00,167 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:44:00,167 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:44:00,167 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-23 01:44:00,167 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:44:00,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:44:00,168 INFO L82 PathProgramCache]: Analyzing trace with hash 760250489, now seen corresponding path program 1 times [2020-12-23 01:44:00,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:44:00,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500529781] [2020-12-23 01:44:00,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:44:00,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:44:00,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-12-23 01:44:00,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500529781] [2020-12-23 01:44:00,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771807650] [2020-12-23 01:44:00,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:44:00,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:44:00,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 01:44:00,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 01:44:00,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 01:44:00,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 01:44:00,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2020-12-23 01:44:00,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425780903] [2020-12-23 01:44:00,803 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 01:44:00,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:44:00,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 01:44:00,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-12-23 01:44:00,804 INFO L87 Difference]: Start difference. First operand 213 states and 273 transitions. Second operand 6 states. [2020-12-23 01:44:03,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:44:03,250 INFO L93 Difference]: Finished difference Result 406 states and 521 transitions. [2020-12-23 01:44:03,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 01:44:03,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2020-12-23 01:44:03,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:44:03,252 INFO L225 Difference]: With dead ends: 406 [2020-12-23 01:44:03,252 INFO L226 Difference]: Without dead ends: 207 [2020-12-23 01:44:03,252 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-12-23 01:44:03,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2020-12-23 01:44:03,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2020-12-23 01:44:03,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2020-12-23 01:44:03,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 263 transitions. [2020-12-23 01:44:03,275 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 263 transitions. Word has length 45 [2020-12-23 01:44:03,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:44:03,275 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 263 transitions. [2020-12-23 01:44:03,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 01:44:03,275 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 263 transitions. [2020-12-23 01:44:03,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-12-23 01:44:03,276 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:44:03,276 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:44:03,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2020-12-23 01:44:03,491 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:44:03,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:44:03,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1796883404, now seen corresponding path program 1 times [2020-12-23 01:44:03,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:44:03,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743493041] [2020-12-23 01:44:03,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:44:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:44:03,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 01:44:03,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743493041] [2020-12-23 01:44:03,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:44:03,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:44:03,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283342982] [2020-12-23 01:44:03,623 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:44:03,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:44:03,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:44:03,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:44:03,624 INFO L87 Difference]: Start difference. First operand 207 states and 263 transitions. Second operand 3 states. [2020-12-23 01:44:03,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:44:03,652 INFO L93 Difference]: Finished difference Result 396 states and 507 transitions. [2020-12-23 01:44:03,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:44:03,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-12-23 01:44:03,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:44:03,654 INFO L225 Difference]: With dead ends: 396 [2020-12-23 01:44:03,655 INFO L226 Difference]: Without dead ends: 209 [2020-12-23 01:44:03,657 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:44:03,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2020-12-23 01:44:03,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2020-12-23 01:44:03,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-12-23 01:44:03,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 265 transitions. [2020-12-23 01:44:03,679 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 265 transitions. Word has length 50 [2020-12-23 01:44:03,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:44:03,679 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 265 transitions. [2020-12-23 01:44:03,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:44:03,679 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 265 transitions. [2020-12-23 01:44:03,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-12-23 01:44:03,680 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:44:03,680 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:44:03,680 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-23 01:44:03,680 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:44:03,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:44:03,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1230540090, now seen corresponding path program 1 times [2020-12-23 01:44:03,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:44:03,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322828043] [2020-12-23 01:44:03,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:44:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:44:03,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 01:44:03,813 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322828043] [2020-12-23 01:44:03,813 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197603641] [2020-12-23 01:44:03,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:44:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:44:04,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 730 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 01:44:04,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 01:44:04,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-12-23 01:44:04,291 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 01:44:04,291 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2020-12-23 01:44:04,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13302650] [2020-12-23 01:44:04,292 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 01:44:04,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:44:04,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 01:44:04,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-12-23 01:44:04,293 INFO L87 Difference]: Start difference. First operand 209 states and 265 transitions. Second operand 7 states. [2020-12-23 01:44:04,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:44:04,429 INFO L93 Difference]: Finished difference Result 400 states and 513 transitions. [2020-12-23 01:44:04,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 01:44:04,430 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2020-12-23 01:44:04,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:44:04,432 INFO L225 Difference]: With dead ends: 400 [2020-12-23 01:44:04,432 INFO L226 Difference]: Without dead ends: 213 [2020-12-23 01:44:04,433 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-12-23 01:44:04,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2020-12-23 01:44:04,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2020-12-23 01:44:04,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-12-23 01:44:04,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 269 transitions. [2020-12-23 01:44:04,457 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 269 transitions. Word has length 51 [2020-12-23 01:44:04,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:44:04,457 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 269 transitions. [2020-12-23 01:44:04,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 01:44:04,457 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 269 transitions. [2020-12-23 01:44:04,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-12-23 01:44:04,458 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:44:04,458 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:44:04,671 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2020-12-23 01:44:04,672 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:44:04,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:44:04,673 INFO L82 PathProgramCache]: Analyzing trace with hash 951295051, now seen corresponding path program 2 times [2020-12-23 01:44:04,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:44:04,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599102102] [2020-12-23 01:44:04,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:44:04,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:44:04,861 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-23 01:44:04,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599102102] [2020-12-23 01:44:04,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862476084] [2020-12-23 01:44:04,862 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:44:06,801 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 01:44:06,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 01:44:06,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-23 01:44:06,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 01:44:06,892 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-23 01:44:06,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 01:44:06,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2020-12-23 01:44:06,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463394186] [2020-12-23 01:44:06,893 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:44:06,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:44:06,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:44:06,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-23 01:44:06,894 INFO L87 Difference]: Start difference. First operand 213 states and 269 transitions. Second operand 4 states. [2020-12-23 01:44:06,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:44:06,953 INFO L93 Difference]: Finished difference Result 282 states and 357 transitions. [2020-12-23 01:44:06,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:44:06,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2020-12-23 01:44:06,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:44:06,955 INFO L225 Difference]: With dead ends: 282 [2020-12-23 01:44:06,955 INFO L226 Difference]: Without dead ends: 199 [2020-12-23 01:44:06,956 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-12-23 01:44:06,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2020-12-23 01:44:06,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2020-12-23 01:44:06,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2020-12-23 01:44:06,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 249 transitions. [2020-12-23 01:44:06,979 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 249 transitions. Word has length 53 [2020-12-23 01:44:06,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:44:06,979 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 249 transitions. [2020-12-23 01:44:06,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:44:06,979 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 249 transitions. [2020-12-23 01:44:06,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-12-23 01:44:06,980 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:44:06,980 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:44:07,193 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:44:07,194 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:44:07,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:44:07,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1546149704, now seen corresponding path program 1 times [2020-12-23 01:44:07,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:44:07,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11184671] [2020-12-23 01:44:07,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:44:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:44:07,395 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-23 01:44:07,395 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11184671] [2020-12-23 01:44:07,395 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:44:07,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:44:07,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489138648] [2020-12-23 01:44:07,396 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:44:07,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:44:07,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:44:07,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:44:07,397 INFO L87 Difference]: Start difference. First operand 199 states and 249 transitions. Second operand 4 states. [2020-12-23 01:44:07,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:44:07,496 INFO L93 Difference]: Finished difference Result 260 states and 329 transitions. [2020-12-23 01:44:07,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:44:07,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2020-12-23 01:44:07,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:44:07,498 INFO L225 Difference]: With dead ends: 260 [2020-12-23 01:44:07,498 INFO L226 Difference]: Without dead ends: 191 [2020-12-23 01:44:07,499 INFO L677 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 [2020-12-23 01:44:07,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2020-12-23 01:44:07,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2020-12-23 01:44:07,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-12-23 01:44:07,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 235 transitions. [2020-12-23 01:44:07,521 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 235 transitions. Word has length 54 [2020-12-23 01:44:07,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:44:07,522 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 235 transitions. [2020-12-23 01:44:07,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:44:07,522 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 235 transitions. [2020-12-23 01:44:07,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-12-23 01:44:07,522 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:44:07,523 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:44:07,523 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-23 01:44:07,524 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:44:07,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:44:07,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1416921754, now seen corresponding path program 1 times [2020-12-23 01:44:07,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:44:07,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115898760] [2020-12-23 01:44:07,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:44:07,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:44:07,629 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-23 01:44:07,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115898760] [2020-12-23 01:44:07,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:44:07,629 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:44:07,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458298668] [2020-12-23 01:44:07,631 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:44:07,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:44:07,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:44:07,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:44:07,632 INFO L87 Difference]: Start difference. First operand 191 states and 235 transitions. Second operand 3 states. [2020-12-23 01:44:07,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:44:07,711 INFO L93 Difference]: Finished difference Result 223 states and 282 transitions. [2020-12-23 01:44:07,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:44:07,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2020-12-23 01:44:07,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:44:07,713 INFO L225 Difference]: With dead ends: 223 [2020-12-23 01:44:07,713 INFO L226 Difference]: Without dead ends: 221 [2020-12-23 01:44:07,715 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:44:07,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2020-12-23 01:44:07,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 199. [2020-12-23 01:44:07,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2020-12-23 01:44:07,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 247 transitions. [2020-12-23 01:44:07,740 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 247 transitions. Word has length 56 [2020-12-23 01:44:07,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:44:07,742 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 247 transitions. [2020-12-23 01:44:07,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:44:07,742 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 247 transitions. [2020-12-23 01:44:07,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-12-23 01:44:07,743 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:44:07,743 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:44:07,743 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-23 01:44:07,744 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:44:07,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:44:07,744 INFO L82 PathProgramCache]: Analyzing trace with hash 392716879, now seen corresponding path program 1 times [2020-12-23 01:44:07,744 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:44:07,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466207552] [2020-12-23 01:44:07,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:44:07,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:44:07,881 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-23 01:44:07,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466207552] [2020-12-23 01:44:07,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433476776] [2020-12-23 01:44:07,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:44:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:44:08,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 5 conjunts are in the unsatisfiable core [2020-12-23 01:44:08,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 01:44:08,395 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-23 01:44:08,396 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 01:44:08,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2020-12-23 01:44:08,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478597403] [2020-12-23 01:44:08,396 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 01:44:08,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:44:08,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 01:44:08,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-12-23 01:44:08,397 INFO L87 Difference]: Start difference. First operand 199 states and 247 transitions. Second operand 9 states. [2020-12-23 01:44:08,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:44:08,548 INFO L93 Difference]: Finished difference Result 378 states and 475 transitions. [2020-12-23 01:44:08,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 01:44:08,548 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2020-12-23 01:44:08,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:44:08,550 INFO L225 Difference]: With dead ends: 378 [2020-12-23 01:44:08,550 INFO L226 Difference]: Without dead ends: 203 [2020-12-23 01:44:08,550 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-12-23 01:44:08,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2020-12-23 01:44:08,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2020-12-23 01:44:08,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2020-12-23 01:44:08,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 251 transitions. [2020-12-23 01:44:08,575 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 251 transitions. Word has length 56 [2020-12-23 01:44:08,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:44:08,576 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 251 transitions. [2020-12-23 01:44:08,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 01:44:08,576 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 251 transitions. [2020-12-23 01:44:08,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-12-23 01:44:08,577 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:44:08,577 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:44:08,792 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:44:08,792 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:44:08,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:44:08,793 INFO L82 PathProgramCache]: Analyzing trace with hash -499644460, now seen corresponding path program 2 times [2020-12-23 01:44:08,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:44:08,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321767740] [2020-12-23 01:44:08,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:44:08,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:44:08,941 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-23 01:44:08,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321767740] [2020-12-23 01:44:08,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441861451] [2020-12-23 01:44:08,941 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:44:09,280 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 01:44:09,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 01:44:09,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 01:44:09,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 01:44:09,384 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-23 01:44:09,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 01:44:09,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2020-12-23 01:44:09,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759063746] [2020-12-23 01:44:09,385 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 01:44:09,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:44:09,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 01:44:09,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-12-23 01:44:09,386 INFO L87 Difference]: Start difference. First operand 203 states and 251 transitions. Second operand 5 states. [2020-12-23 01:44:09,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:44:09,531 INFO L93 Difference]: Finished difference Result 294 states and 361 transitions. [2020-12-23 01:44:09,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 01:44:09,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2020-12-23 01:44:09,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:44:09,534 INFO L225 Difference]: With dead ends: 294 [2020-12-23 01:44:09,534 INFO L226 Difference]: Without dead ends: 273 [2020-12-23 01:44:09,535 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-12-23 01:44:09,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-12-23 01:44:09,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 209. [2020-12-23 01:44:09,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-12-23 01:44:09,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 257 transitions. [2020-12-23 01:44:09,561 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 257 transitions. Word has length 58 [2020-12-23 01:44:09,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:44:09,561 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 257 transitions. [2020-12-23 01:44:09,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 01:44:09,561 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 257 transitions. [2020-12-23 01:44:09,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-23 01:44:09,562 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:44:09,562 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:44:09,771 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2020-12-23 01:44:09,772 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:44:09,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:44:09,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1419009549, now seen corresponding path program 1 times [2020-12-23 01:44:09,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:44:09,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109587876] [2020-12-23 01:44:09,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:44:09,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:44:10,055 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-23 01:44:10,055 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109587876] [2020-12-23 01:44:10,055 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:44:10,055 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 01:44:10,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611197419] [2020-12-23 01:44:10,056 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 01:44:10,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:44:10,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 01:44:10,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 01:44:10,058 INFO L87 Difference]: Start difference. First operand 209 states and 257 transitions. Second operand 4 states. [2020-12-23 01:44:12,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:44:12,156 INFO L93 Difference]: Finished difference Result 240 states and 290 transitions. [2020-12-23 01:44:12,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 01:44:12,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2020-12-23 01:44:12,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:44:12,158 INFO L225 Difference]: With dead ends: 240 [2020-12-23 01:44:12,158 INFO L226 Difference]: Without dead ends: 203 [2020-12-23 01:44:12,159 INFO L677 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 [2020-12-23 01:44:12,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2020-12-23 01:44:12,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2020-12-23 01:44:12,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2020-12-23 01:44:12,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 243 transitions. [2020-12-23 01:44:12,183 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 243 transitions. Word has length 59 [2020-12-23 01:44:12,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:44:12,183 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 243 transitions. [2020-12-23 01:44:12,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 01:44:12,184 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 243 transitions. [2020-12-23 01:44:12,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-23 01:44:12,184 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:44:12,185 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:44:12,185 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-12-23 01:44:12,185 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:44:12,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:44:12,185 INFO L82 PathProgramCache]: Analyzing trace with hash 410310603, now seen corresponding path program 1 times [2020-12-23 01:44:12,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:44:12,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368919638] [2020-12-23 01:44:12,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:44:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:44:12,346 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-23 01:44:12,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368919638] [2020-12-23 01:44:12,347 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:44:12,347 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:44:12,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334552590] [2020-12-23 01:44:12,348 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:44:12,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:44:12,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:44:12,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:44:12,349 INFO L87 Difference]: Start difference. First operand 203 states and 243 transitions. Second operand 3 states. [2020-12-23 01:44:14,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:44:14,401 INFO L93 Difference]: Finished difference Result 277 states and 326 transitions. [2020-12-23 01:44:14,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:44:14,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2020-12-23 01:44:14,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:44:14,403 INFO L225 Difference]: With dead ends: 277 [2020-12-23 01:44:14,403 INFO L226 Difference]: Without dead ends: 226 [2020-12-23 01:44:14,404 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:44:14,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2020-12-23 01:44:14,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 197. [2020-12-23 01:44:14,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2020-12-23 01:44:14,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 232 transitions. [2020-12-23 01:44:14,427 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 232 transitions. Word has length 59 [2020-12-23 01:44:14,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:44:14,427 INFO L481 AbstractCegarLoop]: Abstraction has 197 states and 232 transitions. [2020-12-23 01:44:14,427 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:44:14,427 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 232 transitions. [2020-12-23 01:44:14,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-23 01:44:14,428 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:44:14,428 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:44:14,428 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-12-23 01:44:14,428 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:44:14,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:44:14,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1683349608, now seen corresponding path program 1 times [2020-12-23 01:44:14,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:44:14,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754547479] [2020-12-23 01:44:14,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:44:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:44:14,569 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-23 01:44:14,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754547479] [2020-12-23 01:44:14,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141443863] [2020-12-23 01:44:14,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:44:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:44:14,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-23 01:44:14,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 01:44:15,037 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-12-23 01:44:15,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 01:44:15,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2020-12-23 01:44:15,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881390674] [2020-12-23 01:44:15,038 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-23 01:44:15,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:44:15,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-23 01:44:15,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-12-23 01:44:15,039 INFO L87 Difference]: Start difference. First operand 197 states and 232 transitions. Second operand 11 states. [2020-12-23 01:44:15,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:44:15,246 INFO L93 Difference]: Finished difference Result 372 states and 443 transitions. [2020-12-23 01:44:15,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-23 01:44:15,247 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2020-12-23 01:44:15,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:44:15,248 INFO L225 Difference]: With dead ends: 372 [2020-12-23 01:44:15,249 INFO L226 Difference]: Without dead ends: 201 [2020-12-23 01:44:15,249 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2020-12-23 01:44:15,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2020-12-23 01:44:15,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2020-12-23 01:44:15,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2020-12-23 01:44:15,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 236 transitions. [2020-12-23 01:44:15,285 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 236 transitions. Word has length 59 [2020-12-23 01:44:15,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:44:15,285 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 236 transitions. [2020-12-23 01:44:15,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-23 01:44:15,285 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 236 transitions. [2020-12-23 01:44:15,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 01:44:15,286 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:44:15,286 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:44:15,500 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:44:15,501 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:44:15,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:44:15,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1287593427, now seen corresponding path program 2 times [2020-12-23 01:44:15,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:44:15,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962240887] [2020-12-23 01:44:15,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:44:15,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:44:15,674 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:44:15,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962240887] [2020-12-23 01:44:15,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807730642] [2020-12-23 01:44:15,675 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:44:15,974 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 01:44:15,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 01:44:15,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-23 01:44:15,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 01:44:16,061 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-12-23 01:44:16,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 01:44:16,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2020-12-23 01:44:16,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455413988] [2020-12-23 01:44:16,062 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 01:44:16,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:44:16,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 01:44:16,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-12-23 01:44:16,063 INFO L87 Difference]: Start difference. First operand 201 states and 236 transitions. Second operand 5 states. [2020-12-23 01:44:16,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:44:16,228 INFO L93 Difference]: Finished difference Result 294 states and 339 transitions. [2020-12-23 01:44:16,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 01:44:16,229 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2020-12-23 01:44:16,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:44:16,230 INFO L225 Difference]: With dead ends: 294 [2020-12-23 01:44:16,230 INFO L226 Difference]: Without dead ends: 245 [2020-12-23 01:44:16,231 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2020-12-23 01:44:16,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2020-12-23 01:44:16,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 195. [2020-12-23 01:44:16,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-12-23 01:44:16,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 224 transitions. [2020-12-23 01:44:16,259 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 224 transitions. Word has length 61 [2020-12-23 01:44:16,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:44:16,259 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 224 transitions. [2020-12-23 01:44:16,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 01:44:16,259 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 224 transitions. [2020-12-23 01:44:16,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-12-23 01:44:16,260 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:44:16,261 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:44:16,473 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2020-12-23 01:44:16,474 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:44:16,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:44:16,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1128407128, now seen corresponding path program 1 times [2020-12-23 01:44:16,475 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:44:16,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745984973] [2020-12-23 01:44:16,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:44:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:44:16,632 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-12-23 01:44:16,633 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745984973] [2020-12-23 01:44:16,633 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:44:16,633 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 01:44:16,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634390787] [2020-12-23 01:44:16,634 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 01:44:16,634 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:44:16,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 01:44:16,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:44:16,635 INFO L87 Difference]: Start difference. First operand 195 states and 224 transitions. Second operand 3 states. [2020-12-23 01:44:18,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:44:18,709 INFO L93 Difference]: Finished difference Result 224 states and 256 transitions. [2020-12-23 01:44:18,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 01:44:18,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2020-12-23 01:44:18,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:44:18,710 INFO L225 Difference]: With dead ends: 224 [2020-12-23 01:44:18,710 INFO L226 Difference]: Without dead ends: 175 [2020-12-23 01:44:18,711 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 01:44:18,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2020-12-23 01:44:18,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2020-12-23 01:44:18,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2020-12-23 01:44:18,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 197 transitions. [2020-12-23 01:44:18,732 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 197 transitions. Word has length 67 [2020-12-23 01:44:18,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:44:18,732 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 197 transitions. [2020-12-23 01:44:18,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 01:44:18,733 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 197 transitions. [2020-12-23 01:44:18,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-12-23 01:44:18,733 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:44:18,734 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:44:18,734 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-12-23 01:44:18,734 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:44:18,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:44:18,735 INFO L82 PathProgramCache]: Analyzing trace with hash 155059303, now seen corresponding path program 1 times [2020-12-23 01:44:18,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:44:18,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835393049] [2020-12-23 01:44:18,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:44:18,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:44:18,888 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-12-23 01:44:18,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835393049] [2020-12-23 01:44:18,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:44:18,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 01:44:18,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342373323] [2020-12-23 01:44:18,889 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 01:44:18,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:44:18,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 01:44:18,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 01:44:18,890 INFO L87 Difference]: Start difference. First operand 175 states and 197 transitions. Second operand 7 states. [2020-12-23 01:44:21,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:44:21,076 INFO L93 Difference]: Finished difference Result 196 states and 219 transitions. [2020-12-23 01:44:21,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 01:44:21,076 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2020-12-23 01:44:21,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:44:21,077 INFO L225 Difference]: With dead ends: 196 [2020-12-23 01:44:21,077 INFO L226 Difference]: Without dead ends: 161 [2020-12-23 01:44:21,077 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-12-23 01:44:21,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-12-23 01:44:21,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2020-12-23 01:44:21,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2020-12-23 01:44:21,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 181 transitions. [2020-12-23 01:44:21,097 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 181 transitions. Word has length 73 [2020-12-23 01:44:21,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:44:21,097 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 181 transitions. [2020-12-23 01:44:21,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 01:44:21,098 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 181 transitions. [2020-12-23 01:44:21,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-12-23 01:44:21,098 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:44:21,098 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:44:21,099 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-12-23 01:44:21,099 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:44:21,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:44:21,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1942648039, now seen corresponding path program 1 times [2020-12-23 01:44:21,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:44:21,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825885647] [2020-12-23 01:44:21,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:44:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:44:21,242 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-12-23 01:44:21,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825885647] [2020-12-23 01:44:21,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 01:44:21,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 01:44:21,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478240643] [2020-12-23 01:44:21,243 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 01:44:21,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:44:21,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 01:44:21,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 01:44:21,244 INFO L87 Difference]: Start difference. First operand 161 states and 181 transitions. Second operand 5 states. [2020-12-23 01:44:23,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:44:23,355 INFO L93 Difference]: Finished difference Result 178 states and 198 transitions. [2020-12-23 01:44:23,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 01:44:23,356 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2020-12-23 01:44:23,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:44:23,357 INFO L225 Difference]: With dead ends: 178 [2020-12-23 01:44:23,357 INFO L226 Difference]: Without dead ends: 161 [2020-12-23 01:44:23,358 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 01:44:23,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2020-12-23 01:44:23,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2020-12-23 01:44:23,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-12-23 01:44:23,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 177 transitions. [2020-12-23 01:44:23,380 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 177 transitions. Word has length 73 [2020-12-23 01:44:23,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:44:23,380 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 177 transitions. [2020-12-23 01:44:23,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 01:44:23,381 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 177 transitions. [2020-12-23 01:44:23,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-12-23 01:44:23,381 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:44:23,382 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:44:23,382 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-12-23 01:44:23,382 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:44:23,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:44:23,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1612805929, now seen corresponding path program 1 times [2020-12-23 01:44:23,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:44:23,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104202808] [2020-12-23 01:44:23,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:44:23,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:44:23,579 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:44:23,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104202808] [2020-12-23 01:44:23,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019731580] [2020-12-23 01:44:23,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:44:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:44:23,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-23 01:44:23,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 01:44:24,078 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 01:44:24,078 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 01:44:24,079 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2020-12-23 01:44:24,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770406730] [2020-12-23 01:44:24,079 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-23 01:44:24,079 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:44:24,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-23 01:44:24,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-12-23 01:44:24,080 INFO L87 Difference]: Start difference. First operand 159 states and 177 transitions. Second operand 13 states. [2020-12-23 01:44:24,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:44:24,312 INFO L93 Difference]: Finished difference Result 294 states and 331 transitions. [2020-12-23 01:44:24,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-23 01:44:24,318 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 74 [2020-12-23 01:44:24,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:44:24,319 INFO L225 Difference]: With dead ends: 294 [2020-12-23 01:44:24,319 INFO L226 Difference]: Without dead ends: 163 [2020-12-23 01:44:24,320 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2020-12-23 01:44:24,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2020-12-23 01:44:24,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2020-12-23 01:44:24,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-12-23 01:44:24,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 181 transitions. [2020-12-23 01:44:24,340 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 181 transitions. Word has length 74 [2020-12-23 01:44:24,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:44:24,340 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 181 transitions. [2020-12-23 01:44:24,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-23 01:44:24,340 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 181 transitions. [2020-12-23 01:44:24,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-12-23 01:44:24,341 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:44:24,341 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:44:24,554 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2020-12-23 01:44:24,555 INFO L429 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:44:24,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:44:24,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1241887836, now seen corresponding path program 2 times [2020-12-23 01:44:24,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:44:24,556 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928714445] [2020-12-23 01:44:24,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:44:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:44:24,777 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-23 01:44:24,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928714445] [2020-12-23 01:44:24,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024614178] [2020-12-23 01:44:24,777 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:44:25,106 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-12-23 01:44:25,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 01:44:25,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-23 01:44:25,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 01:44:25,224 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-12-23 01:44:25,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 01:44:25,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2020-12-23 01:44:25,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128507512] [2020-12-23 01:44:25,225 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 01:44:25,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:44:25,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 01:44:25,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-12-23 01:44:25,226 INFO L87 Difference]: Start difference. First operand 163 states and 181 transitions. Second operand 5 states. [2020-12-23 01:44:25,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:44:25,336 INFO L93 Difference]: Finished difference Result 194 states and 215 transitions. [2020-12-23 01:44:25,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 01:44:25,337 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2020-12-23 01:44:25,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:44:25,338 INFO L225 Difference]: With dead ends: 194 [2020-12-23 01:44:25,338 INFO L226 Difference]: Without dead ends: 143 [2020-12-23 01:44:25,338 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-12-23 01:44:25,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-12-23 01:44:25,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2020-12-23 01:44:25,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2020-12-23 01:44:25,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 155 transitions. [2020-12-23 01:44:25,356 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 155 transitions. Word has length 76 [2020-12-23 01:44:25,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:44:25,356 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 155 transitions. [2020-12-23 01:44:25,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 01:44:25,356 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 155 transitions. [2020-12-23 01:44:25,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-12-23 01:44:25,357 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:44:25,357 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:44:25,569 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:44:25,570 INFO L429 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:44:25,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:44:25,571 INFO L82 PathProgramCache]: Analyzing trace with hash 763521196, now seen corresponding path program 1 times [2020-12-23 01:44:25,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:44:25,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483111479] [2020-12-23 01:44:25,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:44:25,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:44:25,767 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-23 01:44:25,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483111479] [2020-12-23 01:44:25,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599696245] [2020-12-23 01:44:25,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:44:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:44:26,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 871 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-23 01:44:26,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 01:44:26,412 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-12-23 01:44:26,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 01:44:26,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2020-12-23 01:44:26,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475684701] [2020-12-23 01:44:26,413 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-23 01:44:26,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 01:44:26,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-23 01:44:26,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-12-23 01:44:26,414 INFO L87 Difference]: Start difference. First operand 143 states and 155 transitions. Second operand 15 states. [2020-12-23 01:44:26,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 01:44:26,699 INFO L93 Difference]: Finished difference Result 260 states and 285 transitions. [2020-12-23 01:44:26,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-23 01:44:26,700 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 81 [2020-12-23 01:44:26,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 01:44:26,701 INFO L225 Difference]: With dead ends: 260 [2020-12-23 01:44:26,701 INFO L226 Difference]: Without dead ends: 147 [2020-12-23 01:44:26,701 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2020-12-23 01:44:26,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2020-12-23 01:44:26,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2020-12-23 01:44:26,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-12-23 01:44:26,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 159 transitions. [2020-12-23 01:44:26,720 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 159 transitions. Word has length 81 [2020-12-23 01:44:26,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 01:44:26,720 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 159 transitions. [2020-12-23 01:44:26,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-23 01:44:26,720 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 159 transitions. [2020-12-23 01:44:26,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-12-23 01:44:26,721 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 01:44:26,721 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 01:44:26,935 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 01:44:26,936 INFO L429 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 01:44:26,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 01:44:26,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1876993521, now seen corresponding path program 2 times [2020-12-23 01:44:26,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 01:44:26,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599445067] [2020-12-23 01:44:26,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 01:44:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 01:44:27,140 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-12-23 01:44:27,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599445067] [2020-12-23 01:44:27,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005839294] [2020-12-23 01:44:27,141 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true