/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-178dd20 [2021-01-06 11:37:13,761 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 11:37:13,765 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 11:37:13,822 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 11:37:13,823 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 11:37:13,827 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 11:37:13,830 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 11:37:13,835 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 11:37:13,839 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 11:37:13,845 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 11:37:13,849 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 11:37:13,851 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 11:37:13,851 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 11:37:13,855 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 11:37:13,857 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 11:37:13,858 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 11:37:13,870 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 11:37:13,871 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 11:37:13,874 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 11:37:13,881 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 11:37:13,883 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 11:37:13,885 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 11:37:13,886 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 11:37:13,889 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 11:37:13,899 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 11:37:13,899 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 11:37:13,899 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 11:37:13,901 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 11:37:13,902 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 11:37:13,903 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 11:37:13,903 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 11:37:13,904 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 11:37:13,906 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 11:37:13,906 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 11:37:13,907 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 11:37:13,908 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 11:37:13,908 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 11:37:13,915 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 11:37:13,915 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 11:37:13,916 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 11:37:13,917 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 11:37:13,918 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 11:37:13,962 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 11:37:13,963 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 11:37:13,966 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 11:37:13,967 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 11:37:13,967 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 11:37:13,967 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 11:37:13,967 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 11:37:13,967 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 11:37:13,968 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 11:37:13,968 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 11:37:13,969 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 11:37:13,969 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 11:37:13,970 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 11:37:13,970 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 11:37:13,970 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 11:37:13,970 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 11:37:13,970 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 11:37:13,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 11:37:13,971 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 11:37:13,971 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 11:37:13,971 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 11:37:13,971 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 11:37:13,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 11:37:13,972 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 11:37:13,972 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 11:37:13,972 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 [2021-01-06 11:37:14,353 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 11:37:14,380 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 11:37:14,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 11:37:14,384 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 11:37:14,385 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 11:37:14,386 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 [2021-01-06 11:37:14,471 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/170a485c1/150aac0e94ea49a6b7439ad2068acbec/FLAG94b5ed2a6 [2021-01-06 11:37:15,304 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 11:37:15,305 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ntdrivers/kbfiltr.i.cil-2.c [2021-01-06 11:37:15,366 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/170a485c1/150aac0e94ea49a6b7439ad2068acbec/FLAG94b5ed2a6 [2021-01-06 11:37:15,452 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/170a485c1/150aac0e94ea49a6b7439ad2068acbec [2021-01-06 11:37:15,455 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 11:37:15,459 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 11:37:15,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 11:37:15,463 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 11:37:15,466 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 11:37:15,468 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:37:15" (1/1) ... [2021-01-06 11:37:15,469 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ff385bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:37:15, skipping insertion in model container [2021-01-06 11:37:15,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:37:15" (1/1) ... [2021-01-06 11:37:15,478 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 11:37:15,578 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 11:37:16,226 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] [2021-01-06 11:37:16,504 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:37:16,517 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 11:37:16,571 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] [2021-01-06 11:37:16,727 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 11:37:16,791 INFO L208 MainTranslator]: Completed translation [2021-01-06 11:37:16,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:37:16 WrapperNode [2021-01-06 11:37:16,792 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 11:37:16,793 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 11:37:16,793 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 11:37:16,794 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 11:37:16,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:37:16" (1/1) ... [2021-01-06 11:37:16,843 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:37:16" (1/1) ... [2021-01-06 11:37:16,937 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 11:37:16,941 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 11:37:16,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 11:37:16,942 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 11:37:16,952 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:37:16" (1/1) ... [2021-01-06 11:37:16,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:37:16" (1/1) ... [2021-01-06 11:37:16,990 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:37:16" (1/1) ... [2021-01-06 11:37:16,991 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:37:16" (1/1) ... [2021-01-06 11:37:17,078 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:37:16" (1/1) ... [2021-01-06 11:37:17,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:37:16" (1/1) ... [2021-01-06 11:37:17,102 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:37:16" (1/1) ... [2021-01-06 11:37:17,120 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 11:37:17,121 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 11:37:17,121 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 11:37:17,121 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 11:37:17,122 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:37:16" (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 [2021-01-06 11:37:17,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-01-06 11:37:17,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-01-06 11:37:17,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-01-06 11:37:17,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-06 11:37:17,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 11:37:17,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-06 11:37:17,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-06 11:37:17,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 11:37:17,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-06 11:37:17,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-06 11:37:17,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 11:37:17,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-01-06 11:37:17,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 11:37:17,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 11:37:17,804 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:37:17,806 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:37:17,808 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:37:17,814 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:37:17,819 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:37:17,824 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:37:17,827 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:37:17,829 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:37:17,832 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:37:17,835 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:37:17,838 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:37:17,841 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:37:17,842 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:37:17,847 WARN L807 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-01-06 11:37:21,549 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##427: assume false; [2021-01-06 11:37:21,550 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##428: assume !false; [2021-01-06 11:37:21,550 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##201: assume !false; [2021-01-06 11:37:21,550 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##200: assume false; [2021-01-06 11:37:21,551 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##258: assume false; [2021-01-06 11:37:21,551 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##259: assume !false; [2021-01-06 11:37:21,551 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##289: assume !false; [2021-01-06 11:37:21,551 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##288: assume false; [2021-01-06 11:37:21,551 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##231: assume !false; [2021-01-06 11:37:21,552 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##230: assume false; [2021-01-06 11:37:21,552 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##319: assume !false; [2021-01-06 11:37:21,552 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##318: assume false; [2021-01-06 11:37:21,552 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##173: assume false; [2021-01-06 11:37:21,553 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##174: assume !false; [2021-01-06 11:37:21,553 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##69: assume !false; [2021-01-06 11:37:21,553 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##68: assume false; [2021-01-06 11:37:21,553 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##36: assume !false; [2021-01-06 11:37:21,553 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##35: assume false; [2021-01-06 11:37:21,553 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume !false; [2021-01-06 11:37:21,553 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume false; [2021-01-06 11:37:21,554 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2021-01-06 11:37:21,554 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2021-01-06 11:37:21,554 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##341: assume !false; [2021-01-06 11:37:21,554 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##340: assume false; [2021-01-06 11:37:21,554 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##114: assume !false; [2021-01-06 11:37:21,554 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##113: assume false; [2021-01-06 11:37:21,554 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##360: assume false; [2021-01-06 11:37:21,555 INFO L759 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##361: assume !false; [2021-01-06 11:37:21,568 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 11:37:21,569 INFO L299 CfgBuilder]: Removed 178 assume(true) statements. [2021-01-06 11:37:21,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:37:21 BoogieIcfgContainer [2021-01-06 11:37:21,571 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 11:37:21,573 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 11:37:21,573 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 11:37:21,577 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 11:37:21,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:37:15" (1/3) ... [2021-01-06 11:37:21,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@128587af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:37:21, skipping insertion in model container [2021-01-06 11:37:21,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:37:16" (2/3) ... [2021-01-06 11:37:21,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@128587af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:37:21, skipping insertion in model container [2021-01-06 11:37:21,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:37:21" (3/3) ... [2021-01-06 11:37:21,580 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr.i.cil-2.c [2021-01-06 11:37:21,587 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 11:37:21,593 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 30 error locations. [2021-01-06 11:37:21,612 INFO L253 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2021-01-06 11:37:21,640 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 11:37:21,641 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 11:37:21,641 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 11:37:21,641 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 11:37:21,641 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 11:37:21,641 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 11:37:21,641 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 11:37:21,641 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 11:37:21,667 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states. [2021-01-06 11:37:21,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-01-06 11:37:21,674 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:37:21,674 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:37:21,675 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]=== [2021-01-06 11:37:21,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:37:21,681 INFO L82 PathProgramCache]: Analyzing trace with hash -570802095, now seen corresponding path program 1 times [2021-01-06 11:37:21,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:37:21,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854673343] [2021-01-06 11:37:21,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:37:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:37:22,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:37:22,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854673343] [2021-01-06 11:37:22,127 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:37:22,127 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 11:37:22,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248486204] [2021-01-06 11:37:22,133 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-06 11:37:22,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:37:22,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-06 11:37:22,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 11:37:22,152 INFO L87 Difference]: Start difference. First operand 361 states. Second operand 2 states. [2021-01-06 11:37:22,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:37:22,218 INFO L93 Difference]: Finished difference Result 718 states and 1071 transitions. [2021-01-06 11:37:22,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-06 11:37:22,220 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2021-01-06 11:37:22,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:37:22,236 INFO L225 Difference]: With dead ends: 718 [2021-01-06 11:37:22,237 INFO L226 Difference]: Without dead ends: 355 [2021-01-06 11:37:22,243 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 [2021-01-06 11:37:22,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2021-01-06 11:37:22,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2021-01-06 11:37:22,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2021-01-06 11:37:22,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 488 transitions. [2021-01-06 11:37:22,351 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 488 transitions. Word has length 15 [2021-01-06 11:37:22,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:37:22,351 INFO L481 AbstractCegarLoop]: Abstraction has 355 states and 488 transitions. [2021-01-06 11:37:22,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-06 11:37:22,351 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 488 transitions. [2021-01-06 11:37:22,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-01-06 11:37:22,354 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:37:22,354 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 11:37:22,354 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 11:37:22,355 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]=== [2021-01-06 11:37:22,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:37:22,356 INFO L82 PathProgramCache]: Analyzing trace with hash -312636657, now seen corresponding path program 1 times [2021-01-06 11:37:22,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:37:22,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603108352] [2021-01-06 11:37:22,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:37:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:37:22,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:37:22,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603108352] [2021-01-06 11:37:22,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:37:22,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:37:22,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711723315] [2021-01-06 11:37:22,605 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:37:22,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:37:22,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:37:22,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:37:22,611 INFO L87 Difference]: Start difference. First operand 355 states and 488 transitions. Second operand 4 states. [2021-01-06 11:37:24,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:37:24,728 INFO L93 Difference]: Finished difference Result 372 states and 508 transitions. [2021-01-06 11:37:24,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:37:24,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2021-01-06 11:37:24,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:37:24,732 INFO L225 Difference]: With dead ends: 372 [2021-01-06 11:37:24,733 INFO L226 Difference]: Without dead ends: 355 [2021-01-06 11:37:24,734 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 [2021-01-06 11:37:24,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2021-01-06 11:37:24,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2021-01-06 11:37:24,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2021-01-06 11:37:24,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 487 transitions. [2021-01-06 11:37:24,751 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 487 transitions. Word has length 15 [2021-01-06 11:37:24,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:37:24,751 INFO L481 AbstractCegarLoop]: Abstraction has 355 states and 487 transitions. [2021-01-06 11:37:24,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:37:24,751 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 487 transitions. [2021-01-06 11:37:24,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-06 11:37:24,753 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:37:24,753 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] [2021-01-06 11:37:24,753 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 11:37:24,753 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]=== [2021-01-06 11:37:24,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:37:24,754 INFO L82 PathProgramCache]: Analyzing trace with hash -830050372, now seen corresponding path program 1 times [2021-01-06 11:37:24,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:37:24,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900409990] [2021-01-06 11:37:24,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:37:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:37:24,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:37:24,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900409990] [2021-01-06 11:37:24,900 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:37:24,900 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:37:24,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367790918] [2021-01-06 11:37:24,901 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:37:24,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:37:24,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:37:24,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:37:24,916 INFO L87 Difference]: Start difference. First operand 355 states and 487 transitions. Second operand 4 states. [2021-01-06 11:37:25,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:37:25,236 INFO L93 Difference]: Finished difference Result 1033 states and 1422 transitions. [2021-01-06 11:37:25,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:37:25,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2021-01-06 11:37:25,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:37:25,245 INFO L225 Difference]: With dead ends: 1033 [2021-01-06 11:37:25,246 INFO L226 Difference]: Without dead ends: 698 [2021-01-06 11:37:25,250 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 [2021-01-06 11:37:25,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2021-01-06 11:37:25,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 357. [2021-01-06 11:37:25,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2021-01-06 11:37:25,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 489 transitions. [2021-01-06 11:37:25,280 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 489 transitions. Word has length 23 [2021-01-06 11:37:25,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:37:25,281 INFO L481 AbstractCegarLoop]: Abstraction has 357 states and 489 transitions. [2021-01-06 11:37:25,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:37:25,281 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 489 transitions. [2021-01-06 11:37:25,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-06 11:37:25,284 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:37:25,284 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] [2021-01-06 11:37:25,284 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 11:37:25,285 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]=== [2021-01-06 11:37:25,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:37:25,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1866993660, now seen corresponding path program 1 times [2021-01-06 11:37:25,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:37:25,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30831505] [2021-01-06 11:37:25,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:37:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:37:25,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:37:25,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30831505] [2021-01-06 11:37:25,449 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:37:25,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:37:25,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179772421] [2021-01-06 11:37:25,451 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:37:25,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:37:25,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:37:25,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:37:25,454 INFO L87 Difference]: Start difference. First operand 357 states and 489 transitions. Second operand 3 states. [2021-01-06 11:37:27,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:37:27,707 INFO L93 Difference]: Finished difference Result 465 states and 625 transitions. [2021-01-06 11:37:27,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:37:27,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2021-01-06 11:37:27,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:37:27,710 INFO L225 Difference]: With dead ends: 465 [2021-01-06 11:37:27,710 INFO L226 Difference]: Without dead ends: 400 [2021-01-06 11:37:27,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 [2021-01-06 11:37:27,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2021-01-06 11:37:27,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 383. [2021-01-06 11:37:27,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2021-01-06 11:37:27,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 526 transitions. [2021-01-06 11:37:27,730 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 526 transitions. Word has length 23 [2021-01-06 11:37:27,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:37:27,730 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 526 transitions. [2021-01-06 11:37:27,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:37:27,730 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 526 transitions. [2021-01-06 11:37:27,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-06 11:37:27,732 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:37:27,732 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] [2021-01-06 11:37:27,733 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 11:37:27,733 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]=== [2021-01-06 11:37:27,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:37:27,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1383977505, now seen corresponding path program 1 times [2021-01-06 11:37:27,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:37:27,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581125850] [2021-01-06 11:37:27,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:37:27,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:37:27,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:37:27,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581125850] [2021-01-06 11:37:27,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:37:27,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:37:27,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90180060] [2021-01-06 11:37:27,832 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:37:27,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:37:27,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:37:27,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:37:27,833 INFO L87 Difference]: Start difference. First operand 383 states and 526 transitions. Second operand 3 states. [2021-01-06 11:37:27,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:37:27,873 INFO L93 Difference]: Finished difference Result 467 states and 640 transitions. [2021-01-06 11:37:27,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:37:27,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2021-01-06 11:37:27,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:37:27,876 INFO L225 Difference]: With dead ends: 467 [2021-01-06 11:37:27,876 INFO L226 Difference]: Without dead ends: 384 [2021-01-06 11:37:27,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 [2021-01-06 11:37:27,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2021-01-06 11:37:27,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2021-01-06 11:37:27,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2021-01-06 11:37:27,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 527 transitions. [2021-01-06 11:37:27,895 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 527 transitions. Word has length 28 [2021-01-06 11:37:27,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:37:27,896 INFO L481 AbstractCegarLoop]: Abstraction has 384 states and 527 transitions. [2021-01-06 11:37:27,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:37:27,896 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 527 transitions. [2021-01-06 11:37:27,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-01-06 11:37:27,897 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:37:27,897 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] [2021-01-06 11:37:27,898 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 11:37:27,898 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]=== [2021-01-06 11:37:27,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:37:27,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1992526103, now seen corresponding path program 1 times [2021-01-06 11:37:27,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:37:27,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690123997] [2021-01-06 11:37:27,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:37:27,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:37:28,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:37:28,003 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690123997] [2021-01-06 11:37:28,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:37:28,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:37:28,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141828330] [2021-01-06 11:37:28,004 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:37:28,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:37:28,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:37:28,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:37:28,005 INFO L87 Difference]: Start difference. First operand 384 states and 527 transitions. Second operand 3 states. [2021-01-06 11:37:28,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:37:28,067 INFO L93 Difference]: Finished difference Result 580 states and 779 transitions. [2021-01-06 11:37:28,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:37:28,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2021-01-06 11:37:28,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:37:28,070 INFO L225 Difference]: With dead ends: 580 [2021-01-06 11:37:28,070 INFO L226 Difference]: Without dead ends: 393 [2021-01-06 11:37:28,071 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 [2021-01-06 11:37:28,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2021-01-06 11:37:28,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 340. [2021-01-06 11:37:28,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2021-01-06 11:37:28,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 469 transitions. [2021-01-06 11:37:28,090 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 469 transitions. Word has length 29 [2021-01-06 11:37:28,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:37:28,091 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 469 transitions. [2021-01-06 11:37:28,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:37:28,091 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 469 transitions. [2021-01-06 11:37:28,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-06 11:37:28,092 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:37:28,092 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] [2021-01-06 11:37:28,092 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 11:37:28,093 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]=== [2021-01-06 11:37:28,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:37:28,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1953514739, now seen corresponding path program 1 times [2021-01-06 11:37:28,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:37:28,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135364779] [2021-01-06 11:37:28,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:37:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:37:28,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:37:28,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135364779] [2021-01-06 11:37:28,191 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:37:28,191 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:37:28,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309092593] [2021-01-06 11:37:28,192 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:37:28,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:37:28,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:37:28,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:37:28,193 INFO L87 Difference]: Start difference. First operand 340 states and 469 transitions. Second operand 3 states. [2021-01-06 11:37:30,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:37:30,430 INFO L93 Difference]: Finished difference Result 340 states and 469 transitions. [2021-01-06 11:37:30,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:37:30,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2021-01-06 11:37:30,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:37:30,433 INFO L225 Difference]: With dead ends: 340 [2021-01-06 11:37:30,433 INFO L226 Difference]: Without dead ends: 326 [2021-01-06 11:37:30,434 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 [2021-01-06 11:37:30,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2021-01-06 11:37:30,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2021-01-06 11:37:30,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2021-01-06 11:37:30,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 455 transitions. [2021-01-06 11:37:30,456 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 455 transitions. Word has length 30 [2021-01-06 11:37:30,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:37:30,457 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 455 transitions. [2021-01-06 11:37:30,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:37:30,457 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 455 transitions. [2021-01-06 11:37:30,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-06 11:37:30,458 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:37:30,458 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] [2021-01-06 11:37:30,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 11:37:30,459 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]=== [2021-01-06 11:37:30,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:37:30,459 INFO L82 PathProgramCache]: Analyzing trace with hash -865410036, now seen corresponding path program 1 times [2021-01-06 11:37:30,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:37:30,460 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096890280] [2021-01-06 11:37:30,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:37:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:37:30,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:37:30,628 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096890280] [2021-01-06 11:37:30,628 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:37:30,628 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:37:30,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104347180] [2021-01-06 11:37:30,629 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:37:30,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:37:30,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:37:30,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:37:30,630 INFO L87 Difference]: Start difference. First operand 326 states and 455 transitions. Second operand 4 states. [2021-01-06 11:37:32,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:37:32,886 INFO L93 Difference]: Finished difference Result 351 states and 480 transitions. [2021-01-06 11:37:32,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:37:32,886 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2021-01-06 11:37:32,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:37:32,888 INFO L225 Difference]: With dead ends: 351 [2021-01-06 11:37:32,889 INFO L226 Difference]: Without dead ends: 343 [2021-01-06 11:37:32,889 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 [2021-01-06 11:37:32,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2021-01-06 11:37:32,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 331. [2021-01-06 11:37:32,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2021-01-06 11:37:32,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 461 transitions. [2021-01-06 11:37:32,911 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 461 transitions. Word has length 30 [2021-01-06 11:37:32,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:37:32,912 INFO L481 AbstractCegarLoop]: Abstraction has 331 states and 461 transitions. [2021-01-06 11:37:32,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:37:32,912 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 461 transitions. [2021-01-06 11:37:32,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-01-06 11:37:32,913 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:37:32,913 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] [2021-01-06 11:37:32,913 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 11:37:32,913 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]=== [2021-01-06 11:37:32,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:37:32,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1071046773, now seen corresponding path program 1 times [2021-01-06 11:37:32,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:37:32,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389550782] [2021-01-06 11:37:32,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:37:32,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:37:33,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:37:33,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389550782] [2021-01-06 11:37:33,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:37:33,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:37:33,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114516887] [2021-01-06 11:37:33,063 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:37:33,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:37:33,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:37:33,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:37:33,064 INFO L87 Difference]: Start difference. First operand 331 states and 461 transitions. Second operand 4 states. [2021-01-06 11:37:35,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:37:35,311 INFO L93 Difference]: Finished difference Result 351 states and 479 transitions. [2021-01-06 11:37:35,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:37:35,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2021-01-06 11:37:35,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:37:35,313 INFO L225 Difference]: With dead ends: 351 [2021-01-06 11:37:35,314 INFO L226 Difference]: Without dead ends: 343 [2021-01-06 11:37:35,314 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 [2021-01-06 11:37:35,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2021-01-06 11:37:35,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 332. [2021-01-06 11:37:35,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2021-01-06 11:37:35,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 462 transitions. [2021-01-06 11:37:35,338 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 462 transitions. Word has length 31 [2021-01-06 11:37:35,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:37:35,338 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 462 transitions. [2021-01-06 11:37:35,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:37:35,338 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 462 transitions. [2021-01-06 11:37:35,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-01-06 11:37:35,339 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:37:35,339 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] [2021-01-06 11:37:35,339 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 11:37:35,340 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]=== [2021-01-06 11:37:35,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:37:35,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1149600725, now seen corresponding path program 1 times [2021-01-06 11:37:35,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:37:35,341 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651627998] [2021-01-06 11:37:35,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:37:35,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:37:35,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:37:35,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651627998] [2021-01-06 11:37:35,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:37:35,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 11:37:35,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326046916] [2021-01-06 11:37:35,492 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 11:37:35,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:37:35,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 11:37:35,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 11:37:35,493 INFO L87 Difference]: Start difference. First operand 332 states and 462 transitions. Second operand 6 states. [2021-01-06 11:37:39,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:37:39,888 INFO L93 Difference]: Finished difference Result 352 states and 482 transitions. [2021-01-06 11:37:39,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 11:37:39,889 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2021-01-06 11:37:39,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:37:39,891 INFO L225 Difference]: With dead ends: 352 [2021-01-06 11:37:39,891 INFO L226 Difference]: Without dead ends: 299 [2021-01-06 11:37:39,892 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 [2021-01-06 11:37:39,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-01-06 11:37:39,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2021-01-06 11:37:39,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2021-01-06 11:37:39,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 415 transitions. [2021-01-06 11:37:39,914 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 415 transitions. Word has length 32 [2021-01-06 11:37:39,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:37:39,914 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 415 transitions. [2021-01-06 11:37:39,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 11:37:39,914 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 415 transitions. [2021-01-06 11:37:39,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-01-06 11:37:39,915 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:37:39,915 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] [2021-01-06 11:37:39,915 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 11:37:39,916 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]=== [2021-01-06 11:37:39,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:37:39,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1880920567, now seen corresponding path program 1 times [2021-01-06 11:37:39,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:37:39,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314811194] [2021-01-06 11:37:39,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:37:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:37:40,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:37:40,074 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314811194] [2021-01-06 11:37:40,074 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:37:40,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:37:40,075 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316116713] [2021-01-06 11:37:40,075 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:37:40,075 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:37:40,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:37:40,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:37:40,076 INFO L87 Difference]: Start difference. First operand 297 states and 415 transitions. Second operand 4 states. [2021-01-06 11:37:42,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:37:42,286 INFO L93 Difference]: Finished difference Result 323 states and 445 transitions. [2021-01-06 11:37:42,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:37:42,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2021-01-06 11:37:42,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:37:42,288 INFO L225 Difference]: With dead ends: 323 [2021-01-06 11:37:42,288 INFO L226 Difference]: Without dead ends: 315 [2021-01-06 11:37:42,289 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 [2021-01-06 11:37:42,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-01-06 11:37:42,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 308. [2021-01-06 11:37:42,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2021-01-06 11:37:42,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 429 transitions. [2021-01-06 11:37:42,313 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 429 transitions. Word has length 38 [2021-01-06 11:37:42,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:37:42,314 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 429 transitions. [2021-01-06 11:37:42,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:37:42,314 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 429 transitions. [2021-01-06 11:37:42,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-06 11:37:42,315 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:37:42,315 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] [2021-01-06 11:37:42,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 11:37:42,316 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]=== [2021-01-06 11:37:42,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:37:42,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1807865134, now seen corresponding path program 1 times [2021-01-06 11:37:42,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:37:42,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275325021] [2021-01-06 11:37:42,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:37:42,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:37:42,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:37:42,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275325021] [2021-01-06 11:37:42,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:37:42,555 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:37:42,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216178009] [2021-01-06 11:37:42,556 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:37:42,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:37:42,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:37:42,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:37:42,557 INFO L87 Difference]: Start difference. First operand 308 states and 429 transitions. Second operand 4 states. [2021-01-06 11:37:44,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:37:44,752 INFO L93 Difference]: Finished difference Result 323 states and 444 transitions. [2021-01-06 11:37:44,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:37:44,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2021-01-06 11:37:44,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:37:44,754 INFO L225 Difference]: With dead ends: 323 [2021-01-06 11:37:44,755 INFO L226 Difference]: Without dead ends: 315 [2021-01-06 11:37:44,755 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 [2021-01-06 11:37:44,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2021-01-06 11:37:44,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 309. [2021-01-06 11:37:44,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2021-01-06 11:37:44,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 430 transitions. [2021-01-06 11:37:44,776 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 430 transitions. Word has length 39 [2021-01-06 11:37:44,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:37:44,777 INFO L481 AbstractCegarLoop]: Abstraction has 309 states and 430 transitions. [2021-01-06 11:37:44,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:37:44,777 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 430 transitions. [2021-01-06 11:37:44,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-01-06 11:37:44,778 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:37:44,778 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] [2021-01-06 11:37:44,778 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 11:37:44,778 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]=== [2021-01-06 11:37:44,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:37:44,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1438598816, now seen corresponding path program 1 times [2021-01-06 11:37:44,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:37:44,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727845807] [2021-01-06 11:37:44,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:37:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:37:44,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:37:44,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727845807] [2021-01-06 11:37:44,894 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:37:44,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:37:44,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145870744] [2021-01-06 11:37:44,895 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:37:44,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:37:44,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:37:44,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:37:44,896 INFO L87 Difference]: Start difference. First operand 309 states and 430 transitions. Second operand 4 states. [2021-01-06 11:37:45,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:37:45,100 INFO L93 Difference]: Finished difference Result 371 states and 499 transitions. [2021-01-06 11:37:45,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:37:45,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2021-01-06 11:37:45,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:37:45,102 INFO L225 Difference]: With dead ends: 371 [2021-01-06 11:37:45,103 INFO L226 Difference]: Without dead ends: 330 [2021-01-06 11:37:45,103 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 [2021-01-06 11:37:45,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2021-01-06 11:37:45,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 309. [2021-01-06 11:37:45,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2021-01-06 11:37:45,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 423 transitions. [2021-01-06 11:37:45,126 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 423 transitions. Word has length 40 [2021-01-06 11:37:45,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:37:45,127 INFO L481 AbstractCegarLoop]: Abstraction has 309 states and 423 transitions. [2021-01-06 11:37:45,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:37:45,127 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 423 transitions. [2021-01-06 11:37:45,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-01-06 11:37:45,128 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:37:45,128 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] [2021-01-06 11:37:45,128 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 11:37:45,128 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]=== [2021-01-06 11:37:45,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:37:45,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1816693626, now seen corresponding path program 1 times [2021-01-06 11:37:45,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:37:45,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907836264] [2021-01-06 11:37:45,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:37:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:37:45,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 11:37:45,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907836264] [2021-01-06 11:37:45,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:37:45,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:37:45,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030862788] [2021-01-06 11:37:45,242 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:37:45,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:37:45,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:37:45,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:37:45,243 INFO L87 Difference]: Start difference. First operand 309 states and 423 transitions. Second operand 4 states. [2021-01-06 11:37:45,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:37:45,301 INFO L93 Difference]: Finished difference Result 408 states and 551 transitions. [2021-01-06 11:37:45,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:37:45,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2021-01-06 11:37:45,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:37:45,304 INFO L225 Difference]: With dead ends: 408 [2021-01-06 11:37:45,304 INFO L226 Difference]: Without dead ends: 328 [2021-01-06 11:37:45,305 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 [2021-01-06 11:37:45,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2021-01-06 11:37:45,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 310. [2021-01-06 11:37:45,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2021-01-06 11:37:45,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 424 transitions. [2021-01-06 11:37:45,328 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 424 transitions. Word has length 40 [2021-01-06 11:37:45,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:37:45,329 INFO L481 AbstractCegarLoop]: Abstraction has 310 states and 424 transitions. [2021-01-06 11:37:45,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:37:45,329 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 424 transitions. [2021-01-06 11:37:45,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-01-06 11:37:45,330 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:37:45,330 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] [2021-01-06 11:37:45,330 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 11:37:45,330 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]=== [2021-01-06 11:37:45,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:37:45,331 INFO L82 PathProgramCache]: Analyzing trace with hash 201556626, now seen corresponding path program 1 times [2021-01-06 11:37:45,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:37:45,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380459674] [2021-01-06 11:37:45,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:37:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:37:45,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:37:45,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380459674] [2021-01-06 11:37:45,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:37:45,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:37:45,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463502858] [2021-01-06 11:37:45,413 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:37:45,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:37:45,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:37:45,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:37:45,414 INFO L87 Difference]: Start difference. First operand 310 states and 424 transitions. Second operand 3 states. [2021-01-06 11:37:45,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:37:45,467 INFO L93 Difference]: Finished difference Result 326 states and 444 transitions. [2021-01-06 11:37:45,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:37:45,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2021-01-06 11:37:45,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:37:45,470 INFO L225 Difference]: With dead ends: 326 [2021-01-06 11:37:45,470 INFO L226 Difference]: Without dead ends: 303 [2021-01-06 11:37:45,470 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 [2021-01-06 11:37:45,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2021-01-06 11:37:45,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2021-01-06 11:37:45,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2021-01-06 11:37:45,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 413 transitions. [2021-01-06 11:37:45,497 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 413 transitions. Word has length 40 [2021-01-06 11:37:45,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:37:45,497 INFO L481 AbstractCegarLoop]: Abstraction has 303 states and 413 transitions. [2021-01-06 11:37:45,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:37:45,497 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 413 transitions. [2021-01-06 11:37:45,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-01-06 11:37:45,499 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:37:45,499 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] [2021-01-06 11:37:45,499 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 11:37:45,499 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]=== [2021-01-06 11:37:45,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:37:45,500 INFO L82 PathProgramCache]: Analyzing trace with hash 249426005, now seen corresponding path program 1 times [2021-01-06 11:37:45,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:37:45,500 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55957021] [2021-01-06 11:37:45,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:37:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:37:45,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 11:37:45,589 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55957021] [2021-01-06 11:37:45,589 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:37:45,589 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:37:45,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604294776] [2021-01-06 11:37:45,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:37:45,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:37:45,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:37:45,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:37:45,591 INFO L87 Difference]: Start difference. First operand 303 states and 413 transitions. Second operand 3 states. [2021-01-06 11:37:47,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:37:47,751 INFO L93 Difference]: Finished difference Result 345 states and 465 transitions. [2021-01-06 11:37:47,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:37:47,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2021-01-06 11:37:47,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:37:47,754 INFO L225 Difference]: With dead ends: 345 [2021-01-06 11:37:47,754 INFO L226 Difference]: Without dead ends: 300 [2021-01-06 11:37:47,754 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 [2021-01-06 11:37:47,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2021-01-06 11:37:47,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2021-01-06 11:37:47,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2021-01-06 11:37:47,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 409 transitions. [2021-01-06 11:37:47,783 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 409 transitions. Word has length 41 [2021-01-06 11:37:47,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:37:47,783 INFO L481 AbstractCegarLoop]: Abstraction has 300 states and 409 transitions. [2021-01-06 11:37:47,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:37:47,783 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 409 transitions. [2021-01-06 11:37:47,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-01-06 11:37:47,784 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:37:47,785 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] [2021-01-06 11:37:47,785 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 11:37:47,785 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]=== [2021-01-06 11:37:47,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:37:47,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1909865667, now seen corresponding path program 1 times [2021-01-06 11:37:47,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:37:47,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845280468] [2021-01-06 11:37:47,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:37:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:37:47,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 11:37:47,882 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845280468] [2021-01-06 11:37:47,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:37:47,886 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:37:47,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135036879] [2021-01-06 11:37:47,887 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:37:47,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:37:47,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:37:47,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:37:47,888 INFO L87 Difference]: Start difference. First operand 300 states and 409 transitions. Second operand 3 states. [2021-01-06 11:37:49,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:37:49,956 INFO L93 Difference]: Finished difference Result 361 states and 482 transitions. [2021-01-06 11:37:49,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:37:49,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2021-01-06 11:37:49,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:37:49,958 INFO L225 Difference]: With dead ends: 361 [2021-01-06 11:37:49,958 INFO L226 Difference]: Without dead ends: 313 [2021-01-06 11:37:49,959 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 [2021-01-06 11:37:49,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2021-01-06 11:37:49,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 300. [2021-01-06 11:37:50,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2021-01-06 11:37:50,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 408 transitions. [2021-01-06 11:37:50,001 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 408 transitions. Word has length 41 [2021-01-06 11:37:50,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:37:50,001 INFO L481 AbstractCegarLoop]: Abstraction has 300 states and 408 transitions. [2021-01-06 11:37:50,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:37:50,001 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 408 transitions. [2021-01-06 11:37:50,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-01-06 11:37:50,002 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:37:50,002 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] [2021-01-06 11:37:50,003 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 11:37:50,003 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]=== [2021-01-06 11:37:50,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:37:50,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1953658895, now seen corresponding path program 1 times [2021-01-06 11:37:50,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:37:50,004 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563020323] [2021-01-06 11:37:50,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:37:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:37:50,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:37:50,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563020323] [2021-01-06 11:37:50,104 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:37:50,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 11:37:50,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265498027] [2021-01-06 11:37:50,105 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:37:50,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:37:50,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:37:50,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:37:50,106 INFO L87 Difference]: Start difference. First operand 300 states and 408 transitions. Second operand 5 states. [2021-01-06 11:37:52,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:37:52,240 INFO L93 Difference]: Finished difference Result 344 states and 459 transitions. [2021-01-06 11:37:52,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 11:37:52,240 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2021-01-06 11:37:52,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:37:52,242 INFO L225 Difference]: With dead ends: 344 [2021-01-06 11:37:52,242 INFO L226 Difference]: Without dead ends: 299 [2021-01-06 11:37:52,243 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 [2021-01-06 11:37:52,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2021-01-06 11:37:52,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2021-01-06 11:37:52,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2021-01-06 11:37:52,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 403 transitions. [2021-01-06 11:37:52,264 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 403 transitions. Word has length 41 [2021-01-06 11:37:52,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:37:52,264 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 403 transitions. [2021-01-06 11:37:52,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:37:52,265 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 403 transitions. [2021-01-06 11:37:52,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-01-06 11:37:52,265 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:37:52,266 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] [2021-01-06 11:37:52,266 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 11:37:52,266 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]=== [2021-01-06 11:37:52,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:37:52,266 INFO L82 PathProgramCache]: Analyzing trace with hash -480741563, now seen corresponding path program 1 times [2021-01-06 11:37:52,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:37:52,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818345248] [2021-01-06 11:37:52,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:37:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:37:52,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:37:52,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818345248] [2021-01-06 11:37:52,342 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:37:52,342 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:37:52,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377606372] [2021-01-06 11:37:52,342 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:37:52,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:37:52,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:37:52,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:37:52,343 INFO L87 Difference]: Start difference. First operand 299 states and 403 transitions. Second operand 3 states. [2021-01-06 11:37:52,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:37:52,370 INFO L93 Difference]: Finished difference Result 325 states and 431 transitions. [2021-01-06 11:37:52,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:37:52,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2021-01-06 11:37:52,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:37:52,373 INFO L225 Difference]: With dead ends: 325 [2021-01-06 11:37:52,373 INFO L226 Difference]: Without dead ends: 309 [2021-01-06 11:37:52,373 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 [2021-01-06 11:37:52,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-01-06 11:37:52,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 296. [2021-01-06 11:37:52,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2021-01-06 11:37:52,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 399 transitions. [2021-01-06 11:37:52,395 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 399 transitions. Word has length 42 [2021-01-06 11:37:52,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:37:52,395 INFO L481 AbstractCegarLoop]: Abstraction has 296 states and 399 transitions. [2021-01-06 11:37:52,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:37:52,395 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 399 transitions. [2021-01-06 11:37:52,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-01-06 11:37:52,396 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:37:52,396 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] [2021-01-06 11:37:52,396 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 11:37:52,397 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]=== [2021-01-06 11:37:52,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:37:52,397 INFO L82 PathProgramCache]: Analyzing trace with hash 370151206, now seen corresponding path program 1 times [2021-01-06 11:37:52,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:37:52,397 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271350163] [2021-01-06 11:37:52,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:37:52,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:37:52,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:37:52,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271350163] [2021-01-06 11:37:52,470 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:37:52,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:37:52,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215559366] [2021-01-06 11:37:52,471 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:37:52,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:37:52,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:37:52,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:37:52,472 INFO L87 Difference]: Start difference. First operand 296 states and 399 transitions. Second operand 3 states. [2021-01-06 11:37:52,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:37:52,642 INFO L93 Difference]: Finished difference Result 469 states and 611 transitions. [2021-01-06 11:37:52,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:37:52,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2021-01-06 11:37:52,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:37:52,645 INFO L225 Difference]: With dead ends: 469 [2021-01-06 11:37:52,645 INFO L226 Difference]: Without dead ends: 394 [2021-01-06 11:37:52,646 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 [2021-01-06 11:37:52,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2021-01-06 11:37:52,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 311. [2021-01-06 11:37:52,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2021-01-06 11:37:52,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 415 transitions. [2021-01-06 11:37:52,671 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 415 transitions. Word has length 43 [2021-01-06 11:37:52,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:37:52,671 INFO L481 AbstractCegarLoop]: Abstraction has 311 states and 415 transitions. [2021-01-06 11:37:52,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:37:52,671 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 415 transitions. [2021-01-06 11:37:52,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-01-06 11:37:52,672 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:37:52,672 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] [2021-01-06 11:37:52,672 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 11:37:52,672 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]=== [2021-01-06 11:37:52,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:37:52,673 INFO L82 PathProgramCache]: Analyzing trace with hash -243642330, now seen corresponding path program 1 times [2021-01-06 11:37:52,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:37:52,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999257430] [2021-01-06 11:37:52,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:37:52,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:37:52,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:37:52,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999257430] [2021-01-06 11:37:52,832 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:37:52,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 11:37:52,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551404510] [2021-01-06 11:37:52,833 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 11:37:52,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:37:52,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 11:37:52,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-06 11:37:52,833 INFO L87 Difference]: Start difference. First operand 311 states and 415 transitions. Second operand 7 states. [2021-01-06 11:37:55,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:37:55,236 INFO L93 Difference]: Finished difference Result 420 states and 546 transitions. [2021-01-06 11:37:55,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 11:37:55,237 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2021-01-06 11:37:55,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:37:55,240 INFO L225 Difference]: With dead ends: 420 [2021-01-06 11:37:55,240 INFO L226 Difference]: Without dead ends: 391 [2021-01-06 11:37:55,240 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 [2021-01-06 11:37:55,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2021-01-06 11:37:55,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 305. [2021-01-06 11:37:55,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2021-01-06 11:37:55,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 407 transitions. [2021-01-06 11:37:55,264 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 407 transitions. Word has length 43 [2021-01-06 11:37:55,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:37:55,265 INFO L481 AbstractCegarLoop]: Abstraction has 305 states and 407 transitions. [2021-01-06 11:37:55,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 11:37:55,265 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 407 transitions. [2021-01-06 11:37:55,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-06 11:37:55,266 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:37:55,266 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] [2021-01-06 11:37:55,266 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 11:37:55,266 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]=== [2021-01-06 11:37:55,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:37:55,267 INFO L82 PathProgramCache]: Analyzing trace with hash -693282345, now seen corresponding path program 1 times [2021-01-06 11:37:55,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:37:55,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067865506] [2021-01-06 11:37:55,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:37:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:37:55,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:37:55,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067865506] [2021-01-06 11:37:55,344 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:37:55,344 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:37:55,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785569444] [2021-01-06 11:37:55,344 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:37:55,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:37:55,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:37:55,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:37:55,345 INFO L87 Difference]: Start difference. First operand 305 states and 407 transitions. Second operand 3 states. [2021-01-06 11:37:55,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:37:55,546 INFO L93 Difference]: Finished difference Result 478 states and 619 transitions. [2021-01-06 11:37:55,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:37:55,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2021-01-06 11:37:55,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:37:55,549 INFO L225 Difference]: With dead ends: 478 [2021-01-06 11:37:55,549 INFO L226 Difference]: Without dead ends: 403 [2021-01-06 11:37:55,549 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 [2021-01-06 11:37:55,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2021-01-06 11:37:55,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 309. [2021-01-06 11:37:55,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2021-01-06 11:37:55,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 411 transitions. [2021-01-06 11:37:55,574 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 411 transitions. Word has length 44 [2021-01-06 11:37:55,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:37:55,574 INFO L481 AbstractCegarLoop]: Abstraction has 309 states and 411 transitions. [2021-01-06 11:37:55,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:37:55,574 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 411 transitions. [2021-01-06 11:37:55,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-06 11:37:55,575 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:37:55,576 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] [2021-01-06 11:37:55,576 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 11:37:55,576 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]=== [2021-01-06 11:37:55,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:37:55,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1307075881, now seen corresponding path program 1 times [2021-01-06 11:37:55,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:37:55,577 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723141669] [2021-01-06 11:37:55,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:37:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:37:55,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:37:55,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723141669] [2021-01-06 11:37:55,753 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:37:55,753 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:37:55,753 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432729777] [2021-01-06 11:37:55,754 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:37:55,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:37:55,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:37:55,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:37:55,755 INFO L87 Difference]: Start difference. First operand 309 states and 411 transitions. Second operand 4 states. [2021-01-06 11:37:55,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:37:55,948 INFO L93 Difference]: Finished difference Result 347 states and 451 transitions. [2021-01-06 11:37:55,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:37:55,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2021-01-06 11:37:55,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:37:55,950 INFO L225 Difference]: With dead ends: 347 [2021-01-06 11:37:55,951 INFO L226 Difference]: Without dead ends: 280 [2021-01-06 11:37:55,951 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 [2021-01-06 11:37:55,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2021-01-06 11:37:55,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2021-01-06 11:37:55,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2021-01-06 11:37:55,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 364 transitions. [2021-01-06 11:37:55,974 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 364 transitions. Word has length 44 [2021-01-06 11:37:55,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:37:55,974 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 364 transitions. [2021-01-06 11:37:55,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:37:55,975 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 364 transitions. [2021-01-06 11:37:55,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-06 11:37:55,975 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:37:55,975 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] [2021-01-06 11:37:55,976 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 11:37:55,976 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]=== [2021-01-06 11:37:55,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:37:55,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1507726140, now seen corresponding path program 1 times [2021-01-06 11:37:55,976 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:37:55,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851309808] [2021-01-06 11:37:55,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:37:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:37:56,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 11:37:56,082 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851309808] [2021-01-06 11:37:56,082 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:37:56,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 11:37:56,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977146150] [2021-01-06 11:37:56,083 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:37:56,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:37:56,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:37:56,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:37:56,084 INFO L87 Difference]: Start difference. First operand 280 states and 364 transitions. Second operand 5 states. [2021-01-06 11:37:56,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:37:56,293 INFO L93 Difference]: Finished difference Result 373 states and 478 transitions. [2021-01-06 11:37:56,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 11:37:56,294 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2021-01-06 11:37:56,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:37:56,295 INFO L225 Difference]: With dead ends: 373 [2021-01-06 11:37:56,296 INFO L226 Difference]: Without dead ends: 330 [2021-01-06 11:37:56,296 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 [2021-01-06 11:37:56,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2021-01-06 11:37:56,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 292. [2021-01-06 11:37:56,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2021-01-06 11:37:56,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 377 transitions. [2021-01-06 11:37:56,320 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 377 transitions. Word has length 44 [2021-01-06 11:37:56,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:37:56,321 INFO L481 AbstractCegarLoop]: Abstraction has 292 states and 377 transitions. [2021-01-06 11:37:56,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:37:56,321 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 377 transitions. [2021-01-06 11:37:56,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-01-06 11:37:56,322 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:37:56,322 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] [2021-01-06 11:37:56,322 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 11:37:56,322 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]=== [2021-01-06 11:37:56,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:37:56,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1353012916, now seen corresponding path program 1 times [2021-01-06 11:37:56,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:37:56,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283182923] [2021-01-06 11:37:56,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:37:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:37:56,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 11:37:56,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283182923] [2021-01-06 11:37:56,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:37:56,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:37:56,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889093929] [2021-01-06 11:37:56,501 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:37:56,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:37:56,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:37:56,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:37:56,501 INFO L87 Difference]: Start difference. First operand 292 states and 377 transitions. Second operand 4 states. [2021-01-06 11:37:56,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:37:56,662 INFO L93 Difference]: Finished difference Result 326 states and 422 transitions. [2021-01-06 11:37:56,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:37:56,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2021-01-06 11:37:56,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:37:56,663 INFO L225 Difference]: With dead ends: 326 [2021-01-06 11:37:56,663 INFO L226 Difference]: Without dead ends: 148 [2021-01-06 11:37:56,664 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 [2021-01-06 11:37:56,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2021-01-06 11:37:56,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 122. [2021-01-06 11:37:56,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2021-01-06 11:37:56,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 153 transitions. [2021-01-06 11:37:56,677 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 153 transitions. Word has length 45 [2021-01-06 11:37:56,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:37:56,677 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 153 transitions. [2021-01-06 11:37:56,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:37:56,677 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 153 transitions. [2021-01-06 11:37:56,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-01-06 11:37:56,678 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:37:56,678 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] [2021-01-06 11:37:56,678 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 11:37:56,678 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]=== [2021-01-06 11:37:56,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:37:56,679 INFO L82 PathProgramCache]: Analyzing trace with hash 760190907, now seen corresponding path program 1 times [2021-01-06 11:37:56,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:37:56,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169860806] [2021-01-06 11:37:56,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:37:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:37:56,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 11:37:56,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169860806] [2021-01-06 11:37:56,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:37:56,801 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:37:56,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439956609] [2021-01-06 11:37:56,802 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:37:56,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:37:56,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:37:56,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:37:56,803 INFO L87 Difference]: Start difference. First operand 122 states and 153 transitions. Second operand 3 states. [2021-01-06 11:37:56,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:37:56,843 INFO L93 Difference]: Finished difference Result 238 states and 299 transitions. [2021-01-06 11:37:56,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:37:56,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2021-01-06 11:37:56,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:37:56,845 INFO L225 Difference]: With dead ends: 238 [2021-01-06 11:37:56,845 INFO L226 Difference]: Without dead ends: 217 [2021-01-06 11:37:56,846 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 [2021-01-06 11:37:56,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-01-06 11:37:56,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 213. [2021-01-06 11:37:56,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2021-01-06 11:37:56,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 273 transitions. [2021-01-06 11:37:56,868 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 273 transitions. Word has length 45 [2021-01-06 11:37:56,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:37:56,868 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 273 transitions. [2021-01-06 11:37:56,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:37:56,869 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 273 transitions. [2021-01-06 11:37:56,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-01-06 11:37:56,869 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:37:56,870 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] [2021-01-06 11:37:56,870 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 11:37:56,870 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]=== [2021-01-06 11:37:56,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:37:56,871 INFO L82 PathProgramCache]: Analyzing trace with hash 760250489, now seen corresponding path program 1 times [2021-01-06 11:37:56,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:37:56,871 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723573276] [2021-01-06 11:37:56,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:37:56,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:37:56,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 11:37:56,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723573276] [2021-01-06 11:37:56,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598673748] [2021-01-06 11:37:56,975 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 [2021-01-06 11:37:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:37:57,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-06 11:37:57,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:37:57,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 11:37:57,441 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:37:57,441 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2021-01-06 11:37:57,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381179718] [2021-01-06 11:37:57,441 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 11:37:57,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:37:57,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 11:37:57,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-01-06 11:37:57,442 INFO L87 Difference]: Start difference. First operand 213 states and 273 transitions. Second operand 6 states. [2021-01-06 11:38:00,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:00,152 INFO L93 Difference]: Finished difference Result 406 states and 521 transitions. [2021-01-06 11:38:00,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 11:38:00,152 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2021-01-06 11:38:00,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:00,153 INFO L225 Difference]: With dead ends: 406 [2021-01-06 11:38:00,154 INFO L226 Difference]: Without dead ends: 207 [2021-01-06 11:38:00,154 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2021-01-06 11:38:00,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-01-06 11:38:00,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2021-01-06 11:38:00,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2021-01-06 11:38:00,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 263 transitions. [2021-01-06 11:38:00,178 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 263 transitions. Word has length 45 [2021-01-06 11:38:00,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:00,179 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 263 transitions. [2021-01-06 11:38:00,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 11:38:00,179 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 263 transitions. [2021-01-06 11:38:00,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-01-06 11:38:00,180 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:00,180 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] [2021-01-06 11:38:00,395 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-01-06 11:38:00,396 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]=== [2021-01-06 11:38:00,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:00,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1796883404, now seen corresponding path program 1 times [2021-01-06 11:38:00,398 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:00,398 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832750084] [2021-01-06 11:38:00,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:00,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 11:38:00,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832750084] [2021-01-06 11:38:00,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:00,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:38:00,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164006439] [2021-01-06 11:38:00,479 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:38:00,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:00,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:38:00,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:38:00,480 INFO L87 Difference]: Start difference. First operand 207 states and 263 transitions. Second operand 3 states. [2021-01-06 11:38:00,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:00,509 INFO L93 Difference]: Finished difference Result 396 states and 507 transitions. [2021-01-06 11:38:00,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:38:00,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2021-01-06 11:38:00,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:00,511 INFO L225 Difference]: With dead ends: 396 [2021-01-06 11:38:00,511 INFO L226 Difference]: Without dead ends: 209 [2021-01-06 11:38:00,512 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 [2021-01-06 11:38:00,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-01-06 11:38:00,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2021-01-06 11:38:00,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2021-01-06 11:38:00,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 265 transitions. [2021-01-06 11:38:00,537 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 265 transitions. Word has length 50 [2021-01-06 11:38:00,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:00,537 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 265 transitions. [2021-01-06 11:38:00,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:38:00,537 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 265 transitions. [2021-01-06 11:38:00,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-06 11:38:00,538 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:00,538 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] [2021-01-06 11:38:00,538 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 11:38:00,538 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]=== [2021-01-06 11:38:00,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:00,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1230540090, now seen corresponding path program 1 times [2021-01-06 11:38:00,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:00,539 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77296001] [2021-01-06 11:38:00,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:00,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 11:38:00,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77296001] [2021-01-06 11:38:00,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971497318] [2021-01-06 11:38:00,666 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 [2021-01-06 11:38:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:01,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 730 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-06 11:38:01,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:38:01,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-06 11:38:01,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:38:01,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2021-01-06 11:38:01,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647001993] [2021-01-06 11:38:01,112 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 11:38:01,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:01,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 11:38:01,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-01-06 11:38:01,115 INFO L87 Difference]: Start difference. First operand 209 states and 265 transitions. Second operand 7 states. [2021-01-06 11:38:01,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:01,232 INFO L93 Difference]: Finished difference Result 400 states and 513 transitions. [2021-01-06 11:38:01,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 11:38:01,232 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2021-01-06 11:38:01,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:01,234 INFO L225 Difference]: With dead ends: 400 [2021-01-06 11:38:01,234 INFO L226 Difference]: Without dead ends: 213 [2021-01-06 11:38:01,236 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 [2021-01-06 11:38:01,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-01-06 11:38:01,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2021-01-06 11:38:01,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2021-01-06 11:38:01,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 269 transitions. [2021-01-06 11:38:01,261 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 269 transitions. Word has length 51 [2021-01-06 11:38:01,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:01,261 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 269 transitions. [2021-01-06 11:38:01,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 11:38:01,261 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 269 transitions. [2021-01-06 11:38:01,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-01-06 11:38:01,262 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:01,263 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] [2021-01-06 11:38:01,476 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-01-06 11:38:01,477 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]=== [2021-01-06 11:38:01,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:01,478 INFO L82 PathProgramCache]: Analyzing trace with hash 951295051, now seen corresponding path program 2 times [2021-01-06 11:38:01,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:01,478 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193045418] [2021-01-06 11:38:01,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:01,623 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 11:38:01,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193045418] [2021-01-06 11:38:01,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335325900] [2021-01-06 11:38:01,623 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 [2021-01-06 11:38:03,706 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-01-06 11:38:03,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 11:38:03,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 7 conjunts are in the unsatisfiable core [2021-01-06 11:38:03,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:38:03,782 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 11:38:03,783 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:38:03,783 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2021-01-06 11:38:03,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465352493] [2021-01-06 11:38:03,783 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:03,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:03,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:03,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-01-06 11:38:03,784 INFO L87 Difference]: Start difference. First operand 213 states and 269 transitions. Second operand 4 states. [2021-01-06 11:38:03,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:03,838 INFO L93 Difference]: Finished difference Result 282 states and 357 transitions. [2021-01-06 11:38:03,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:03,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2021-01-06 11:38:03,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:03,840 INFO L225 Difference]: With dead ends: 282 [2021-01-06 11:38:03,841 INFO L226 Difference]: Without dead ends: 199 [2021-01-06 11:38:03,841 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 [2021-01-06 11:38:03,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-01-06 11:38:03,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2021-01-06 11:38:03,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2021-01-06 11:38:03,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 249 transitions. [2021-01-06 11:38:03,865 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 249 transitions. Word has length 53 [2021-01-06 11:38:03,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:03,865 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 249 transitions. [2021-01-06 11:38:03,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:03,865 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 249 transitions. [2021-01-06 11:38:03,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-01-06 11:38:03,866 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:03,866 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] [2021-01-06 11:38:04,079 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:38:04,081 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]=== [2021-01-06 11:38:04,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:04,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1546149704, now seen corresponding path program 1 times [2021-01-06 11:38:04,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:04,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430719111] [2021-01-06 11:38:04,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:04,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:04,248 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 11:38:04,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430719111] [2021-01-06 11:38:04,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:04,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:04,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337445538] [2021-01-06 11:38:04,249 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:04,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:04,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:04,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:04,250 INFO L87 Difference]: Start difference. First operand 199 states and 249 transitions. Second operand 4 states. [2021-01-06 11:38:04,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:04,331 INFO L93 Difference]: Finished difference Result 260 states and 329 transitions. [2021-01-06 11:38:04,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:04,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2021-01-06 11:38:04,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:04,333 INFO L225 Difference]: With dead ends: 260 [2021-01-06 11:38:04,333 INFO L226 Difference]: Without dead ends: 191 [2021-01-06 11:38:04,334 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 [2021-01-06 11:38:04,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-01-06 11:38:04,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2021-01-06 11:38:04,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2021-01-06 11:38:04,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 235 transitions. [2021-01-06 11:38:04,355 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 235 transitions. Word has length 54 [2021-01-06 11:38:04,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:04,355 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 235 transitions. [2021-01-06 11:38:04,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:04,356 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 235 transitions. [2021-01-06 11:38:04,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-01-06 11:38:04,356 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:04,357 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] [2021-01-06 11:38:04,357 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 11:38:04,358 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]=== [2021-01-06 11:38:04,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:04,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1416921754, now seen corresponding path program 1 times [2021-01-06 11:38:04,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:04,358 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135666235] [2021-01-06 11:38:04,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:04,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:04,457 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 11:38:04,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135666235] [2021-01-06 11:38:04,457 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:04,457 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:38:04,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810436639] [2021-01-06 11:38:04,459 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:38:04,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:04,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:38:04,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:38:04,460 INFO L87 Difference]: Start difference. First operand 191 states and 235 transitions. Second operand 3 states. [2021-01-06 11:38:04,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:04,537 INFO L93 Difference]: Finished difference Result 223 states and 282 transitions. [2021-01-06 11:38:04,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:38:04,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2021-01-06 11:38:04,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:04,539 INFO L225 Difference]: With dead ends: 223 [2021-01-06 11:38:04,539 INFO L226 Difference]: Without dead ends: 221 [2021-01-06 11:38:04,541 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 [2021-01-06 11:38:04,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-01-06 11:38:04,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 199. [2021-01-06 11:38:04,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2021-01-06 11:38:04,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 247 transitions. [2021-01-06 11:38:04,595 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 247 transitions. Word has length 56 [2021-01-06 11:38:04,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:04,596 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 247 transitions. [2021-01-06 11:38:04,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:38:04,596 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 247 transitions. [2021-01-06 11:38:04,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-01-06 11:38:04,597 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:04,597 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] [2021-01-06 11:38:04,597 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 11:38:04,598 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]=== [2021-01-06 11:38:04,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:04,598 INFO L82 PathProgramCache]: Analyzing trace with hash 392716879, now seen corresponding path program 1 times [2021-01-06 11:38:04,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:04,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275488622] [2021-01-06 11:38:04,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:04,741 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 11:38:04,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275488622] [2021-01-06 11:38:04,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920506683] [2021-01-06 11:38:04,742 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 [2021-01-06 11:38:05,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:05,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-06 11:38:05,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:38:05,141 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 11:38:05,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:38:05,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2021-01-06 11:38:05,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506485003] [2021-01-06 11:38:05,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 11:38:05,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:05,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 11:38:05,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-01-06 11:38:05,143 INFO L87 Difference]: Start difference. First operand 199 states and 247 transitions. Second operand 9 states. [2021-01-06 11:38:05,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:05,276 INFO L93 Difference]: Finished difference Result 378 states and 475 transitions. [2021-01-06 11:38:05,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 11:38:05,276 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2021-01-06 11:38:05,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:05,278 INFO L225 Difference]: With dead ends: 378 [2021-01-06 11:38:05,278 INFO L226 Difference]: Without dead ends: 203 [2021-01-06 11:38:05,278 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 [2021-01-06 11:38:05,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-01-06 11:38:05,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2021-01-06 11:38:05,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2021-01-06 11:38:05,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 251 transitions. [2021-01-06 11:38:05,302 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 251 transitions. Word has length 56 [2021-01-06 11:38:05,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:05,302 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 251 transitions. [2021-01-06 11:38:05,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 11:38:05,303 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 251 transitions. [2021-01-06 11:38:05,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-01-06 11:38:05,303 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:05,304 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] [2021-01-06 11:38:05,518 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:38:05,519 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]=== [2021-01-06 11:38:05,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:05,520 INFO L82 PathProgramCache]: Analyzing trace with hash -499644460, now seen corresponding path program 2 times [2021-01-06 11:38:05,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:05,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765714642] [2021-01-06 11:38:05,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:05,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:05,716 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 11:38:05,716 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765714642] [2021-01-06 11:38:05,716 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853446916] [2021-01-06 11:38:05,717 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 [2021-01-06 11:38:05,950 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-01-06 11:38:05,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 11:38:05,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-06 11:38:05,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:38:06,056 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-01-06 11:38:06,057 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:38:06,057 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2021-01-06 11:38:06,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871913256] [2021-01-06 11:38:06,057 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:38:06,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:06,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:38:06,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-01-06 11:38:06,058 INFO L87 Difference]: Start difference. First operand 203 states and 251 transitions. Second operand 5 states. [2021-01-06 11:38:06,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:06,204 INFO L93 Difference]: Finished difference Result 294 states and 361 transitions. [2021-01-06 11:38:06,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 11:38:06,205 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2021-01-06 11:38:06,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:06,206 INFO L225 Difference]: With dead ends: 294 [2021-01-06 11:38:06,206 INFO L226 Difference]: Without dead ends: 273 [2021-01-06 11:38:06,207 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 [2021-01-06 11:38:06,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-01-06 11:38:06,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 209. [2021-01-06 11:38:06,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2021-01-06 11:38:06,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 257 transitions. [2021-01-06 11:38:06,233 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 257 transitions. Word has length 58 [2021-01-06 11:38:06,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:06,234 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 257 transitions. [2021-01-06 11:38:06,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:38:06,234 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 257 transitions. [2021-01-06 11:38:06,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-01-06 11:38:06,235 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:06,235 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] [2021-01-06 11:38:06,448 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-01-06 11:38:06,449 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]=== [2021-01-06 11:38:06,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:06,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1419009549, now seen corresponding path program 1 times [2021-01-06 11:38:06,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:06,450 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807021049] [2021-01-06 11:38:06,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:06,733 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-01-06 11:38:06,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807021049] [2021-01-06 11:38:06,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:06,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 11:38:06,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062801439] [2021-01-06 11:38:06,734 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 11:38:06,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:06,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 11:38:06,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 11:38:06,736 INFO L87 Difference]: Start difference. First operand 209 states and 257 transitions. Second operand 4 states. [2021-01-06 11:38:08,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:08,837 INFO L93 Difference]: Finished difference Result 240 states and 290 transitions. [2021-01-06 11:38:08,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 11:38:08,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2021-01-06 11:38:08,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:08,839 INFO L225 Difference]: With dead ends: 240 [2021-01-06 11:38:08,839 INFO L226 Difference]: Without dead ends: 203 [2021-01-06 11:38:08,840 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 [2021-01-06 11:38:08,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2021-01-06 11:38:08,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2021-01-06 11:38:08,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2021-01-06 11:38:08,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 243 transitions. [2021-01-06 11:38:08,867 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 243 transitions. Word has length 59 [2021-01-06 11:38:08,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:08,867 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 243 transitions. [2021-01-06 11:38:08,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 11:38:08,867 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 243 transitions. [2021-01-06 11:38:08,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-01-06 11:38:08,868 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:08,868 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] [2021-01-06 11:38:08,868 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-01-06 11:38:08,869 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]=== [2021-01-06 11:38:08,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:08,869 INFO L82 PathProgramCache]: Analyzing trace with hash 410310603, now seen corresponding path program 1 times [2021-01-06 11:38:08,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:08,869 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816755147] [2021-01-06 11:38:08,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:08,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:08,978 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-01-06 11:38:08,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816755147] [2021-01-06 11:38:08,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:08,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:38:08,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695287367] [2021-01-06 11:38:08,979 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:38:08,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:08,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:38:08,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:38:08,980 INFO L87 Difference]: Start difference. First operand 203 states and 243 transitions. Second operand 3 states. [2021-01-06 11:38:11,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:11,039 INFO L93 Difference]: Finished difference Result 277 states and 326 transitions. [2021-01-06 11:38:11,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:38:11,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2021-01-06 11:38:11,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:11,041 INFO L225 Difference]: With dead ends: 277 [2021-01-06 11:38:11,041 INFO L226 Difference]: Without dead ends: 226 [2021-01-06 11:38:11,041 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 [2021-01-06 11:38:11,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-01-06 11:38:11,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 197. [2021-01-06 11:38:11,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2021-01-06 11:38:11,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 232 transitions. [2021-01-06 11:38:11,065 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 232 transitions. Word has length 59 [2021-01-06 11:38:11,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:11,066 INFO L481 AbstractCegarLoop]: Abstraction has 197 states and 232 transitions. [2021-01-06 11:38:11,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:38:11,066 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 232 transitions. [2021-01-06 11:38:11,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-01-06 11:38:11,067 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:11,067 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] [2021-01-06 11:38:11,067 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-01-06 11:38:11,067 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]=== [2021-01-06 11:38:11,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:11,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1683349608, now seen corresponding path program 1 times [2021-01-06 11:38:11,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:11,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273465006] [2021-01-06 11:38:11,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:11,200 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 11:38:11,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273465006] [2021-01-06 11:38:11,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177963688] [2021-01-06 11:38:11,201 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 [2021-01-06 11:38:11,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:11,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-06 11:38:11,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:38:11,659 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 11:38:11,659 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:38:11,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2021-01-06 11:38:11,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129659408] [2021-01-06 11:38:11,660 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 11:38:11,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:11,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 11:38:11,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-01-06 11:38:11,661 INFO L87 Difference]: Start difference. First operand 197 states and 232 transitions. Second operand 11 states. [2021-01-06 11:38:11,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:11,828 INFO L93 Difference]: Finished difference Result 372 states and 443 transitions. [2021-01-06 11:38:11,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 11:38:11,829 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2021-01-06 11:38:11,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:11,830 INFO L225 Difference]: With dead ends: 372 [2021-01-06 11:38:11,830 INFO L226 Difference]: Without dead ends: 201 [2021-01-06 11:38:11,830 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 [2021-01-06 11:38:11,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-01-06 11:38:11,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2021-01-06 11:38:11,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2021-01-06 11:38:11,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 236 transitions. [2021-01-06 11:38:11,856 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 236 transitions. Word has length 59 [2021-01-06 11:38:11,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:11,856 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 236 transitions. [2021-01-06 11:38:11,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 11:38:11,857 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 236 transitions. [2021-01-06 11:38:11,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-01-06 11:38:11,857 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:11,858 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] [2021-01-06 11:38:12,070 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:38:12,071 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]=== [2021-01-06 11:38:12,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:12,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1287593427, now seen corresponding path program 2 times [2021-01-06 11:38:12,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:12,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939265479] [2021-01-06 11:38:12,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:12,225 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:38:12,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939265479] [2021-01-06 11:38:12,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349303329] [2021-01-06 11:38:12,225 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 [2021-01-06 11:38:12,544 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-01-06 11:38:12,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 11:38:12,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 7 conjunts are in the unsatisfiable core [2021-01-06 11:38:12,550 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:38:12,625 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-01-06 11:38:12,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:38:12,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2021-01-06 11:38:12,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326072899] [2021-01-06 11:38:12,626 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:38:12,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:12,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:38:12,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-01-06 11:38:12,627 INFO L87 Difference]: Start difference. First operand 201 states and 236 transitions. Second operand 5 states. [2021-01-06 11:38:12,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:12,773 INFO L93 Difference]: Finished difference Result 294 states and 339 transitions. [2021-01-06 11:38:12,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 11:38:12,773 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2021-01-06 11:38:12,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:12,775 INFO L225 Difference]: With dead ends: 294 [2021-01-06 11:38:12,775 INFO L226 Difference]: Without dead ends: 245 [2021-01-06 11:38:12,776 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-01-06 11:38:12,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-01-06 11:38:12,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 195. [2021-01-06 11:38:12,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2021-01-06 11:38:12,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 224 transitions. [2021-01-06 11:38:12,801 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 224 transitions. Word has length 61 [2021-01-06 11:38:12,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:12,801 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 224 transitions. [2021-01-06 11:38:12,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:38:12,801 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 224 transitions. [2021-01-06 11:38:12,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-01-06 11:38:12,802 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:12,802 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] [2021-01-06 11:38:13,016 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-01-06 11:38:13,017 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]=== [2021-01-06 11:38:13,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:13,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1128407128, now seen corresponding path program 1 times [2021-01-06 11:38:13,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:13,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170392519] [2021-01-06 11:38:13,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:13,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:13,122 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-01-06 11:38:13,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170392519] [2021-01-06 11:38:13,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:13,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 11:38:13,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913825158] [2021-01-06 11:38:13,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 11:38:13,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:13,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 11:38:13,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 11:38:13,124 INFO L87 Difference]: Start difference. First operand 195 states and 224 transitions. Second operand 3 states. [2021-01-06 11:38:15,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:15,200 INFO L93 Difference]: Finished difference Result 224 states and 256 transitions. [2021-01-06 11:38:15,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 11:38:15,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2021-01-06 11:38:15,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:15,202 INFO L225 Difference]: With dead ends: 224 [2021-01-06 11:38:15,202 INFO L226 Difference]: Without dead ends: 175 [2021-01-06 11:38:15,202 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 [2021-01-06 11:38:15,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2021-01-06 11:38:15,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2021-01-06 11:38:15,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2021-01-06 11:38:15,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 197 transitions. [2021-01-06 11:38:15,223 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 197 transitions. Word has length 67 [2021-01-06 11:38:15,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:15,223 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 197 transitions. [2021-01-06 11:38:15,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 11:38:15,224 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 197 transitions. [2021-01-06 11:38:15,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-06 11:38:15,224 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:15,225 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] [2021-01-06 11:38:15,225 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-01-06 11:38:15,225 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]=== [2021-01-06 11:38:15,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:15,225 INFO L82 PathProgramCache]: Analyzing trace with hash 155059303, now seen corresponding path program 1 times [2021-01-06 11:38:15,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:15,226 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285958918] [2021-01-06 11:38:15,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:15,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:15,395 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-01-06 11:38:15,396 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285958918] [2021-01-06 11:38:15,396 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:15,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 11:38:15,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676499117] [2021-01-06 11:38:15,396 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 11:38:15,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:15,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 11:38:15,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-06 11:38:15,397 INFO L87 Difference]: Start difference. First operand 175 states and 197 transitions. Second operand 7 states. [2021-01-06 11:38:17,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:17,573 INFO L93 Difference]: Finished difference Result 196 states and 219 transitions. [2021-01-06 11:38:17,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 11:38:17,574 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2021-01-06 11:38:17,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:17,575 INFO L225 Difference]: With dead ends: 196 [2021-01-06 11:38:17,575 INFO L226 Difference]: Without dead ends: 161 [2021-01-06 11:38:17,576 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 [2021-01-06 11:38:17,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-01-06 11:38:17,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2021-01-06 11:38:17,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2021-01-06 11:38:17,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 181 transitions. [2021-01-06 11:38:17,595 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 181 transitions. Word has length 73 [2021-01-06 11:38:17,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:17,595 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 181 transitions. [2021-01-06 11:38:17,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 11:38:17,596 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 181 transitions. [2021-01-06 11:38:17,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-06 11:38:17,596 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:17,597 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] [2021-01-06 11:38:17,597 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-01-06 11:38:17,597 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]=== [2021-01-06 11:38:17,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:17,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1942648039, now seen corresponding path program 1 times [2021-01-06 11:38:17,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:17,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673161049] [2021-01-06 11:38:17,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:17,723 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-01-06 11:38:17,723 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673161049] [2021-01-06 11:38:17,723 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 11:38:17,724 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 11:38:17,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324478074] [2021-01-06 11:38:17,724 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:38:17,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:17,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:38:17,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 11:38:17,725 INFO L87 Difference]: Start difference. First operand 161 states and 181 transitions. Second operand 5 states. [2021-01-06 11:38:19,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:19,823 INFO L93 Difference]: Finished difference Result 178 states and 198 transitions. [2021-01-06 11:38:19,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 11:38:19,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2021-01-06 11:38:19,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:19,825 INFO L225 Difference]: With dead ends: 178 [2021-01-06 11:38:19,825 INFO L226 Difference]: Without dead ends: 161 [2021-01-06 11:38:19,826 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 [2021-01-06 11:38:19,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-01-06 11:38:19,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2021-01-06 11:38:19,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2021-01-06 11:38:19,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 177 transitions. [2021-01-06 11:38:19,845 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 177 transitions. Word has length 73 [2021-01-06 11:38:19,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:19,845 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 177 transitions. [2021-01-06 11:38:19,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:38:19,845 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 177 transitions. [2021-01-06 11:38:19,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-01-06 11:38:19,846 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:19,846 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] [2021-01-06 11:38:19,846 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-01-06 11:38:19,847 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]=== [2021-01-06 11:38:19,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:19,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1612805929, now seen corresponding path program 1 times [2021-01-06 11:38:19,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:19,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483855947] [2021-01-06 11:38:19,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:19,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:20,018 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:38:20,018 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483855947] [2021-01-06 11:38:20,018 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218690267] [2021-01-06 11:38:20,018 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 [2021-01-06 11:38:20,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:20,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 7 conjunts are in the unsatisfiable core [2021-01-06 11:38:20,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:38:20,476 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 11:38:20,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:38:20,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2021-01-06 11:38:20,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122216481] [2021-01-06 11:38:20,477 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 11:38:20,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:20,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 11:38:20,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-01-06 11:38:20,478 INFO L87 Difference]: Start difference. First operand 159 states and 177 transitions. Second operand 13 states. [2021-01-06 11:38:20,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:20,692 INFO L93 Difference]: Finished difference Result 294 states and 331 transitions. [2021-01-06 11:38:20,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 11:38:20,693 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 74 [2021-01-06 11:38:20,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:20,694 INFO L225 Difference]: With dead ends: 294 [2021-01-06 11:38:20,694 INFO L226 Difference]: Without dead ends: 163 [2021-01-06 11:38:20,695 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-01-06 11:38:20,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-01-06 11:38:20,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2021-01-06 11:38:20,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2021-01-06 11:38:20,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 181 transitions. [2021-01-06 11:38:20,714 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 181 transitions. Word has length 74 [2021-01-06 11:38:20,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:20,715 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 181 transitions. [2021-01-06 11:38:20,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 11:38:20,715 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 181 transitions. [2021-01-06 11:38:20,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-01-06 11:38:20,716 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:20,716 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] [2021-01-06 11:38:20,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2021-01-06 11:38:20,932 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]=== [2021-01-06 11:38:20,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:20,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1241887836, now seen corresponding path program 2 times [2021-01-06 11:38:20,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:20,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140199153] [2021-01-06 11:38:20,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:21,122 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-01-06 11:38:21,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140199153] [2021-01-06 11:38:21,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702781832] [2021-01-06 11:38:21,123 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 [2021-01-06 11:38:21,430 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-01-06 11:38:21,430 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 11:38:21,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-06 11:38:21,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:38:21,541 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-01-06 11:38:21,541 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 11:38:21,542 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2021-01-06 11:38:21,542 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776446367] [2021-01-06 11:38:21,542 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 11:38:21,542 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:21,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 11:38:21,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-01-06 11:38:21,543 INFO L87 Difference]: Start difference. First operand 163 states and 181 transitions. Second operand 5 states. [2021-01-06 11:38:21,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:21,642 INFO L93 Difference]: Finished difference Result 194 states and 215 transitions. [2021-01-06 11:38:21,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 11:38:21,647 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2021-01-06 11:38:21,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:21,648 INFO L225 Difference]: With dead ends: 194 [2021-01-06 11:38:21,648 INFO L226 Difference]: Without dead ends: 143 [2021-01-06 11:38:21,649 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 [2021-01-06 11:38:21,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-01-06 11:38:21,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2021-01-06 11:38:21,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2021-01-06 11:38:21,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 155 transitions. [2021-01-06 11:38:21,668 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 155 transitions. Word has length 76 [2021-01-06 11:38:21,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:21,668 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 155 transitions. [2021-01-06 11:38:21,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 11:38:21,669 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 155 transitions. [2021-01-06 11:38:21,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-01-06 11:38:21,670 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:21,670 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] [2021-01-06 11:38:21,884 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:38:21,885 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]=== [2021-01-06 11:38:21,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:21,887 INFO L82 PathProgramCache]: Analyzing trace with hash 763521196, now seen corresponding path program 1 times [2021-01-06 11:38:21,887 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:21,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101616101] [2021-01-06 11:38:21,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:22,082 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-01-06 11:38:22,082 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101616101] [2021-01-06 11:38:22,082 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069463987] [2021-01-06 11:38:22,082 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 [2021-01-06 11:38:22,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:22,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 871 conjuncts, 8 conjunts are in the unsatisfiable core [2021-01-06 11:38:22,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 11:38:22,641 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-01-06 11:38:22,641 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 11:38:22,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2021-01-06 11:38:22,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577297656] [2021-01-06 11:38:22,642 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-06 11:38:22,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 11:38:22,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-06 11:38:22,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2021-01-06 11:38:22,643 INFO L87 Difference]: Start difference. First operand 143 states and 155 transitions. Second operand 15 states. [2021-01-06 11:38:22,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 11:38:22,902 INFO L93 Difference]: Finished difference Result 260 states and 285 transitions. [2021-01-06 11:38:22,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 11:38:22,903 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 81 [2021-01-06 11:38:22,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 11:38:22,904 INFO L225 Difference]: With dead ends: 260 [2021-01-06 11:38:22,904 INFO L226 Difference]: Without dead ends: 147 [2021-01-06 11:38:22,905 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 [2021-01-06 11:38:22,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-01-06 11:38:22,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2021-01-06 11:38:22,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2021-01-06 11:38:22,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 159 transitions. [2021-01-06 11:38:22,923 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 159 transitions. Word has length 81 [2021-01-06 11:38:22,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 11:38:22,923 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 159 transitions. [2021-01-06 11:38:22,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-06 11:38:22,923 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 159 transitions. [2021-01-06 11:38:22,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-01-06 11:38:22,924 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 11:38:22,924 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] [2021-01-06 11:38:23,138 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 11:38:23,139 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]=== [2021-01-06 11:38:23,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 11:38:23,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1876993521, now seen corresponding path program 2 times [2021-01-06 11:38:23,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 11:38:23,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469107755] [2021-01-06 11:38:23,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 11:38:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 11:38:23,376 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-01-06 11:38:23,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469107755] [2021-01-06 11:38:23,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993258157] [2021-01-06 11:38:23,376 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