/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/aws-c-common/aws_priority_queue_size_harness.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 00:10:46,177 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 00:10:46,181 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 00:10:46,233 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 00:10:46,234 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 00:10:46,238 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 00:10:46,242 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 00:10:46,248 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 00:10:46,252 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 00:10:46,260 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 00:10:46,265 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 00:10:46,267 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 00:10:46,268 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 00:10:46,271 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 00:10:46,273 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 00:10:46,275 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 00:10:46,276 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 00:10:46,285 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 00:10:46,294 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 00:10:46,299 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 00:10:46,304 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 00:10:46,306 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 00:10:46,308 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 00:10:46,310 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 00:10:46,333 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 00:10:46,336 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 00:10:46,337 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 00:10:46,338 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 00:10:46,338 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 00:10:46,339 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 00:10:46,340 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 00:10:46,341 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 00:10:46,341 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 00:10:46,342 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 00:10:46,343 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 00:10:46,344 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 00:10:46,344 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 00:10:46,345 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 00:10:46,345 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 00:10:46,346 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 00:10:46,346 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 00:10:46,348 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-07 00:10:46,373 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 00:10:46,373 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 00:10:46,375 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 00:10:46,375 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 00:10:46,375 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 00:10:46,375 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 00:10:46,376 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 00:10:46,376 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 00:10:46,376 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-07 00:10:46,376 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 00:10:46,376 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-07 00:10:46,377 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-07 00:10:46,377 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 00:10:46,377 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-07 00:10:46,377 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 00:10:46,377 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 00:10:46,378 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 00:10:46,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 00:10:46,378 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 00:10:46,378 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 00:10:46,379 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-07 00:10:46,379 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 00:10:46,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 00:10:46,379 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-07 00:10:46,379 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 00:10:46,379 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-07 00:10:46,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 00:10:46,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 00:10:46,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 00:10:46,789 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 00:10:46,791 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 00:10:46,792 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_priority_queue_size_harness.i [2021-01-07 00:10:46,895 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d730a572a/f3de5029075a4e1e954d60de1724c6ee/FLAG30f1d07e4 [2021-01-07 00:10:48,099 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 00:10:48,100 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_priority_queue_size_harness.i [2021-01-07 00:10:48,147 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d730a572a/f3de5029075a4e1e954d60de1724c6ee/FLAG30f1d07e4 [2021-01-07 00:10:48,422 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d730a572a/f3de5029075a4e1e954d60de1724c6ee [2021-01-07 00:10:48,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 00:10:48,430 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 00:10:48,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 00:10:48,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 00:10:48,438 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 00:10:48,439 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 12:10:48" (1/1) ... [2021-01-07 00:10:48,442 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fc66cb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:10:48, skipping insertion in model container [2021-01-07 00:10:48,442 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 12:10:48" (1/1) ... [2021-01-07 00:10:48,452 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 00:10:48,583 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-07 00:10:48,960 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/aws-c-common/aws_priority_queue_size_harness.i[4497,4510] [2021-01-07 00:10:48,970 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/aws-c-common/aws_priority_queue_size_harness.i[4557,4570] [2021-01-07 00:10:49,007 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-01-07 00:10:49,017 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~result,] left hand side expression in assignment: address: IdentifierExpression[~result,] [2021-01-07 00:10:50,180 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy left hand side expression in assignment: lhs: VariableLHS[~allocation~0,] left hand side expression in assignment: lhs: VariableLHS[~alloc_size~1,] left hand side expression in assignment: address: IdentifierExpression[~out_ptr~0,] left hand side expression in assignment: address: IdentifierExpression[~ptr,] left hand side expression in assignment: address: IdentifierExpression[~ptr,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] [2021-01-07 00:10:50,321 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:50,322 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:50,323 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:50,324 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:50,326 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~list_a,] left hand side expression in assignment: address: IdentifierExpression[~list_b,] [2021-01-07 00:10:50,359 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:50,360 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:50,362 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:50,363 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: IdentifierExpression[~val,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[5],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[6],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[7],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~head_reaches_tail~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~to_add,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],StructAccessExpression[IdentifierExpression[~to_add,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem348,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem348,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~after,],base],StructAccessExpression[IdentifierExpression[~after,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem359,],base],StructAccessExpression[IdentifierExpression[#t~mem359,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem360,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem360,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[StructAccessExpression[IdentifierExpression[~tmp~1,],prev],base],StructAccessExpression[StructAccessExpression[IdentifierExpression[~tmp~1,],prev],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[StructAccessExpression[IdentifierExpression[~tmp~1,],next],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[StructAccessExpression[IdentifierExpression[~tmp~1,],next],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: address: IdentifierExpression[~a,] left hand side expression in assignment: address: IdentifierExpression[~b,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],StructAccessExpression[IdentifierExpression[~to_add,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~to_add,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem371,],base],StructAccessExpression[IdentifierExpression[#t~mem371,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~before,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~before,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem378,],base],StructAccessExpression[IdentifierExpression[#t~mem378,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem380,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem380,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a,],base],StructAccessExpression[IdentifierExpression[~a,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem424,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem424,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~a,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem426,],base],StructAccessExpression[IdentifierExpression[#t~mem426,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~b,],base],StructAccessExpression[IdentifierExpression[~b,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem427,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem427,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~b,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~b,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem428,],base],StructAccessExpression[IdentifierExpression[#t~mem428,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~var,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~var,],base],StructAccessExpression[IdentifierExpression[~var,],offset]]] [2021-01-07 00:10:50,848 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-01-07 00:10:50,849 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-01-07 00:10:50,850 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-01-07 00:10:50,851 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-01-07 00:10:50,853 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-01-07 00:10:50,853 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-01-07 00:10:50,854 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-01-07 00:10:50,855 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-01-07 00:10:50,855 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-01-07 00:10:50,856 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ring_buf,],base],StructAccessExpression[IdentifierExpression[~ring_buf,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ring_buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~ring_buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ring_buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~ring_buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cursor,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~cursor,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~curr~0,],base],StructAccessExpression[IdentifierExpression[~curr~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~node~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~node~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~curr~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~curr~0,],base],StructAccessExpression[IdentifierExpression[~curr~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~queue,],base],StructAccessExpression[IdentifierExpression[~queue,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem551,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem551,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem554,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem554,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~rval,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~str~0,],base],StructAccessExpression[IdentifierExpression[~str~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~str~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~str~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~str~0,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~str~0,],offset]],BinaryExpression[ARITHMOD,IdentifierExpression[~len,],IntegerLiteral[4294967296]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~storage,],base],StructAccessExpression[IdentifierExpression[~storage,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~storage,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~storage,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tl_last_error~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sp~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~sp~0,],offset],IfThenElseExpression[BinaryExpression[COMPLEQ,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~6,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[9223372036854775807]],BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~6,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~6,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~queue,],base],StructAccessExpression[IdentifierExpression[~queue,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~queue,],base],StructAccessExpression[IdentifierExpression[~queue,],offset]]] [2021-01-07 00:10:51,023 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:51,024 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:51,076 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 00:10:51,110 INFO L203 MainTranslator]: Completed pre-run [2021-01-07 00:10:51,128 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/aws-c-common/aws_priority_queue_size_harness.i[4497,4510] [2021-01-07 00:10:51,129 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/aws-c-common/aws_priority_queue_size_harness.i[4557,4570] [2021-01-07 00:10:51,131 WARN L612 FunctionHandler]: implicit declaration of function __builtin_uaddl_overflow [2021-01-07 00:10:51,132 WARN L612 FunctionHandler]: implicit declaration of function __builtin_umull_overflow left hand side expression in assignment: lhs: VariableLHS[~i~0,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~r,] left hand side expression in assignment: address: IdentifierExpression[~result,] left hand side expression in assignment: address: IdentifierExpression[~result,] [2021-01-07 00:10:51,165 WARN L612 FunctionHandler]: implicit declaration of function __builtin_va_copy left hand side expression in assignment: lhs: VariableLHS[~allocation~0,] left hand side expression in assignment: lhs: VariableLHS[~alloc_size~1,] left hand side expression in assignment: address: IdentifierExpression[~out_ptr~0,] left hand side expression in assignment: address: IdentifierExpression[~ptr,] left hand side expression in assignment: address: IdentifierExpression[~ptr,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] [2021-01-07 00:10:51,192 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:51,192 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:51,193 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:51,193 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:51,194 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~list_a,] left hand side expression in assignment: address: IdentifierExpression[~list_b,] [2021-01-07 00:10:51,205 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:51,206 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:51,208 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:51,208 WARN L1512 CHandler]: Possible shadowing of function index left hand side expression in assignment: address: IdentifierExpression[~val,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~ret_storage~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[1],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[2],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[5],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[6],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ret_storage~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[7],StructAccessExpression[IdentifierExpression[~ret_storage~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~head_reaches_tail~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~to_add,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],StructAccessExpression[IdentifierExpression[~to_add,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem362,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem362,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~after,],base],StructAccessExpression[IdentifierExpression[~after,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem373,],base],StructAccessExpression[IdentifierExpression[#t~mem373,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem374,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem374,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem375,],base],StructAccessExpression[IdentifierExpression[#t~mem375,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem376,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem376,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~#tmp~1,] left hand side expression in assignment: address: IdentifierExpression[~a,] left hand side expression in assignment: address: IdentifierExpression[~b,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],StructAccessExpression[IdentifierExpression[~to_add,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~to_add,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~to_add,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem389,],base],StructAccessExpression[IdentifierExpression[#t~mem389,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~before,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~before,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem396,],base],StructAccessExpression[IdentifierExpression[#t~mem396,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem398,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem398,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a,],base],StructAccessExpression[IdentifierExpression[~a,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem442,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem442,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~a,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem444,],base],StructAccessExpression[IdentifierExpression[#t~mem444,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~b,],base],StructAccessExpression[IdentifierExpression[~b,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem445,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem445,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~b,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~b,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem446,],base],StructAccessExpression[IdentifierExpression[#t~mem446,],offset]]] left hand side expression in assignment: address: IdentifierExpression[~var,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~var,],base],StructAccessExpression[IdentifierExpression[~var,],offset]]] [2021-01-07 00:10:51,255 WARN L612 FunctionHandler]: implicit declaration of function __atomic_load_n [2021-01-07 00:10:51,256 WARN L612 FunctionHandler]: implicit declaration of function __atomic_store_n [2021-01-07 00:10:51,257 WARN L612 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2021-01-07 00:10:51,258 WARN L612 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2021-01-07 00:10:51,259 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2021-01-07 00:10:51,260 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2021-01-07 00:10:51,260 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2021-01-07 00:10:51,261 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2021-01-07 00:10:51,262 WARN L612 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2021-01-07 00:10:51,262 WARN L612 FunctionHandler]: implicit declaration of function __atomic_thread_fence left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ring_buf,],base],StructAccessExpression[IdentifierExpression[~ring_buf,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ring_buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~ring_buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ring_buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[32],StructAccessExpression[IdentifierExpression[~ring_buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~buf,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~buf,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~cursor,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~cursor,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[20],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],StructAccessExpression[IdentifierExpression[~list,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~curr~0,],base],StructAccessExpression[IdentifierExpression[~curr~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~node~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~node~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~curr~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~curr~0,],base],StructAccessExpression[IdentifierExpression[~curr~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~list,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~list,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~queue,],base],StructAccessExpression[IdentifierExpression[~queue,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem569,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[#t~mem569,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem572,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[#t~mem572,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~rval,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~str~0,],base],StructAccessExpression[IdentifierExpression[~str~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~str~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~str~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~str~0,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~str~0,],offset]],BinaryExpression[ARITHMOD,IdentifierExpression[~len,],IntegerLiteral[4294967296]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~storage,],base],StructAccessExpression[IdentifierExpression[~storage,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~storage,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~storage,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tl_last_error~0,GLOBAL] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sp~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~sp~0,],offset],IfThenElseExpression[BinaryExpression[COMPLEQ,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~6,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[9223372036854775807]],BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~6,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMOD,BinaryExpression[ARITHMOD,IdentifierExpression[~i~6,],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]],IntegerLiteral[18446744073709551616]]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~queue,],base],StructAccessExpression[IdentifierExpression[~queue,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~queue,],base],StructAccessExpression[IdentifierExpression[~queue,],offset]]] [2021-01-07 00:10:51,334 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:51,336 WARN L1512 CHandler]: Possible shadowing of function index [2021-01-07 00:10:51,387 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 00:10:52,309 INFO L208 MainTranslator]: Completed translation [2021-01-07 00:10:52,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:10:52 WrapperNode [2021-01-07 00:10:52,310 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 00:10:52,312 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 00:10:52,312 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 00:10:52,312 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 00:10:52,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:10:52" (1/1) ... [2021-01-07 00:10:52,454 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:10:52" (1/1) ... [2021-01-07 00:10:52,590 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 00:10:52,593 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 00:10:52,593 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 00:10:52,593 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 00:10:52,605 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:10:52" (1/1) ... [2021-01-07 00:10:52,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:10:52" (1/1) ... [2021-01-07 00:10:52,648 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:10:52" (1/1) ... [2021-01-07 00:10:52,649 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:10:52" (1/1) ... [2021-01-07 00:10:52,734 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:10:52" (1/1) ... [2021-01-07 00:10:52,760 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:10:52" (1/1) ... [2021-01-07 00:10:52,787 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:10:52" (1/1) ... [2021-01-07 00:10:52,813 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 00:10:52,815 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 00:10:52,815 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 00:10:52,816 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 00:10:52,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:10:52" (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-07 00:10:52,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 00:10:52,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 00:10:52,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 00:10:52,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 00:10:52,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 00:10:52,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 00:10:52,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 00:10:52,937 INFO L130 BoogieDeclarations]: Found specification of procedure __builtin_umull_overflow [2021-01-07 00:10:52,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 00:10:52,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-01-07 00:10:52,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 00:10:52,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 00:11:02,814 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 00:11:02,815 INFO L299 CfgBuilder]: Removed 188 assume(true) statements. [2021-01-07 00:11:02,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 12:11:02 BoogieIcfgContainer [2021-01-07 00:11:02,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 00:11:02,820 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 00:11:02,820 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 00:11:02,824 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 00:11:02,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 12:10:48" (1/3) ... [2021-01-07 00:11:02,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f1ead6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 12:11:02, skipping insertion in model container [2021-01-07 00:11:02,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 12:10:52" (2/3) ... [2021-01-07 00:11:02,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f1ead6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 12:11:02, skipping insertion in model container [2021-01-07 00:11:02,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 12:11:02" (3/3) ... [2021-01-07 00:11:02,828 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_priority_queue_size_harness.i [2021-01-07 00:11:02,836 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 00:11:02,842 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2021-01-07 00:11:02,865 INFO L253 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2021-01-07 00:11:02,898 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 00:11:02,898 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-07 00:11:02,898 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 00:11:02,898 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 00:11:02,899 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 00:11:02,899 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 00:11:02,899 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 00:11:02,899 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 00:11:02,924 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states. [2021-01-07 00:11:02,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-01-07 00:11:02,934 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:11:02,935 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-07 00:11:02,936 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:11:02,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:11:02,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1385932008, now seen corresponding path program 1 times [2021-01-07 00:11:02,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:11:02,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121801017] [2021-01-07 00:11:02,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:11:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:11:03,853 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-07 00:11:03,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121801017] [2021-01-07 00:11:03,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:11:03,857 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 00:11:03,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838483438] [2021-01-07 00:11:03,877 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-07 00:11:03,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:11:03,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-07 00:11:03,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 00:11:03,901 INFO L87 Difference]: Start difference. First operand 246 states. Second operand 2 states. [2021-01-07 00:11:03,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:11:03,992 INFO L93 Difference]: Finished difference Result 486 states and 661 transitions. [2021-01-07 00:11:03,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-07 00:11:03,995 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 40 [2021-01-07 00:11:03,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:11:04,019 INFO L225 Difference]: With dead ends: 486 [2021-01-07 00:11:04,019 INFO L226 Difference]: Without dead ends: 239 [2021-01-07 00:11:04,028 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-07 00:11:04,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-01-07 00:11:04,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2021-01-07 00:11:04,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2021-01-07 00:11:04,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 298 transitions. [2021-01-07 00:11:04,131 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 298 transitions. Word has length 40 [2021-01-07 00:11:04,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:11:04,132 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 298 transitions. [2021-01-07 00:11:04,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-07 00:11:04,132 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 298 transitions. [2021-01-07 00:11:04,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-01-07 00:11:04,137 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:11:04,137 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-07 00:11:04,137 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 00:11:04,138 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:11:04,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:11:04,141 INFO L82 PathProgramCache]: Analyzing trace with hash 577264856, now seen corresponding path program 1 times [2021-01-07 00:11:04,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:11:04,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301448378] [2021-01-07 00:11:04,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:11:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:11:04,731 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-07 00:11:04,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301448378] [2021-01-07 00:11:04,732 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:11:04,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:11:04,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375258287] [2021-01-07 00:11:04,743 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:11:04,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:11:04,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:11:04,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:11:04,746 INFO L87 Difference]: Start difference. First operand 239 states and 298 transitions. Second operand 4 states. [2021-01-07 00:11:04,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:11:04,867 INFO L93 Difference]: Finished difference Result 398 states and 491 transitions. [2021-01-07 00:11:04,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 00:11:04,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2021-01-07 00:11:04,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:11:04,873 INFO L225 Difference]: With dead ends: 398 [2021-01-07 00:11:04,873 INFO L226 Difference]: Without dead ends: 239 [2021-01-07 00:11:04,877 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-07 00:11:04,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-01-07 00:11:04,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2021-01-07 00:11:04,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2021-01-07 00:11:04,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 296 transitions. [2021-01-07 00:11:04,915 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 296 transitions. Word has length 40 [2021-01-07 00:11:04,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:11:04,915 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 296 transitions. [2021-01-07 00:11:04,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:11:04,916 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 296 transitions. [2021-01-07 00:11:04,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-07 00:11:04,921 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:11:04,921 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-07 00:11:04,921 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 00:11:04,922 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:11:04,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:11:04,923 INFO L82 PathProgramCache]: Analyzing trace with hash -252060921, now seen corresponding path program 1 times [2021-01-07 00:11:04,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:11:04,923 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680172968] [2021-01-07 00:11:04,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:11:05,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:11:05,443 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-07 00:11:05,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680172968] [2021-01-07 00:11:05,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:11:05,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 00:11:05,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945258571] [2021-01-07 00:11:05,445 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 00:11:05,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:11:05,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 00:11:05,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:11:05,446 INFO L87 Difference]: Start difference. First operand 239 states and 296 transitions. Second operand 5 states. [2021-01-07 00:11:05,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:11:05,745 INFO L93 Difference]: Finished difference Result 509 states and 617 transitions. [2021-01-07 00:11:05,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 00:11:05,746 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2021-01-07 00:11:05,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:11:05,748 INFO L225 Difference]: With dead ends: 509 [2021-01-07 00:11:05,748 INFO L226 Difference]: Without dead ends: 318 [2021-01-07 00:11:05,749 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-07 00:11:05,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2021-01-07 00:11:05,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 239. [2021-01-07 00:11:05,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2021-01-07 00:11:05,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 294 transitions. [2021-01-07 00:11:05,764 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 294 transitions. Word has length 44 [2021-01-07 00:11:05,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:11:05,765 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 294 transitions. [2021-01-07 00:11:05,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 00:11:05,765 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 294 transitions. [2021-01-07 00:11:05,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-07 00:11:05,767 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:11:05,767 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, 1] [2021-01-07 00:11:05,767 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-07 00:11:05,768 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:11:05,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:11:05,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1945926435, now seen corresponding path program 1 times [2021-01-07 00:11:05,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:11:05,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928670380] [2021-01-07 00:11:05,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:11:05,912 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:11:05,912 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1201307163] [2021-01-07 00:11:05,913 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-07 00:11:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:11:07,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 2572 conjuncts, 7 conjunts are in the unsatisfiable core [2021-01-07 00:11:07,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:11:07,575 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-07 00:11:07,575 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928670380] [2021-01-07 00:11:07,576 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:11:07,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201307163] [2021-01-07 00:11:07,576 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:11:07,576 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 00:11:07,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947185214] [2021-01-07 00:11:07,578 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 00:11:07,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:11:07,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 00:11:07,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 00:11:07,582 INFO L87 Difference]: Start difference. First operand 239 states and 294 transitions. Second operand 6 states. [2021-01-07 00:11:07,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:11:07,837 INFO L93 Difference]: Finished difference Result 399 states and 486 transitions. [2021-01-07 00:11:07,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 00:11:07,838 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2021-01-07 00:11:07,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:11:07,839 INFO L225 Difference]: With dead ends: 399 [2021-01-07 00:11:07,840 INFO L226 Difference]: Without dead ends: 239 [2021-01-07 00:11:07,841 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-07 00:11:07,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-01-07 00:11:07,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2021-01-07 00:11:07,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2021-01-07 00:11:07,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 292 transitions. [2021-01-07 00:11:07,855 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 292 transitions. Word has length 52 [2021-01-07 00:11:07,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:11:07,856 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 292 transitions. [2021-01-07 00:11:07,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 00:11:07,856 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 292 transitions. [2021-01-07 00:11:07,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-01-07 00:11:07,858 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:11:07,858 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:11:08,072 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:11:08,073 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:11:08,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:11:08,075 INFO L82 PathProgramCache]: Analyzing trace with hash -909602284, now seen corresponding path program 1 times [2021-01-07 00:11:08,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:11:08,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981525459] [2021-01-07 00:11:08,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:11:08,345 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:11:08,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [968535009] [2021-01-07 00:11:08,346 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-07 00:11:09,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:11:09,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 2622 conjuncts, 9 conjunts are in the unsatisfiable core [2021-01-07 00:11:09,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:11:09,824 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-07 00:11:09,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981525459] [2021-01-07 00:11:09,825 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:11:09,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968535009] [2021-01-07 00:11:09,826 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:11:09,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 00:11:09,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200101086] [2021-01-07 00:11:09,827 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 00:11:09,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:11:09,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 00:11:09,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-07 00:11:09,828 INFO L87 Difference]: Start difference. First operand 239 states and 292 transitions. Second operand 7 states. [2021-01-07 00:11:10,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:11:10,199 INFO L93 Difference]: Finished difference Result 415 states and 506 transitions. [2021-01-07 00:11:10,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 00:11:10,201 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2021-01-07 00:11:10,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:11:10,202 INFO L225 Difference]: With dead ends: 415 [2021-01-07 00:11:10,203 INFO L226 Difference]: Without dead ends: 239 [2021-01-07 00:11:10,204 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-01-07 00:11:10,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-01-07 00:11:10,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2021-01-07 00:11:10,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2021-01-07 00:11:10,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 290 transitions. [2021-01-07 00:11:10,216 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 290 transitions. Word has length 64 [2021-01-07 00:11:10,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:11:10,216 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 290 transitions. [2021-01-07 00:11:10,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 00:11:10,217 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 290 transitions. [2021-01-07 00:11:10,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-07 00:11:10,218 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:11:10,219 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 00:11:10,422 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:11:10,423 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:11:10,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:11:10,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1743581048, now seen corresponding path program 1 times [2021-01-07 00:11:10,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:11:10,426 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242810519] [2021-01-07 00:11:10,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:11:10,572 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:11:10,573 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1800887852] [2021-01-07 00:11:10,573 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 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-07 00:11:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:11:11,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 2717 conjuncts, 8 conjunts are in the unsatisfiable core [2021-01-07 00:11:11,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:11:12,075 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-07 00:11:12,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242810519] [2021-01-07 00:11:12,076 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:11:12,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800887852] [2021-01-07 00:11:12,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:11:12,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 00:11:12,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117469658] [2021-01-07 00:11:12,077 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 00:11:12,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:11:12,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 00:11:12,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:11:12,079 INFO L87 Difference]: Start difference. First operand 239 states and 290 transitions. Second operand 5 states. [2021-01-07 00:11:12,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:11:12,365 INFO L93 Difference]: Finished difference Result 368 states and 441 transitions. [2021-01-07 00:11:12,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 00:11:12,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2021-01-07 00:11:12,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:11:12,368 INFO L225 Difference]: With dead ends: 368 [2021-01-07 00:11:12,369 INFO L226 Difference]: Without dead ends: 239 [2021-01-07 00:11:12,370 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 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-07 00:11:12,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2021-01-07 00:11:12,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2021-01-07 00:11:12,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2021-01-07 00:11:12,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 288 transitions. [2021-01-07 00:11:12,385 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 288 transitions. Word has length 72 [2021-01-07 00:11:12,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:11:12,386 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 288 transitions. [2021-01-07 00:11:12,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 00:11:12,386 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 288 transitions. [2021-01-07 00:11:12,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-07 00:11:12,387 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:11:12,388 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:11:12,601 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:11:12,602 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:11:12,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:11:12,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1843556290, now seen corresponding path program 1 times [2021-01-07 00:11:12,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:11:12,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371781607] [2021-01-07 00:11:12,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:11:12,762 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:11:12,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [986223946] [2021-01-07 00:11:12,763 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-07 00:11:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:11:14,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 2902 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 00:11:14,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:11:14,320 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-07 00:11:14,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371781607] [2021-01-07 00:11:14,321 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:11:14,321 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986223946] [2021-01-07 00:11:14,321 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:11:14,321 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:11:14,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657963059] [2021-01-07 00:11:14,322 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:11:14,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:11:14,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:11:14,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:11:14,323 INFO L87 Difference]: Start difference. First operand 239 states and 288 transitions. Second operand 4 states. [2021-01-07 00:11:14,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:11:14,639 INFO L93 Difference]: Finished difference Result 461 states and 561 transitions. [2021-01-07 00:11:14,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 00:11:14,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2021-01-07 00:11:14,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:11:14,642 INFO L225 Difference]: With dead ends: 461 [2021-01-07 00:11:14,642 INFO L226 Difference]: Without dead ends: 269 [2021-01-07 00:11:14,643 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 86 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-07 00:11:14,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2021-01-07 00:11:14,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 251. [2021-01-07 00:11:14,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2021-01-07 00:11:14,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 300 transitions. [2021-01-07 00:11:14,656 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 300 transitions. Word has length 88 [2021-01-07 00:11:14,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:11:14,657 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 300 transitions. [2021-01-07 00:11:14,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:11:14,657 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 300 transitions. [2021-01-07 00:11:14,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-07 00:11:14,658 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:11:14,659 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:11:14,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:11:14,874 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:11:14,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:11:14,876 INFO L82 PathProgramCache]: Analyzing trace with hash 68548928, now seen corresponding path program 1 times [2021-01-07 00:11:14,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:11:14,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316486924] [2021-01-07 00:11:14,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:11:15,035 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:11:15,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1281063946] [2021-01-07 00:11:15,036 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 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-07 00:11:16,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:11:16,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 2907 conjuncts, 23 conjunts are in the unsatisfiable core [2021-01-07 00:11:16,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:11:16,463 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-07 00:11:16,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316486924] [2021-01-07 00:11:16,463 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:11:16,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281063946] [2021-01-07 00:11:16,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:11:16,464 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 00:11:16,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123542320] [2021-01-07 00:11:16,465 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 00:11:16,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:11:16,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 00:11:16,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 00:11:16,466 INFO L87 Difference]: Start difference. First operand 251 states and 300 transitions. Second operand 6 states. [2021-01-07 00:11:16,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:11:16,821 INFO L93 Difference]: Finished difference Result 589 states and 693 transitions. [2021-01-07 00:11:16,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 00:11:16,822 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 88 [2021-01-07 00:11:16,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:11:16,824 INFO L225 Difference]: With dead ends: 589 [2021-01-07 00:11:16,824 INFO L226 Difference]: Without dead ends: 420 [2021-01-07 00:11:16,825 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-01-07 00:11:16,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2021-01-07 00:11:16,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 263. [2021-01-07 00:11:16,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2021-01-07 00:11:16,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 316 transitions. [2021-01-07 00:11:16,840 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 316 transitions. Word has length 88 [2021-01-07 00:11:16,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:11:16,840 INFO L481 AbstractCegarLoop]: Abstraction has 263 states and 316 transitions. [2021-01-07 00:11:16,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 00:11:16,840 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 316 transitions. [2021-01-07 00:11:16,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-07 00:11:16,841 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:11:16,841 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:11:17,055 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:11:17,056 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:11:17,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:11:17,057 INFO L82 PathProgramCache]: Analyzing trace with hash 2117936770, now seen corresponding path program 1 times [2021-01-07 00:11:17,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:11:17,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988940598] [2021-01-07 00:11:17,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:11:17,220 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:11:17,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1392332897] [2021-01-07 00:11:17,221 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-07 00:11:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:11:18,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 2912 conjuncts, 9 conjunts are in the unsatisfiable core [2021-01-07 00:11:18,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:11:18,645 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:11:18,767 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-07 00:11:18,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988940598] [2021-01-07 00:11:18,767 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:11:18,767 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392332897] [2021-01-07 00:11:18,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:11:18,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-07 00:11:18,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028058972] [2021-01-07 00:11:18,768 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 00:11:18,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:11:18,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 00:11:18,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 00:11:18,775 INFO L87 Difference]: Start difference. First operand 263 states and 316 transitions. Second operand 6 states. [2021-01-07 00:11:26,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:11:26,332 INFO L93 Difference]: Finished difference Result 621 states and 741 transitions. [2021-01-07 00:11:26,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 00:11:26,333 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 88 [2021-01-07 00:11:26,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:11:26,336 INFO L225 Difference]: With dead ends: 621 [2021-01-07 00:11:26,336 INFO L226 Difference]: Without dead ends: 437 [2021-01-07 00:11:26,337 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-01-07 00:11:26,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2021-01-07 00:11:26,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 271. [2021-01-07 00:11:26,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2021-01-07 00:11:26,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 326 transitions. [2021-01-07 00:11:26,415 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 326 transitions. Word has length 88 [2021-01-07 00:11:26,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:11:26,415 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 326 transitions. [2021-01-07 00:11:26,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 00:11:26,415 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 326 transitions. [2021-01-07 00:11:26,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-07 00:11:26,416 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:11:26,416 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:11:26,625 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:11:26,626 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:11:26,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:11:26,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1928884032, now seen corresponding path program 1 times [2021-01-07 00:11:26,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:11:26,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508401572] [2021-01-07 00:11:26,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:11:26,752 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:11:26,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [774597480] [2021-01-07 00:11:26,753 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 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-07 00:11:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:11:28,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 2909 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 00:11:28,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:11:28,184 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-07 00:11:28,184 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508401572] [2021-01-07 00:11:28,184 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:11:28,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774597480] [2021-01-07 00:11:28,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:11:28,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:11:28,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123326040] [2021-01-07 00:11:28,186 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:11:28,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:11:28,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:11:28,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:11:28,187 INFO L87 Difference]: Start difference. First operand 271 states and 326 transitions. Second operand 4 states. [2021-01-07 00:11:28,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:11:28,304 INFO L93 Difference]: Finished difference Result 475 states and 568 transitions. [2021-01-07 00:11:28,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 00:11:28,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2021-01-07 00:11:28,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:11:28,307 INFO L225 Difference]: With dead ends: 475 [2021-01-07 00:11:28,307 INFO L226 Difference]: Without dead ends: 287 [2021-01-07 00:11:28,308 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 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-07 00:11:28,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2021-01-07 00:11:28,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 279. [2021-01-07 00:11:28,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2021-01-07 00:11:28,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 334 transitions. [2021-01-07 00:11:28,324 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 334 transitions. Word has length 88 [2021-01-07 00:11:28,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:11:28,324 INFO L481 AbstractCegarLoop]: Abstraction has 279 states and 334 transitions. [2021-01-07 00:11:28,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:11:28,325 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 334 transitions. [2021-01-07 00:11:28,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-07 00:11:28,325 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:11:28,326 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:11:28,537 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-01-07 00:11:28,538 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:11:28,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:11:28,540 INFO L82 PathProgramCache]: Analyzing trace with hash 994275966, now seen corresponding path program 1 times [2021-01-07 00:11:28,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:11:28,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823408135] [2021-01-07 00:11:28,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:11:28,676 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:11:28,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2129836018] [2021-01-07 00:11:28,676 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-07 00:11:30,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:11:30,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 2904 conjuncts, 40 conjunts are in the unsatisfiable core [2021-01-07 00:11:30,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:11:30,659 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-07 00:11:30,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823408135] [2021-01-07 00:11:30,660 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:11:30,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129836018] [2021-01-07 00:11:30,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:11:30,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-07 00:11:30,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661594536] [2021-01-07 00:11:30,661 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 00:11:30,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:11:30,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 00:11:30,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-01-07 00:11:30,662 INFO L87 Difference]: Start difference. First operand 279 states and 334 transitions. Second operand 9 states. [2021-01-07 00:11:32,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:11:32,050 INFO L93 Difference]: Finished difference Result 665 states and 793 transitions. [2021-01-07 00:11:32,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-07 00:11:32,052 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2021-01-07 00:11:32,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:11:32,054 INFO L225 Difference]: With dead ends: 665 [2021-01-07 00:11:32,055 INFO L226 Difference]: Without dead ends: 465 [2021-01-07 00:11:32,056 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-01-07 00:11:32,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2021-01-07 00:11:32,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 305. [2021-01-07 00:11:32,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2021-01-07 00:11:32,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 366 transitions. [2021-01-07 00:11:32,075 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 366 transitions. Word has length 88 [2021-01-07 00:11:32,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:11:32,076 INFO L481 AbstractCegarLoop]: Abstraction has 305 states and 366 transitions. [2021-01-07 00:11:32,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 00:11:32,076 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 366 transitions. [2021-01-07 00:11:32,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-07 00:11:32,077 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:11:32,077 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:11:32,278 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-01-07 00:11:32,278 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:11:32,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:11:32,279 INFO L82 PathProgramCache]: Analyzing trace with hash -248757824, now seen corresponding path program 1 times [2021-01-07 00:11:32,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:11:32,280 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972719562] [2021-01-07 00:11:32,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:11:32,414 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:11:32,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [338663846] [2021-01-07 00:11:32,421 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 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-07 00:11:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:11:33,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 2909 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 00:11:33,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:11:33,806 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-07 00:11:33,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972719562] [2021-01-07 00:11:33,807 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:11:33,807 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338663846] [2021-01-07 00:11:33,807 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:11:33,807 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 00:11:33,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697624653] [2021-01-07 00:11:33,808 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 00:11:33,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:11:33,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 00:11:33,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 00:11:33,809 INFO L87 Difference]: Start difference. First operand 305 states and 366 transitions. Second operand 4 states. [2021-01-07 00:11:33,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:11:33,916 INFO L93 Difference]: Finished difference Result 508 states and 604 transitions. [2021-01-07 00:11:33,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 00:11:33,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2021-01-07 00:11:33,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:11:33,919 INFO L225 Difference]: With dead ends: 508 [2021-01-07 00:11:33,919 INFO L226 Difference]: Without dead ends: 297 [2021-01-07 00:11:33,920 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 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-07 00:11:33,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2021-01-07 00:11:33,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 289. [2021-01-07 00:11:33,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2021-01-07 00:11:33,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 342 transitions. [2021-01-07 00:11:33,935 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 342 transitions. Word has length 88 [2021-01-07 00:11:33,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:11:33,936 INFO L481 AbstractCegarLoop]: Abstraction has 289 states and 342 transitions. [2021-01-07 00:11:33,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 00:11:33,936 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 342 transitions. [2021-01-07 00:11:33,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-07 00:11:33,937 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:11:33,937 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:11:34,152 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:11:34,153 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:11:34,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:11:34,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1179597530, now seen corresponding path program 1 times [2021-01-07 00:11:34,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:11:34,155 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611720092] [2021-01-07 00:11:34,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:11:34,283 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:11:34,283 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1109044149] [2021-01-07 00:11:34,283 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-07 00:11:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:11:35,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 2904 conjuncts, 8 conjunts are in the unsatisfiable core [2021-01-07 00:11:35,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:11:35,737 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-07 00:11:35,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611720092] [2021-01-07 00:11:35,737 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:11:35,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109044149] [2021-01-07 00:11:35,738 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:11:35,738 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 00:11:35,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066413326] [2021-01-07 00:11:35,738 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 00:11:35,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:11:35,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 00:11:35,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 00:11:35,739 INFO L87 Difference]: Start difference. First operand 289 states and 342 transitions. Second operand 5 states. [2021-01-07 00:11:41,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:11:41,227 INFO L93 Difference]: Finished difference Result 652 states and 763 transitions. [2021-01-07 00:11:41,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 00:11:41,229 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2021-01-07 00:11:41,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:11:41,231 INFO L225 Difference]: With dead ends: 652 [2021-01-07 00:11:41,232 INFO L226 Difference]: Without dead ends: 411 [2021-01-07 00:11:41,233 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-07 00:11:41,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2021-01-07 00:11:41,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 293. [2021-01-07 00:11:41,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2021-01-07 00:11:41,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 344 transitions. [2021-01-07 00:11:41,260 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 344 transitions. Word has length 90 [2021-01-07 00:11:41,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:11:41,260 INFO L481 AbstractCegarLoop]: Abstraction has 293 states and 344 transitions. [2021-01-07 00:11:41,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 00:11:41,260 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 344 transitions. [2021-01-07 00:11:41,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-07 00:11:41,261 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:11:41,261 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:11:41,474 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 00:11:41,475 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:11:41,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:11:41,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1660677788, now seen corresponding path program 1 times [2021-01-07 00:11:41,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:11:41,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379715359] [2021-01-07 00:11:41,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:11:41,610 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:11:41,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2096833776] [2021-01-07 00:11:41,610 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 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 [2021-01-07 00:11:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 00:11:44,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 2909 conjuncts, 108 conjunts are in the unsatisfiable core [2021-01-07 00:11:44,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 00:11:44,628 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 00:11:44,630 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:11:44,647 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:11:44,648 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 00:11:44,648 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 00:11:44,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 00:11:44,910 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2021-01-07 00:11:44,912 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:11:44,941 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:11:44,942 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 00:11:44,942 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:26 [2021-01-07 00:11:45,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 00:11:45,006 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2021-01-07 00:11:45,008 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:11:45,025 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:11:45,026 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 00:11:45,027 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:20 [2021-01-07 00:11:45,342 WARN L197 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2021-01-07 00:11:45,343 INFO L348 Elim1Store]: treesize reduction 13, result has 83.5 percent of original size [2021-01-07 00:11:45,343 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 84 [2021-01-07 00:11:45,347 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:11:45,353 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:11:45,455 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2021-01-07 00:11:45,455 INFO L625 ElimStorePlain]: treesize reduction 8, result has 82.6 percent of original size [2021-01-07 00:11:45,458 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 00:11:45,458 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:38 [2021-01-07 00:11:45,576 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-01-07 00:11:45,582 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:11:45,635 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:11:45,642 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2021-01-07 00:11:45,643 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:44 [2021-01-07 00:11:49,759 WARN L197 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 35 [2021-01-07 00:11:50,006 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:11:50,007 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 55 [2021-01-07 00:11:50,012 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:11:50,138 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2021-01-07 00:11:50,139 INFO L625 ElimStorePlain]: treesize reduction 8, result has 84.6 percent of original size [2021-01-07 00:11:50,151 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2021-01-07 00:11:50,151 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:50, output treesize:44 [2021-01-07 00:11:50,664 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:11:50,665 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 53 [2021-01-07 00:11:50,667 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:11:50,716 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:11:50,729 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2021-01-07 00:11:50,730 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:52, output treesize:36 [2021-01-07 00:11:52,852 WARN L197 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 32 [2021-01-07 00:11:52,964 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:11:52,964 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 60 [2021-01-07 00:11:52,968 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:11:53,099 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2021-01-07 00:11:53,100 INFO L625 ElimStorePlain]: treesize reduction 18, result has 73.5 percent of original size [2021-01-07 00:11:53,112 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:11:53,129 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 00:11:53,157 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:11:53,163 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 00:11:53,176 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:11:53,189 INFO L547 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2021-01-07 00:11:53,193 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:46, output treesize:46 [2021-01-07 00:11:53,200 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:11:53,206 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 00:11:53,291 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:11:53,297 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 00:11:53,302 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:11:59,447 WARN L197 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 39 [2021-01-07 00:11:59,460 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:11:59,466 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 00:11:59,475 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 00:11:59,774 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 00:11:59,787 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 00:11:59,798 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 00:11:59,806 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 00:11:59,857 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-01-07 00:11:59,866 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 00:11:59,869 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-01-07 00:11:59,870 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 00:11:59,883 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 00:11:59,885 INFO L547 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 00:11:59,886 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:62, output treesize:1 [2021-01-07 00:12:00,024 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-07 00:12:00,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379715359] [2021-01-07 00:12:00,024 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-01-07 00:12:00,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096833776] [2021-01-07 00:12:00,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 00:12:00,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-01-07 00:12:00,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192412423] [2021-01-07 00:12:00,026 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-01-07 00:12:00,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 00:12:00,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-01-07 00:12:00,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=224, Unknown=3, NotChecked=0, Total=272 [2021-01-07 00:12:00,027 INFO L87 Difference]: Start difference. First operand 293 states and 344 transitions. Second operand 17 states. [2021-01-07 00:12:15,846 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 30 [2021-01-07 00:12:16,242 WARN L197 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2021-01-07 00:12:16,770 WARN L197 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2021-01-07 00:12:17,056 WARN L197 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2021-01-07 00:12:18,053 WARN L197 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2021-01-07 00:12:24,806 WARN L197 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 83 DAG size of output: 47 [2021-01-07 00:12:27,494 WARN L197 SmtUtils]: Spent 2.47 s on a formula simplification. DAG size of input: 84 DAG size of output: 48 [2021-01-07 00:12:39,095 WARN L197 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2021-01-07 00:12:57,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 00:12:57,641 INFO L93 Difference]: Finished difference Result 765 states and 897 transitions. [2021-01-07 00:12:57,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-07 00:12:57,643 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 90 [2021-01-07 00:12:57,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 00:12:57,647 INFO L225 Difference]: With dead ends: 765 [2021-01-07 00:12:57,647 INFO L226 Difference]: Without dead ends: 544 [2021-01-07 00:12:57,648 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 25.1s TimeCoverageRelationStatistics Valid=142, Invalid=453, Unknown=5, NotChecked=0, Total=600 [2021-01-07 00:12:57,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2021-01-07 00:12:57,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 430. [2021-01-07 00:12:57,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2021-01-07 00:12:57,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 511 transitions. [2021-01-07 00:12:57,686 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 511 transitions. Word has length 90 [2021-01-07 00:12:57,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 00:12:57,687 INFO L481 AbstractCegarLoop]: Abstraction has 430 states and 511 transitions. [2021-01-07 00:12:57,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2021-01-07 00:12:57,687 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 511 transitions. [2021-01-07 00:12:57,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-01-07 00:12:57,688 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 00:12:57,689 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 00:12:57,901 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-01-07 00:12:57,902 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 00:12:57,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 00:12:57,903 INFO L82 PathProgramCache]: Analyzing trace with hash 913664384, now seen corresponding path program 1 times [2021-01-07 00:12:57,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 00:12:57,904 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256631845] [2021-01-07 00:12:57,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 00:12:58,001 ERROR L270 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-01-07 00:12:58,002 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [842402411] [2021-01-07 00:12:58,002 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true