/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/ldv-validator-v0.8/linux-stable-4ee267b-1-130_7a-drivers--hwmon--ibmaem.ko-entry_point_ldv-val-v0.8.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 01:42:38,467 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 01:42:38,469 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 01:42:38,504 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 01:42:38,504 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 01:42:38,506 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 01:42:38,508 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 01:42:38,510 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 01:42:38,512 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 01:42:38,513 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 01:42:38,514 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 01:42:38,516 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 01:42:38,516 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 01:42:38,517 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 01:42:38,519 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 01:42:38,520 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 01:42:38,521 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 01:42:38,522 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 01:42:38,541 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 01:42:38,550 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 01:42:38,554 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 01:42:38,555 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 01:42:38,557 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 01:42:38,558 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 01:42:38,562 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 01:42:38,563 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 01:42:38,564 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 01:42:38,569 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 01:42:38,570 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 01:42:38,571 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 01:42:38,576 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 01:42:38,577 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 01:42:38,579 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 01:42:38,580 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 01:42:38,581 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 01:42:38,582 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 01:42:38,582 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 01:42:38,586 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 01:42:38,586 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 01:42:38,590 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 01:42:38,591 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 01:42:38,592 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 01:42:38,626 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 01:42:38,626 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 01:42:38,628 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 01:42:38,631 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 01:42:38,631 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 01:42:38,632 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 01:42:38,632 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 01:42:38,632 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 01:42:38,632 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-07 01:42:38,632 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 01:42:38,632 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-07 01:42:38,633 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-07 01:42:38,633 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 01:42:38,634 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-07 01:42:38,634 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 01:42:38,634 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 01:42:38,634 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 01:42:38,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 01:42:38,635 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 01:42:38,635 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 01:42:38,635 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-07 01:42:38,635 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 01:42:38,636 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 01:42:38,636 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-07 01:42:38,636 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 01:42:38,636 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 01:42:39,097 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 01:42:39,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 01:42:39,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 01:42:39,137 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 01:42:39,138 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 01:42:39,139 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-4ee267b-1-130_7a-drivers--hwmon--ibmaem.ko-entry_point_ldv-val-v0.8.cil.out.i [2021-01-07 01:42:39,222 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e044f948c/33095968960b4e84ba2905b030b8de44/FLAG795f6131c [2021-01-07 01:42:40,253 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 01:42:40,254 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-4ee267b-1-130_7a-drivers--hwmon--ibmaem.ko-entry_point_ldv-val-v0.8.cil.out.i [2021-01-07 01:42:40,294 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e044f948c/33095968960b4e84ba2905b030b8de44/FLAG795f6131c [2021-01-07 01:42:40,763 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e044f948c/33095968960b4e84ba2905b030b8de44 [2021-01-07 01:42:40,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 01:42:40,769 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 01:42:40,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 01:42:40,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 01:42:40,775 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 01:42:40,776 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 01:42:40" (1/1) ... [2021-01-07 01:42:40,777 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b4b2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:42:40, skipping insertion in model container [2021-01-07 01:42:40,777 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 01:42:40" (1/1) ... [2021-01-07 01:42:40,786 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 01:42:40,866 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x,],base],StructAccessExpression[IdentifierExpression[~x,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~p~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~p~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[169],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[84],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[90],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[130],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[146],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[134],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~0,] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[146],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: lhs: VariableLHS[~data~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[165],StructAccessExpression[IdentifierExpression[~data~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[164],StructAccessExpression[IdentifierExpression[~data~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[164],StructAccessExpression[IdentifierExpression[~data~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~rx_len~0,] left hand side expression in assignment: lhs: VariableLHS[~rx_len~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[162],StructAccessExpression[IdentifierExpression[~data~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~__len~0,] left hand side expression in assignment: lhs: VariableLHS[~__ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[162],StructAccessExpression[IdentifierExpression[~data~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~err~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: address: IdentifierExpression[~id,] left hand side expression in assignment: lhs: VariableLHS[~ipmi~0,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~rs_req~0,],id] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~rs_req~0,],module_handle] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~rs_req~0,],element] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~rs_req~0,],subcommand] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~rs_req~0,],reg] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~rs_req~0,],rx_buf_size] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ipmi~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[135],StructAccessExpression[IdentifierExpression[~ipmi~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ipmi~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[138],StructAccessExpression[IdentifierExpression[~ipmi~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ipmi~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[136],StructAccessExpression[IdentifierExpression[~ipmi~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~rs_size~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~rs_resp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ipmi~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[154],StructAccessExpression[IdentifierExpression[~ipmi~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ipmi~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[162],StructAccessExpression[IdentifierExpression[~ipmi~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: lhs: VariableLHS[~res~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: address: IdentifierExpression[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~x___0~0,] left hand side expression in assignment: address: IdentifierExpression[~x___0~0,] left hand side expression in assignment: lhs: VariableLHS[~x___1~0,] left hand side expression in assignment: address: IdentifierExpression[~x___1~0,] left hand side expression in assignment: lhs: VariableLHS[~x___2~0,] left hand side expression in assignment: address: IdentifierExpression[~x___2~0,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~ff_req~0,],id] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~ff_req~0,],index] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~ff_req~0,],module_type_id] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[135],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[138],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[136],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[154],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[162],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~res~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: lhs: VariableLHS[~res~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~data~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[193],StructAccessExpression[IdentifierExpression[~data~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[194],StructAccessExpression[IdentifierExpression[~data~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[195],StructAccessExpression[IdentifierExpression[~data~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~1,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[1073],StructAccessExpression[IdentifierExpression[~data~1,],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~i~2,]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~data~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem196,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[269],StructAccessExpression[IdentifierExpression[#t~mem196,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~res~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~data~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[377],StructAccessExpression[IdentifierExpression[~data~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~num~0,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~err~3,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~fi_req~0,],id] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~fi_req~0,],instance_number] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~fi_req~0,],module_type_id] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[135],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[138],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[136],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[154],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[162],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~res~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~res~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: lhs: VariableLHS[~data~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[193],StructAccessExpression[IdentifierExpression[~data~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[194],StructAccessExpression[IdentifierExpression[~data~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[195],StructAccessExpression[IdentifierExpression[~data~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~2,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[1073],StructAccessExpression[IdentifierExpression[~data~2,],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~i~4,]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~data~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem246,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[269],StructAccessExpression[IdentifierExpression[#t~mem246,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~res~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~data~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[377],StructAccessExpression[IdentifierExpression[~data~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,] left hand side expression in assignment: lhs: VariableLHS[~i~5,] left hand side expression in assignment: lhs: VariableLHS[~i~5,] left hand side expression in assignment: lhs: VariableLHS[~err~4,] left hand side expression in assignment: lhs: VariableLHS[~i~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~0,] left hand side expression in assignment: lhs: VariableLHS[~p1~0,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___0~0,] left hand side expression in assignment: lhs: VariableLHS[~next1~0,] left hand side expression in assignment: lhs: VariableLHS[~p1~0,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___1~0,] left hand side expression in assignment: lhs: VariableLHS[~next1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~23,] left hand side expression in assignment: lhs: VariableLHS[~data~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp~24,] left hand side expression in assignment: lhs: VariableLHS[~data~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~9,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~1,] left hand side expression in assignment: lhs: VariableLHS[~attr~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~25,] left hand side expression in assignment: lhs: VariableLHS[~data~5,] left hand side expression in assignment: lhs: VariableLHS[~before~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~10,] left hand side expression in assignment: lhs: VariableLHS[~leftover~0,] left hand side expression in assignment: lhs: VariableLHS[~after~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~3,] left hand side expression in assignment: lhs: VariableLHS[~time~0,] left hand side expression in assignment: lhs: VariableLHS[~delta~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~2,] left hand side expression in assignment: lhs: VariableLHS[~attr~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~26,] left hand side expression in assignment: lhs: VariableLHS[~a~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~11,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~3,] left hand side expression in assignment: lhs: VariableLHS[~attr~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~27,] left hand side expression in assignment: lhs: VariableLHS[~a~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~12,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~4,] left hand side expression in assignment: lhs: VariableLHS[~attr~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~28,] left hand side expression in assignment: lhs: VariableLHS[~a~3,] left hand side expression in assignment: lhs: VariableLHS[~res~5,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a~3,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[1073],StructAccessExpression[IdentifierExpression[~a~3,],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[#t~mem333,]]]]] left hand side expression in assignment: lhs: VariableLHS[~dev~0,] left hand side expression in assignment: lhs: VariableLHS[~sensors~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sensors~0,],base],StructAccessExpression[IdentifierExpression[~sensors~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sensors~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~sensors~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sensors~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~sensors~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sensors~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[~sensors~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~5,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sensors~0,],base],StructAccessExpression[IdentifierExpression[~sensors~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~sensors~0,] left hand side expression in assignment: lhs: VariableLHS[~ro,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sensors~0,],base],StructAccessExpression[IdentifierExpression[~sensors~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sensors~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~sensors~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sensors~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~sensors~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sensors~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~sensors~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sensors~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[~sensors~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~5,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sensors~0,],base],StructAccessExpression[IdentifierExpression[~sensors~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~sensors~0,] left hand side expression in assignment: lhs: VariableLHS[~rw,] left hand side expression in assignment: lhs: VariableLHS[~err~5,] left hand side expression in assignment: lhs: VariableLHS[~err~5,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~5,] left hand side expression in assignment: lhs: VariableLHS[~attr~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~29,] left hand side expression in assignment: lhs: VariableLHS[~a~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~13,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~6,] left hand side expression in assignment: lhs: VariableLHS[~attr~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~30,] left hand side expression in assignment: lhs: VariableLHS[~a~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~14,] left hand side expression in assignment: lhs: VariableLHS[~i~6,] left hand side expression in assignment: lhs: VariableLHS[~i~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~31,] left hand side expression in assignment: lhs: VariableLHS[~tmp~32,] left hand side expression in assignment: lhs: VariableLHS[~res~6,] left hand side expression in assignment: lhs: VariableLHS[~res~6,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~7,] left hand side expression in assignment: lhs: VariableLHS[~p1~1,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___0~1,] left hand side expression in assignment: lhs: VariableLHS[~next1~1,] left hand side expression in assignment: lhs: VariableLHS[~p1~1,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___1~1,] left hand side expression in assignment: lhs: VariableLHS[~next1~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~33,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~15,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~5,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~4,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~3,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~1,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg6~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg8~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg10~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg9~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___11~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___12~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~34,] left hand side expression in assignment: lhs: VariableLHS[~tmp~35,] left hand side expression in assignment: lhs: VariableLHS[~tmp~36,] left hand side expression in assignment: lhs: VariableLHS[~tmp~37,] left hand side expression in assignment: lhs: VariableLHS[~tmp~38,] left hand side expression in assignment: lhs: VariableLHS[~tmp~39,] [2021-01-07 01:42:41,903 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/ldv-validator-v0.8/linux-stable-4ee267b-1-130_7a-drivers--hwmon--ibmaem.ko-entry_point_ldv-val-v0.8.cil.out.i[120657,120670] left hand side expression in assignment: lhs: VariableLHS[~tmp~40,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~16,] left hand side expression in assignment: lhs: VariableLHS[~tmp~41,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~16,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~16,] left hand side expression in assignment: lhs: VariableLHS[~ldv_count_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nondetermined~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_count_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~42,] left hand side expression in assignment: lhs: VariableLHS[~ldv_count_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_count_1~0,GLOBAL] [2021-01-07 01:42:41,956 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 01:42:42,007 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~7,] left hand side expression in assignment: lhs: VariableLHS[~tmp~8,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~x,],base],StructAccessExpression[IdentifierExpression[~x,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~9,] left hand side expression in assignment: lhs: VariableLHS[~p~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~10,] left hand side expression in assignment: lhs: VariableLHS[~p~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~11,] left hand side expression in assignment: lhs: VariableLHS[~p~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~12,] left hand side expression in assignment: lhs: VariableLHS[~tmp~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp~14,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[169],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[84],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[88],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[90],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[130],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[146],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[134],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~0,] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[146],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~1,] left hand side expression in assignment: lhs: VariableLHS[~data~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[165],StructAccessExpression[IdentifierExpression[~data~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[164],StructAccessExpression[IdentifierExpression[~data~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[164],StructAccessExpression[IdentifierExpression[~data~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~rx_len~0,] left hand side expression in assignment: lhs: VariableLHS[~rx_len~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[162],StructAccessExpression[IdentifierExpression[~data~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~__len~0,] left hand side expression in assignment: lhs: VariableLHS[~__ret~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[162],StructAccessExpression[IdentifierExpression[~data~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~15,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~2,] left hand side expression in assignment: lhs: VariableLHS[~err~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: address: IdentifierExpression[~id,] left hand side expression in assignment: lhs: VariableLHS[~ipmi~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#rs_req~0,],base],StructAccessExpression[IdentifierExpression[~#rs_req~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#rs_req~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~#rs_req~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#rs_req~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#rs_req~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#rs_req~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[5],StructAccessExpression[IdentifierExpression[~#rs_req~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#rs_req~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[6],StructAccessExpression[IdentifierExpression[~#rs_req~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#rs_req~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[7],StructAccessExpression[IdentifierExpression[~#rs_req~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ipmi~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[135],StructAccessExpression[IdentifierExpression[~ipmi~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ipmi~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[138],StructAccessExpression[IdentifierExpression[~ipmi~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ipmi~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[136],StructAccessExpression[IdentifierExpression[~ipmi~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~rs_size~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~16,] left hand side expression in assignment: lhs: VariableLHS[~rs_resp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ipmi~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[154],StructAccessExpression[IdentifierExpression[~ipmi~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~ipmi~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[162],StructAccessExpression[IdentifierExpression[~ipmi~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~3,] left hand side expression in assignment: lhs: VariableLHS[~res~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~1,] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: address: IdentifierExpression[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~x___0~0,] left hand side expression in assignment: address: IdentifierExpression[~x___0~0,] left hand side expression in assignment: lhs: VariableLHS[~x___1~0,] left hand side expression in assignment: address: IdentifierExpression[~x___1~0,] left hand side expression in assignment: lhs: VariableLHS[~x___2~0,] left hand side expression in assignment: address: IdentifierExpression[~x___2~0,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: lhs: VariableLHS[~i~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ff_req~0,],base],StructAccessExpression[IdentifierExpression[~#ff_req~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ff_req~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#ff_req~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#ff_req~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[6],StructAccessExpression[IdentifierExpression[~#ff_req~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[135],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[138],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[136],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[154],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[162],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~17,] left hand side expression in assignment: lhs: VariableLHS[~res~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~4,] left hand side expression in assignment: lhs: VariableLHS[~res~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~18,] left hand side expression in assignment: lhs: VariableLHS[~data~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[193],StructAccessExpression[IdentifierExpression[~data~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[194],StructAccessExpression[IdentifierExpression[~data~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[195],StructAccessExpression[IdentifierExpression[~data~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~1,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[1073],StructAccessExpression[IdentifierExpression[~data~1,],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~i~2,]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~5,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~data~1,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem206,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[269],StructAccessExpression[IdentifierExpression[#t~mem206,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~res~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~data~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~1,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~1,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[377],StructAccessExpression[IdentifierExpression[~data~1,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~num~0,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: lhs: VariableLHS[~err~3,] left hand side expression in assignment: lhs: VariableLHS[~i~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#fi_req~0,],base],StructAccessExpression[IdentifierExpression[~#fi_req~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#fi_req~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[3],StructAccessExpression[IdentifierExpression[~#fi_req~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#fi_req~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#fi_req~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[135],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[138],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[136],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[154],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[162],StructAccessExpression[IdentifierExpression[~data,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp~19,] left hand side expression in assignment: lhs: VariableLHS[~res~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~6,] left hand side expression in assignment: lhs: VariableLHS[~res~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~20,] left hand side expression in assignment: lhs: VariableLHS[~data~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[193],StructAccessExpression[IdentifierExpression[~data~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[194],StructAccessExpression[IdentifierExpression[~data~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[195],StructAccessExpression[IdentifierExpression[~data~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~2,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[1073],StructAccessExpression[IdentifierExpression[~data~2,],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[~i~4,]]]]] left hand side expression in assignment: lhs: VariableLHS[~i~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~7,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~data~2,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem260,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[269],StructAccessExpression[IdentifierExpression[#t~mem260,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~res~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~3,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~data~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~2,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~data~2,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[377],StructAccessExpression[IdentifierExpression[~data~2,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~1,] left hand side expression in assignment: lhs: VariableLHS[~i~5,] left hand side expression in assignment: lhs: VariableLHS[~i~5,] left hand side expression in assignment: lhs: VariableLHS[~err~4,] left hand side expression in assignment: lhs: VariableLHS[~i~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~21,] left hand side expression in assignment: lhs: VariableLHS[~tmp~22,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~0,] left hand side expression in assignment: lhs: VariableLHS[~p1~0,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___0~0,] left hand side expression in assignment: lhs: VariableLHS[~next1~0,] left hand side expression in assignment: lhs: VariableLHS[~p1~0,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___1~0,] left hand side expression in assignment: lhs: VariableLHS[~next1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~23,] left hand side expression in assignment: lhs: VariableLHS[~data~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~8,] left hand side expression in assignment: lhs: VariableLHS[~tmp~24,] left hand side expression in assignment: lhs: VariableLHS[~data~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~9,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~1,] left hand side expression in assignment: lhs: VariableLHS[~attr~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~25,] left hand side expression in assignment: lhs: VariableLHS[~data~5,] left hand side expression in assignment: lhs: VariableLHS[~before~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~10,] left hand side expression in assignment: lhs: VariableLHS[~leftover~0,] left hand side expression in assignment: lhs: VariableLHS[~after~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~3,] left hand side expression in assignment: lhs: VariableLHS[~time~0,] left hand side expression in assignment: lhs: VariableLHS[~delta~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~2,] left hand side expression in assignment: lhs: VariableLHS[~attr~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~26,] left hand side expression in assignment: lhs: VariableLHS[~a~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~11,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~3,] left hand side expression in assignment: lhs: VariableLHS[~attr~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp~27,] left hand side expression in assignment: lhs: VariableLHS[~a~2,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~12,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~4,] left hand side expression in assignment: lhs: VariableLHS[~attr~3,] left hand side expression in assignment: lhs: VariableLHS[~tmp~28,] left hand side expression in assignment: lhs: VariableLHS[~a~3,] left hand side expression in assignment: lhs: VariableLHS[~res~5,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~a~3,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[1073],StructAccessExpression[IdentifierExpression[~a~3,],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[#t~mem353,]]]]] left hand side expression in assignment: lhs: VariableLHS[~dev~0,] left hand side expression in assignment: lhs: VariableLHS[~sensors~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sensors~0,],base],StructAccessExpression[IdentifierExpression[~sensors~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sensors~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~sensors~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sensors~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~sensors~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sensors~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[~sensors~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~5,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sensors~0,],base],StructAccessExpression[IdentifierExpression[~sensors~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~sensors~0,] left hand side expression in assignment: lhs: VariableLHS[~ro,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sensors~0,],base],StructAccessExpression[IdentifierExpression[~sensors~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sensors~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~sensors~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sensors~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[28],StructAccessExpression[IdentifierExpression[~sensors~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sensors~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~sensors~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sensors~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[44],StructAccessExpression[IdentifierExpression[~sensors~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~err~5,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~sensors~0,],base],StructAccessExpression[IdentifierExpression[~sensors~0,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~sensors~0,] left hand side expression in assignment: lhs: VariableLHS[~rw,] left hand side expression in assignment: lhs: VariableLHS[~err~5,] left hand side expression in assignment: lhs: VariableLHS[~err~5,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~5,] left hand side expression in assignment: lhs: VariableLHS[~attr~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~29,] left hand side expression in assignment: lhs: VariableLHS[~a~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~13,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~6,] left hand side expression in assignment: lhs: VariableLHS[~attr~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~30,] left hand side expression in assignment: lhs: VariableLHS[~a~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~14,] left hand side expression in assignment: lhs: VariableLHS[~i~6,] left hand side expression in assignment: lhs: VariableLHS[~i~6,] left hand side expression in assignment: lhs: VariableLHS[~tmp~31,] left hand side expression in assignment: lhs: VariableLHS[~tmp~32,] left hand side expression in assignment: lhs: VariableLHS[~res~6,] left hand side expression in assignment: lhs: VariableLHS[~res~6,] left hand side expression in assignment: lhs: VariableLHS[~__mptr~7,] left hand side expression in assignment: lhs: VariableLHS[~p1~1,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___0~1,] left hand side expression in assignment: lhs: VariableLHS[~next1~1,] left hand side expression in assignment: lhs: VariableLHS[~p1~1,] left hand side expression in assignment: lhs: VariableLHS[~__mptr___1~1,] left hand side expression in assignment: lhs: VariableLHS[~next1~1,] left hand side expression in assignment: lhs: VariableLHS[~tmp~33,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg1~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~15,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg0~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~5,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg2~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~4,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg4~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~3,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg3~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~1,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg6~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg8~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg10~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~ldvarg9~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ref_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_retval_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___11~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___12~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_state_variable_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~34,] left hand side expression in assignment: lhs: VariableLHS[~tmp~35,] left hand side expression in assignment: lhs: VariableLHS[~tmp~36,] left hand side expression in assignment: lhs: VariableLHS[~tmp~37,] left hand side expression in assignment: lhs: VariableLHS[~tmp~38,] left hand side expression in assignment: lhs: VariableLHS[~tmp~39,] [2021-01-07 01:42:42,328 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/ldv-validator-v0.8/linux-stable-4ee267b-1-130_7a-drivers--hwmon--ibmaem.ko-entry_point_ldv-val-v0.8.cil.out.i[120657,120670] left hand side expression in assignment: lhs: VariableLHS[~tmp~40,] left hand side expression in assignment: lhs: VariableLHS[~ret~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~16,] left hand side expression in assignment: lhs: VariableLHS[~tmp~41,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~16,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~16,] left hand side expression in assignment: lhs: VariableLHS[~ldv_count_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~nondetermined~0,] left hand side expression in assignment: lhs: VariableLHS[~ldv_count_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~42,] left hand side expression in assignment: lhs: VariableLHS[~ldv_count_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~ldv_count_1~0,GLOBAL] [2021-01-07 01:42:42,339 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 01:42:42,513 INFO L208 MainTranslator]: Completed translation [2021-01-07 01:42:42,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:42:42 WrapperNode [2021-01-07 01:42:42,514 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 01:42:42,515 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 01:42:42,516 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 01:42:42,516 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 01:42:42,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:42:42" (1/1) ... [2021-01-07 01:42:42,679 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:42:42" (1/1) ... [2021-01-07 01:42:42,818 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 01:42:42,819 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 01:42:42,819 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 01:42:42,819 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 01:42:42,831 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:42:42" (1/1) ... [2021-01-07 01:42:42,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:42:42" (1/1) ... [2021-01-07 01:42:42,863 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:42:42" (1/1) ... [2021-01-07 01:42:42,864 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:42:42" (1/1) ... [2021-01-07 01:42:43,054 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:42:42" (1/1) ... [2021-01-07 01:42:43,089 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:42:42" (1/1) ... [2021-01-07 01:42:43,113 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:42:42" (1/1) ... [2021-01-07 01:42:43,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 01:42:43,143 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 01:42:43,143 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 01:42:43,143 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 01:42:43,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:42:42" (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 01:42:43,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-01-07 01:42:43,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-01-07 01:42:43,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-01-07 01:42:43,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-07 01:42:43,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-07 01:42:43,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 01:42:43,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 01:42:43,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 01:42:43,273 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-01-07 01:42:43,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 01:42:43,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 01:42:43,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-01-07 01:42:43,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 01:42:43,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-01-07 01:42:43,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 01:42:43,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 01:42:48,608 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 01:42:48,609 INFO L299 CfgBuilder]: Removed 582 assume(true) statements. [2021-01-07 01:42:48,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 01:42:48 BoogieIcfgContainer [2021-01-07 01:42:48,611 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 01:42:48,613 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 01:42:48,613 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 01:42:48,617 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 01:42:48,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 01:42:40" (1/3) ... [2021-01-07 01:42:48,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73c26898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 01:42:48, skipping insertion in model container [2021-01-07 01:42:48,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 01:42:42" (2/3) ... [2021-01-07 01:42:48,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73c26898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 01:42:48, skipping insertion in model container [2021-01-07 01:42:48,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 01:42:48" (3/3) ... [2021-01-07 01:42:48,621 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-4ee267b-1-130_7a-drivers--hwmon--ibmaem.ko-entry_point_ldv-val-v0.8.cil.out.i [2021-01-07 01:42:48,628 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 01:42:48,634 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2021-01-07 01:42:48,655 INFO L253 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2021-01-07 01:42:48,705 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 01:42:48,706 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-07 01:42:48,706 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 01:42:48,706 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 01:42:48,706 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 01:42:48,706 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 01:42:48,706 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 01:42:48,706 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 01:42:48,742 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states. [2021-01-07 01:42:48,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-07 01:42:48,772 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:48,773 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:42:48,774 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:48,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:48,782 INFO L82 PathProgramCache]: Analyzing trace with hash -38838034, now seen corresponding path program 1 times [2021-01-07 01:42:48,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:48,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627720443] [2021-01-07 01:42:48,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:49,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:49,527 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 01:42:49,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627720443] [2021-01-07 01:42:49,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:42:49,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 01:42:49,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519247222] [2021-01-07 01:42:49,536 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-07 01:42:49,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:49,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-07 01:42:49,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-07 01:42:49,554 INFO L87 Difference]: Start difference. First operand 510 states. Second operand 2 states. [2021-01-07 01:42:49,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:49,621 INFO L93 Difference]: Finished difference Result 1016 states and 1335 transitions. [2021-01-07 01:42:49,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-07 01:42:49,623 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 106 [2021-01-07 01:42:49,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:49,644 INFO L225 Difference]: With dead ends: 1016 [2021-01-07 01:42:49,645 INFO L226 Difference]: Without dead ends: 471 [2021-01-07 01:42:49,656 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 01:42:49,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2021-01-07 01:42:49,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 471. [2021-01-07 01:42:49,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2021-01-07 01:42:49,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 581 transitions. [2021-01-07 01:42:49,775 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 581 transitions. Word has length 106 [2021-01-07 01:42:49,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:49,776 INFO L481 AbstractCegarLoop]: Abstraction has 471 states and 581 transitions. [2021-01-07 01:42:49,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-07 01:42:49,776 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 581 transitions. [2021-01-07 01:42:49,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-01-07 01:42:49,781 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:49,781 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:42:49,782 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 01:42:49,782 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:49,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:49,785 INFO L82 PathProgramCache]: Analyzing trace with hash -242320004, now seen corresponding path program 1 times [2021-01-07 01:42:49,786 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:49,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943454018] [2021-01-07 01:42:49,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:50,212 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 01:42:50,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943454018] [2021-01-07 01:42:50,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:42:50,214 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:42:50,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546758478] [2021-01-07 01:42:50,215 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:42:50,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:50,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:42:50,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:42:50,219 INFO L87 Difference]: Start difference. First operand 471 states and 581 transitions. Second operand 3 states. [2021-01-07 01:42:50,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:50,334 INFO L93 Difference]: Finished difference Result 951 states and 1189 transitions. [2021-01-07 01:42:50,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:42:50,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2021-01-07 01:42:50,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:50,338 INFO L225 Difference]: With dead ends: 951 [2021-01-07 01:42:50,339 INFO L226 Difference]: Without dead ends: 525 [2021-01-07 01:42:50,341 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:42:50,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2021-01-07 01:42:50,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 525. [2021-01-07 01:42:50,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2021-01-07 01:42:50,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 654 transitions. [2021-01-07 01:42:50,358 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 654 transitions. Word has length 106 [2021-01-07 01:42:50,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:50,359 INFO L481 AbstractCegarLoop]: Abstraction has 525 states and 654 transitions. [2021-01-07 01:42:50,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:42:50,359 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 654 transitions. [2021-01-07 01:42:50,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-01-07 01:42:50,361 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:50,362 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:42:50,362 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 01:42:50,362 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:50,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:50,363 INFO L82 PathProgramCache]: Analyzing trace with hash 38091681, now seen corresponding path program 1 times [2021-01-07 01:42:50,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:50,363 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023246635] [2021-01-07 01:42:50,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:50,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 01:42:50,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023246635] [2021-01-07 01:42:50,632 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:42:50,632 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 01:42:50,632 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019508002] [2021-01-07 01:42:50,633 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:42:50,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:50,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:42:50,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:42:50,635 INFO L87 Difference]: Start difference. First operand 525 states and 654 transitions. Second operand 4 states. [2021-01-07 01:42:51,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:51,375 INFO L93 Difference]: Finished difference Result 1610 states and 2039 transitions. [2021-01-07 01:42:51,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 01:42:51,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2021-01-07 01:42:51,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:51,393 INFO L225 Difference]: With dead ends: 1610 [2021-01-07 01:42:51,393 INFO L226 Difference]: Without dead ends: 1130 [2021-01-07 01:42:51,395 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:42:51,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2021-01-07 01:42:51,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 527. [2021-01-07 01:42:51,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2021-01-07 01:42:51,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 656 transitions. [2021-01-07 01:42:51,469 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 656 transitions. Word has length 118 [2021-01-07 01:42:51,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:51,472 INFO L481 AbstractCegarLoop]: Abstraction has 527 states and 656 transitions. [2021-01-07 01:42:51,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:42:51,473 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 656 transitions. [2021-01-07 01:42:51,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2021-01-07 01:42:51,475 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:51,476 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:42:51,476 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-07 01:42:51,476 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:51,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:51,477 INFO L82 PathProgramCache]: Analyzing trace with hash -442988577, now seen corresponding path program 1 times [2021-01-07 01:42:51,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:51,478 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902318949] [2021-01-07 01:42:51,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:51,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:51,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 01:42:51,821 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902318949] [2021-01-07 01:42:51,826 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:42:51,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:42:51,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754308586] [2021-01-07 01:42:51,827 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:42:51,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:51,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:42:51,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:42:51,828 INFO L87 Difference]: Start difference. First operand 527 states and 656 transitions. Second operand 3 states. [2021-01-07 01:42:51,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:51,860 INFO L93 Difference]: Finished difference Result 1011 states and 1268 transitions. [2021-01-07 01:42:51,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:42:51,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2021-01-07 01:42:51,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:51,865 INFO L225 Difference]: With dead ends: 1011 [2021-01-07 01:42:51,865 INFO L226 Difference]: Without dead ends: 529 [2021-01-07 01:42:51,866 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:42:51,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2021-01-07 01:42:51,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 528. [2021-01-07 01:42:51,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2021-01-07 01:42:51,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 657 transitions. [2021-01-07 01:42:51,890 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 657 transitions. Word has length 118 [2021-01-07 01:42:51,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:51,891 INFO L481 AbstractCegarLoop]: Abstraction has 528 states and 657 transitions. [2021-01-07 01:42:51,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:42:51,891 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 657 transitions. [2021-01-07 01:42:51,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-01-07 01:42:51,893 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:51,893 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:42:51,894 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-07 01:42:51,894 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:51,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:51,896 INFO L82 PathProgramCache]: Analyzing trace with hash 23502531, now seen corresponding path program 1 times [2021-01-07 01:42:51,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:51,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932543615] [2021-01-07 01:42:51,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:52,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:52,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-07 01:42:52,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932543615] [2021-01-07 01:42:52,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:42:52,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 01:42:52,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110510333] [2021-01-07 01:42:52,197 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:42:52,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:52,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:42:52,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:42:52,198 INFO L87 Difference]: Start difference. First operand 528 states and 657 transitions. Second operand 4 states. [2021-01-07 01:42:52,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:52,336 INFO L93 Difference]: Finished difference Result 2026 states and 2582 transitions. [2021-01-07 01:42:52,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 01:42:52,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2021-01-07 01:42:52,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:52,346 INFO L225 Difference]: With dead ends: 2026 [2021-01-07 01:42:52,346 INFO L226 Difference]: Without dead ends: 1543 [2021-01-07 01:42:52,348 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:42:52,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2021-01-07 01:42:52,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 530. [2021-01-07 01:42:52,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2021-01-07 01:42:52,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 659 transitions. [2021-01-07 01:42:52,373 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 659 transitions. Word has length 120 [2021-01-07 01:42:52,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:52,375 INFO L481 AbstractCegarLoop]: Abstraction has 530 states and 659 transitions. [2021-01-07 01:42:52,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:42:52,375 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 659 transitions. [2021-01-07 01:42:52,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-07 01:42:52,378 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:52,381 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:42:52,381 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-07 01:42:52,381 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:52,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:52,382 INFO L82 PathProgramCache]: Analyzing trace with hash -199075039, now seen corresponding path program 1 times [2021-01-07 01:42:52,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:52,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204116202] [2021-01-07 01:42:52,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:52,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:52,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-07 01:42:52,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204116202] [2021-01-07 01:42:52,644 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:42:52,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 01:42:52,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860100918] [2021-01-07 01:42:52,645 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:42:52,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:52,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:42:52,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:42:52,646 INFO L87 Difference]: Start difference. First operand 530 states and 659 transitions. Second operand 4 states. [2021-01-07 01:42:52,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:52,809 INFO L93 Difference]: Finished difference Result 2046 states and 2597 transitions. [2021-01-07 01:42:52,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 01:42:52,810 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2021-01-07 01:42:52,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:52,818 INFO L225 Difference]: With dead ends: 2046 [2021-01-07 01:42:52,818 INFO L226 Difference]: Without dead ends: 1561 [2021-01-07 01:42:52,819 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:42:52,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1561 states. [2021-01-07 01:42:52,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1561 to 532. [2021-01-07 01:42:52,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2021-01-07 01:42:52,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 661 transitions. [2021-01-07 01:42:52,856 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 661 transitions. Word has length 127 [2021-01-07 01:42:52,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:52,857 INFO L481 AbstractCegarLoop]: Abstraction has 532 states and 661 transitions. [2021-01-07 01:42:52,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:42:52,860 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 661 transitions. [2021-01-07 01:42:52,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-07 01:42:52,862 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:52,862 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:42:52,907 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-07 01:42:52,907 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:52,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:52,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1220143393, now seen corresponding path program 1 times [2021-01-07 01:42:52,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:52,912 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45783056] [2021-01-07 01:42:52,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:53,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:53,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-07 01:42:53,589 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45783056] [2021-01-07 01:42:53,589 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:42:53,589 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 01:42:53,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759998035] [2021-01-07 01:42:53,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 01:42:53,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:53,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 01:42:53,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:42:53,592 INFO L87 Difference]: Start difference. First operand 532 states and 661 transitions. Second operand 5 states. [2021-01-07 01:42:56,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:42:56,347 INFO L93 Difference]: Finished difference Result 1474 states and 1857 transitions. [2021-01-07 01:42:56,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 01:42:56,348 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2021-01-07 01:42:56,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:42:56,356 INFO L225 Difference]: With dead ends: 1474 [2021-01-07 01:42:56,356 INFO L226 Difference]: Without dead ends: 1458 [2021-01-07 01:42:56,357 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:42:56,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2021-01-07 01:42:56,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 995. [2021-01-07 01:42:56,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2021-01-07 01:42:56,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1251 transitions. [2021-01-07 01:42:56,400 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1251 transitions. Word has length 127 [2021-01-07 01:42:56,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:42:56,401 INFO L481 AbstractCegarLoop]: Abstraction has 995 states and 1251 transitions. [2021-01-07 01:42:56,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 01:42:56,401 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1251 transitions. [2021-01-07 01:42:56,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-01-07 01:42:56,403 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:42:56,404 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:42:56,404 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-07 01:42:56,404 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:42:56,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:42:56,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1283400906, now seen corresponding path program 1 times [2021-01-07 01:42:56,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:42:56,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407735500] [2021-01-07 01:42:56,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:42:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:42:56,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-07 01:42:56,880 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407735500] [2021-01-07 01:42:56,880 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:42:56,881 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 01:42:56,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215234182] [2021-01-07 01:42:56,881 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 01:42:56,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:42:56,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 01:42:56,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-07 01:42:56,882 INFO L87 Difference]: Start difference. First operand 995 states and 1251 transitions. Second operand 6 states. [2021-01-07 01:43:00,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:43:00,026 INFO L93 Difference]: Finished difference Result 1482 states and 1865 transitions. [2021-01-07 01:43:00,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 01:43:00,027 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2021-01-07 01:43:00,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:43:00,034 INFO L225 Difference]: With dead ends: 1482 [2021-01-07 01:43:00,034 INFO L226 Difference]: Without dead ends: 1466 [2021-01-07 01:43:00,038 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-07 01:43:00,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2021-01-07 01:43:00,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1466. [2021-01-07 01:43:00,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1466 states. [2021-01-07 01:43:00,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 1849 transitions. [2021-01-07 01:43:00,095 INFO L78 Accepts]: Start accepts. Automaton has 1466 states and 1849 transitions. Word has length 135 [2021-01-07 01:43:00,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:43:00,095 INFO L481 AbstractCegarLoop]: Abstraction has 1466 states and 1849 transitions. [2021-01-07 01:43:00,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 01:43:00,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1466 states and 1849 transitions. [2021-01-07 01:43:00,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-01-07 01:43:00,098 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:43:00,098 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:43:00,099 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-07 01:43:00,099 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:43:00,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:43:00,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1345522381, now seen corresponding path program 1 times [2021-01-07 01:43:00,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:43:00,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673234954] [2021-01-07 01:43:00,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:43:00,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:43:00,438 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-07 01:43:00,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673234954] [2021-01-07 01:43:00,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:43:00,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 01:43:00,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972258001] [2021-01-07 01:43:00,439 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:43:00,439 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:43:00,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:43:00,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:43:00,440 INFO L87 Difference]: Start difference. First operand 1466 states and 1849 transitions. Second operand 4 states. [2021-01-07 01:43:01,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:43:01,928 INFO L93 Difference]: Finished difference Result 3842 states and 4888 transitions. [2021-01-07 01:43:01,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 01:43:01,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2021-01-07 01:43:01,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:43:01,945 INFO L225 Difference]: With dead ends: 3842 [2021-01-07 01:43:01,945 INFO L226 Difference]: Without dead ends: 2421 [2021-01-07 01:43:01,952 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 01:43:01,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2421 states. [2021-01-07 01:43:02,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2421 to 1472. [2021-01-07 01:43:02,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1472 states. [2021-01-07 01:43:02,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1472 states to 1472 states and 1855 transitions. [2021-01-07 01:43:02,047 INFO L78 Accepts]: Start accepts. Automaton has 1472 states and 1855 transitions. Word has length 145 [2021-01-07 01:43:02,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:43:02,047 INFO L481 AbstractCegarLoop]: Abstraction has 1472 states and 1855 transitions. [2021-01-07 01:43:02,047 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:43:02,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1472 states and 1855 transitions. [2021-01-07 01:43:02,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-01-07 01:43:02,050 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:43:02,051 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:43:02,051 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-07 01:43:02,051 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:43:02,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:43:02,052 INFO L82 PathProgramCache]: Analyzing trace with hash 722602251, now seen corresponding path program 1 times [2021-01-07 01:43:02,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:43:02,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996180665] [2021-01-07 01:43:02,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:43:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:43:02,350 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-07 01:43:02,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996180665] [2021-01-07 01:43:02,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:43:02,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 01:43:02,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380619054] [2021-01-07 01:43:02,351 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:43:02,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:43:02,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:43:02,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:43:02,352 INFO L87 Difference]: Start difference. First operand 1472 states and 1855 transitions. Second operand 4 states. [2021-01-07 01:43:03,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:43:03,225 INFO L93 Difference]: Finished difference Result 3869 states and 4909 transitions. [2021-01-07 01:43:03,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 01:43:03,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2021-01-07 01:43:03,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:43:03,242 INFO L225 Difference]: With dead ends: 3869 [2021-01-07 01:43:03,242 INFO L226 Difference]: Without dead ends: 2442 [2021-01-07 01:43:03,246 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:43:03,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2021-01-07 01:43:03,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 1478. [2021-01-07 01:43:03,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1478 states. [2021-01-07 01:43:03,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1478 states and 1861 transitions. [2021-01-07 01:43:03,360 INFO L78 Accepts]: Start accepts. Automaton has 1478 states and 1861 transitions. Word has length 147 [2021-01-07 01:43:03,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:43:03,360 INFO L481 AbstractCegarLoop]: Abstraction has 1478 states and 1861 transitions. [2021-01-07 01:43:03,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:43:03,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 1861 transitions. [2021-01-07 01:43:03,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-01-07 01:43:03,364 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:43:03,364 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:43:03,364 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-07 01:43:03,364 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:43:03,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:43:03,365 INFO L82 PathProgramCache]: Analyzing trace with hash 737343163, now seen corresponding path program 1 times [2021-01-07 01:43:03,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:43:03,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811498006] [2021-01-07 01:43:03,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:43:03,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:43:03,658 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-07 01:43:03,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811498006] [2021-01-07 01:43:03,658 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:43:03,658 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 01:43:03,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050609510] [2021-01-07 01:43:03,659 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:43:03,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:43:03,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:43:03,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:43:03,660 INFO L87 Difference]: Start difference. First operand 1478 states and 1861 transitions. Second operand 4 states. [2021-01-07 01:43:04,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:43:04,979 INFO L93 Difference]: Finished difference Result 3872 states and 4918 transitions. [2021-01-07 01:43:04,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 01:43:04,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2021-01-07 01:43:04,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:43:04,997 INFO L225 Difference]: With dead ends: 3872 [2021-01-07 01:43:04,997 INFO L226 Difference]: Without dead ends: 2439 [2021-01-07 01:43:05,000 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 01:43:05,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2439 states. [2021-01-07 01:43:05,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2439 to 1478. [2021-01-07 01:43:05,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1478 states. [2021-01-07 01:43:05,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1478 states and 1861 transitions. [2021-01-07 01:43:05,194 INFO L78 Accepts]: Start accepts. Automaton has 1478 states and 1861 transitions. Word has length 147 [2021-01-07 01:43:05,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:43:05,194 INFO L481 AbstractCegarLoop]: Abstraction has 1478 states and 1861 transitions. [2021-01-07 01:43:05,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:43:05,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 1861 transitions. [2021-01-07 01:43:05,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-01-07 01:43:05,198 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:43:05,198 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:43:05,198 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-07 01:43:05,199 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:43:05,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:43:05,199 INFO L82 PathProgramCache]: Analyzing trace with hash -2084873882, now seen corresponding path program 1 times [2021-01-07 01:43:05,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:43:05,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40906164] [2021-01-07 01:43:05,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:43:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:43:05,422 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-07 01:43:05,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40906164] [2021-01-07 01:43:05,423 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:43:05,423 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:43:05,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585467832] [2021-01-07 01:43:05,424 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:43:05,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:43:05,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:43:05,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:43:05,425 INFO L87 Difference]: Start difference. First operand 1478 states and 1861 transitions. Second operand 3 states. [2021-01-07 01:43:05,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:43:05,889 INFO L93 Difference]: Finished difference Result 2914 states and 3681 transitions. [2021-01-07 01:43:05,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:43:05,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2021-01-07 01:43:05,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:43:05,897 INFO L225 Difference]: With dead ends: 2914 [2021-01-07 01:43:05,898 INFO L226 Difference]: Without dead ends: 1481 [2021-01-07 01:43:05,901 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:43:05,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2021-01-07 01:43:06,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1481. [2021-01-07 01:43:06,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1481 states. [2021-01-07 01:43:06,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 1864 transitions. [2021-01-07 01:43:06,018 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 1864 transitions. Word has length 148 [2021-01-07 01:43:06,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:43:06,019 INFO L481 AbstractCegarLoop]: Abstraction has 1481 states and 1864 transitions. [2021-01-07 01:43:06,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:43:06,019 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 1864 transitions. [2021-01-07 01:43:06,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-01-07 01:43:06,022 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:43:06,022 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:43:06,022 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-07 01:43:06,022 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:43:06,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:43:06,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1242742760, now seen corresponding path program 1 times [2021-01-07 01:43:06,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:43:06,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699148371] [2021-01-07 01:43:06,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:43:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:43:06,515 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-07 01:43:06,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699148371] [2021-01-07 01:43:06,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:43:06,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 01:43:06,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691099617] [2021-01-07 01:43:06,517 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 01:43:06,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:43:06,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 01:43:06,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:43:06,519 INFO L87 Difference]: Start difference. First operand 1481 states and 1864 transitions. Second operand 5 states. [2021-01-07 01:43:07,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:43:07,216 INFO L93 Difference]: Finished difference Result 5911 states and 7575 transitions. [2021-01-07 01:43:07,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 01:43:07,217 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2021-01-07 01:43:07,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:43:07,239 INFO L225 Difference]: With dead ends: 5911 [2021-01-07 01:43:07,239 INFO L226 Difference]: Without dead ends: 4475 [2021-01-07 01:43:07,243 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 01:43:07,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4475 states. [2021-01-07 01:43:07,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4475 to 1490. [2021-01-07 01:43:07,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1490 states. [2021-01-07 01:43:07,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 1873 transitions. [2021-01-07 01:43:07,399 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 1873 transitions. Word has length 148 [2021-01-07 01:43:07,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:43:07,399 INFO L481 AbstractCegarLoop]: Abstraction has 1490 states and 1873 transitions. [2021-01-07 01:43:07,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 01:43:07,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1873 transitions. [2021-01-07 01:43:07,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-01-07 01:43:07,402 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:43:07,403 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:43:07,403 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-07 01:43:07,403 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:43:07,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:43:07,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1493147347, now seen corresponding path program 1 times [2021-01-07 01:43:07,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:43:07,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637813475] [2021-01-07 01:43:07,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:43:07,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:43:07,616 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-07 01:43:07,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637813475] [2021-01-07 01:43:07,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:43:07,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 01:43:07,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899946936] [2021-01-07 01:43:07,617 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:43:07,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:43:07,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:43:07,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:43:07,618 INFO L87 Difference]: Start difference. First operand 1490 states and 1873 transitions. Second operand 4 states. [2021-01-07 01:43:08,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:43:08,662 INFO L93 Difference]: Finished difference Result 3917 states and 4957 transitions. [2021-01-07 01:43:08,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 01:43:08,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2021-01-07 01:43:08,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:43:08,678 INFO L225 Difference]: With dead ends: 3917 [2021-01-07 01:43:08,679 INFO L226 Difference]: Without dead ends: 2472 [2021-01-07 01:43:08,683 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:43:08,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2472 states. [2021-01-07 01:43:08,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2472 to 1490. [2021-01-07 01:43:08,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1490 states. [2021-01-07 01:43:08,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 1873 transitions. [2021-01-07 01:43:08,834 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 1873 transitions. Word has length 149 [2021-01-07 01:43:08,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:43:08,834 INFO L481 AbstractCegarLoop]: Abstraction has 1490 states and 1873 transitions. [2021-01-07 01:43:08,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:43:08,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1873 transitions. [2021-01-07 01:43:08,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-01-07 01:43:08,837 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:43:08,838 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:43:08,838 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-07 01:43:08,838 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:43:08,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:43:08,839 INFO L82 PathProgramCache]: Analyzing trace with hash 109974458, now seen corresponding path program 1 times [2021-01-07 01:43:08,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:43:08,839 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342714064] [2021-01-07 01:43:08,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:43:08,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:43:09,101 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-07 01:43:09,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342714064] [2021-01-07 01:43:09,102 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:43:09,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:43:09,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903352376] [2021-01-07 01:43:09,103 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:43:09,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:43:09,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:43:09,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:43:09,105 INFO L87 Difference]: Start difference. First operand 1490 states and 1873 transitions. Second operand 3 states. [2021-01-07 01:43:09,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:43:09,608 INFO L93 Difference]: Finished difference Result 2938 states and 3705 transitions. [2021-01-07 01:43:09,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:43:09,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2021-01-07 01:43:09,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:43:09,616 INFO L225 Difference]: With dead ends: 2938 [2021-01-07 01:43:09,617 INFO L226 Difference]: Without dead ends: 1493 [2021-01-07 01:43:09,622 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:43:09,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2021-01-07 01:43:09,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 1493. [2021-01-07 01:43:09,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1493 states. [2021-01-07 01:43:09,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 1876 transitions. [2021-01-07 01:43:09,757 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 1876 transitions. Word has length 151 [2021-01-07 01:43:09,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:43:09,758 INFO L481 AbstractCegarLoop]: Abstraction has 1493 states and 1876 transitions. [2021-01-07 01:43:09,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:43:09,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 1876 transitions. [2021-01-07 01:43:09,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-01-07 01:43:09,761 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:43:09,761 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:43:09,761 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-07 01:43:09,762 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:43:09,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:43:09,762 INFO L82 PathProgramCache]: Analyzing trace with hash 55581560, now seen corresponding path program 1 times [2021-01-07 01:43:09,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:43:09,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310885084] [2021-01-07 01:43:09,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:43:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:43:09,963 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-07 01:43:09,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310885084] [2021-01-07 01:43:09,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:43:09,966 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:43:09,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646747669] [2021-01-07 01:43:09,967 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:43:09,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:43:09,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:43:09,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:43:09,968 INFO L87 Difference]: Start difference. First operand 1493 states and 1876 transitions. Second operand 3 states. [2021-01-07 01:43:10,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:43:10,112 INFO L93 Difference]: Finished difference Result 2947 states and 3714 transitions. [2021-01-07 01:43:10,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:43:10,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2021-01-07 01:43:10,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:43:10,122 INFO L225 Difference]: With dead ends: 2947 [2021-01-07 01:43:10,122 INFO L226 Difference]: Without dead ends: 1499 [2021-01-07 01:43:10,125 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:43:10,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states. [2021-01-07 01:43:10,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1496. [2021-01-07 01:43:10,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2021-01-07 01:43:10,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1879 transitions. [2021-01-07 01:43:10,262 INFO L78 Accepts]: Start accepts. Automaton has 1496 states and 1879 transitions. Word has length 151 [2021-01-07 01:43:10,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:43:10,263 INFO L481 AbstractCegarLoop]: Abstraction has 1496 states and 1879 transitions. [2021-01-07 01:43:10,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:43:10,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1496 states and 1879 transitions. [2021-01-07 01:43:10,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-01-07 01:43:10,266 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:43:10,266 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:43:10,266 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-07 01:43:10,266 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:43:10,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:43:10,267 INFO L82 PathProgramCache]: Analyzing trace with hash -522470724, now seen corresponding path program 1 times [2021-01-07 01:43:10,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:43:10,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152643776] [2021-01-07 01:43:10,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:43:10,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:43:10,497 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-07 01:43:10,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152643776] [2021-01-07 01:43:10,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980084050] [2021-01-07 01:43:10,497 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 01:43:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:43:11,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 2603 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-07 01:43:11,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:43:11,649 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-07 01:43:11,649 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 01:43:11,650 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-01-07 01:43:11,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390210596] [2021-01-07 01:43:11,650 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 01:43:11,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:43:11,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 01:43:11,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:43:11,651 INFO L87 Difference]: Start difference. First operand 1496 states and 1879 transitions. Second operand 5 states. [2021-01-07 01:43:11,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:43:11,816 INFO L93 Difference]: Finished difference Result 2953 states and 3720 transitions. [2021-01-07 01:43:11,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 01:43:11,816 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2021-01-07 01:43:11,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:43:11,821 INFO L225 Difference]: With dead ends: 2953 [2021-01-07 01:43:11,822 INFO L226 Difference]: Without dead ends: 1502 [2021-01-07 01:43:11,825 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:43:11,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2021-01-07 01:43:12,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1502. [2021-01-07 01:43:12,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1502 states. [2021-01-07 01:43:12,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 1885 transitions. [2021-01-07 01:43:12,057 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 1885 transitions. Word has length 153 [2021-01-07 01:43:12,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:43:12,057 INFO L481 AbstractCegarLoop]: Abstraction has 1502 states and 1885 transitions. [2021-01-07 01:43:12,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 01:43:12,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 1885 transitions. [2021-01-07 01:43:12,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-01-07 01:43:12,062 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:43:12,062 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:43:12,275 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-01-07 01:43:12,276 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:43:12,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:43:12,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1979934464, now seen corresponding path program 2 times [2021-01-07 01:43:12,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:43:12,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256984495] [2021-01-07 01:43:12,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:43:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:43:12,535 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-07 01:43:12,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256984495] [2021-01-07 01:43:12,536 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:43:12,536 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 01:43:12,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880582959] [2021-01-07 01:43:12,537 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:43:12,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:43:12,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:43:12,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 01:43:12,538 INFO L87 Difference]: Start difference. First operand 1502 states and 1885 transitions. Second operand 4 states. [2021-01-07 01:43:12,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:43:12,980 INFO L93 Difference]: Finished difference Result 5402 states and 6946 transitions. [2021-01-07 01:43:12,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 01:43:12,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2021-01-07 01:43:12,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:43:12,991 INFO L225 Difference]: With dead ends: 5402 [2021-01-07 01:43:12,991 INFO L226 Difference]: Without dead ends: 3945 [2021-01-07 01:43:12,995 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:43:13,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3945 states. [2021-01-07 01:43:13,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3945 to 1508. [2021-01-07 01:43:13,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2021-01-07 01:43:13,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 1891 transitions. [2021-01-07 01:43:13,181 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 1891 transitions. Word has length 155 [2021-01-07 01:43:13,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:43:13,181 INFO L481 AbstractCegarLoop]: Abstraction has 1508 states and 1891 transitions. [2021-01-07 01:43:13,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:43:13,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 1891 transitions. [2021-01-07 01:43:13,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-01-07 01:43:13,184 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:43:13,185 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:43:13,185 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-07 01:43:13,185 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:43:13,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:43:13,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1476952148, now seen corresponding path program 1 times [2021-01-07 01:43:13,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:43:13,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113834678] [2021-01-07 01:43:13,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:43:13,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:43:13,568 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-07 01:43:13,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113834678] [2021-01-07 01:43:13,569 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:43:13,569 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 01:43:13,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938687100] [2021-01-07 01:43:13,570 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 01:43:13,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:43:13,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 01:43:13,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 01:43:13,571 INFO L87 Difference]: Start difference. First operand 1508 states and 1891 transitions. Second operand 5 states. [2021-01-07 01:43:14,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:43:14,240 INFO L93 Difference]: Finished difference Result 6302 states and 8017 transitions. [2021-01-07 01:43:14,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 01:43:14,241 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2021-01-07 01:43:14,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:43:14,254 INFO L225 Difference]: With dead ends: 6302 [2021-01-07 01:43:14,255 INFO L226 Difference]: Without dead ends: 4839 [2021-01-07 01:43:14,259 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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 01:43:14,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4839 states. [2021-01-07 01:43:14,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4839 to 1517. [2021-01-07 01:43:14,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1517 states. [2021-01-07 01:43:14,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 1900 transitions. [2021-01-07 01:43:14,452 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 1900 transitions. Word has length 155 [2021-01-07 01:43:14,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:43:14,455 INFO L481 AbstractCegarLoop]: Abstraction has 1517 states and 1900 transitions. [2021-01-07 01:43:14,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 01:43:14,455 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 1900 transitions. [2021-01-07 01:43:14,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-01-07 01:43:14,459 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:43:14,459 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:43:14,459 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-07 01:43:14,460 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:43:14,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:43:14,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1506060004, now seen corresponding path program 1 times [2021-01-07 01:43:14,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:43:14,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205674167] [2021-01-07 01:43:14,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:43:16,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:43:16,428 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-01-07 01:43:16,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205674167] [2021-01-07 01:43:16,429 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 01:43:16,429 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 01:43:16,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781967505] [2021-01-07 01:43:16,429 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 01:43:16,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:43:16,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 01:43:16,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:43:16,430 INFO L87 Difference]: Start difference. First operand 1517 states and 1900 transitions. Second operand 3 states. [2021-01-07 01:43:16,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:43:16,602 INFO L93 Difference]: Finished difference Result 2996 states and 3763 transitions. [2021-01-07 01:43:16,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 01:43:16,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2021-01-07 01:43:16,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:43:16,607 INFO L225 Difference]: With dead ends: 2996 [2021-01-07 01:43:16,607 INFO L226 Difference]: Without dead ends: 1519 [2021-01-07 01:43:16,610 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 01:43:16,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2021-01-07 01:43:16,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1519. [2021-01-07 01:43:16,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1519 states. [2021-01-07 01:43:16,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1519 states to 1519 states and 1902 transitions. [2021-01-07 01:43:16,780 INFO L78 Accepts]: Start accepts. Automaton has 1519 states and 1902 transitions. Word has length 161 [2021-01-07 01:43:16,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:43:16,780 INFO L481 AbstractCegarLoop]: Abstraction has 1519 states and 1902 transitions. [2021-01-07 01:43:16,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 01:43:16,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1519 states and 1902 transitions. [2021-01-07 01:43:16,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2021-01-07 01:43:16,783 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:43:16,783 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:43:16,783 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-07 01:43:16,784 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:43:16,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:43:16,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1141394366, now seen corresponding path program 1 times [2021-01-07 01:43:16,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:43:16,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613889940] [2021-01-07 01:43:16,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:43:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:43:18,582 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-07 01:43:18,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613889940] [2021-01-07 01:43:18,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397255331] [2021-01-07 01:43:18,583 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 01:43:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:43:19,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 2688 conjuncts, 9 conjunts are in the unsatisfiable core [2021-01-07 01:43:19,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:43:19,744 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-07 01:43:19,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 01:43:19,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2021-01-07 01:43:19,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134838672] [2021-01-07 01:43:19,745 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 01:43:19,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:43:19,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 01:43:19,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-07 01:43:19,746 INFO L87 Difference]: Start difference. First operand 1519 states and 1902 transitions. Second operand 4 states. [2021-01-07 01:43:20,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:43:20,956 INFO L93 Difference]: Finished difference Result 3012 states and 3782 transitions. [2021-01-07 01:43:20,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 01:43:20,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2021-01-07 01:43:20,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:43:20,961 INFO L225 Difference]: With dead ends: 3012 [2021-01-07 01:43:20,961 INFO L226 Difference]: Without dead ends: 1516 [2021-01-07 01:43:20,963 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-01-07 01:43:20,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2021-01-07 01:43:21,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1492. [2021-01-07 01:43:21,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1492 states. [2021-01-07 01:43:21,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 1860 transitions. [2021-01-07 01:43:21,133 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 1860 transitions. Word has length 163 [2021-01-07 01:43:21,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:43:21,133 INFO L481 AbstractCegarLoop]: Abstraction has 1492 states and 1860 transitions. [2021-01-07 01:43:21,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 01:43:21,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1860 transitions. [2021-01-07 01:43:21,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-01-07 01:43:21,136 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:43:21,137 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:43:21,350 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:43:21,351 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:43:21,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:43:21,352 INFO L82 PathProgramCache]: Analyzing trace with hash 607182715, now seen corresponding path program 1 times [2021-01-07 01:43:21,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:43:21,353 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766706973] [2021-01-07 01:43:21,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:43:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:43:23,250 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-07 01:43:23,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766706973] [2021-01-07 01:43:23,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189563123] [2021-01-07 01:43:23,251 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 01:43:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:43:24,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 2705 conjuncts, 17 conjunts are in the unsatisfiable core [2021-01-07 01:43:24,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:43:24,405 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-01-07 01:43:24,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 01:43:24,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 8 [2021-01-07 01:43:24,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570891708] [2021-01-07 01:43:24,407 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 01:43:24,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:43:24,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 01:43:24,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-01-07 01:43:24,408 INFO L87 Difference]: Start difference. First operand 1492 states and 1860 transitions. Second operand 6 states. [2021-01-07 01:43:25,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:43:25,531 INFO L93 Difference]: Finished difference Result 7523 states and 9638 transitions. [2021-01-07 01:43:25,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-07 01:43:25,534 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 165 [2021-01-07 01:43:25,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:43:25,548 INFO L225 Difference]: With dead ends: 7523 [2021-01-07 01:43:25,548 INFO L226 Difference]: Without dead ends: 6078 [2021-01-07 01:43:25,553 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2021-01-07 01:43:25,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6078 states. [2021-01-07 01:43:25,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6078 to 1492. [2021-01-07 01:43:25,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1492 states. [2021-01-07 01:43:25,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1492 states to 1492 states and 1860 transitions. [2021-01-07 01:43:25,817 INFO L78 Accepts]: Start accepts. Automaton has 1492 states and 1860 transitions. Word has length 165 [2021-01-07 01:43:25,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:43:25,818 INFO L481 AbstractCegarLoop]: Abstraction has 1492 states and 1860 transitions. [2021-01-07 01:43:25,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 01:43:25,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1492 states and 1860 transitions. [2021-01-07 01:43:25,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2021-01-07 01:43:25,820 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:43:25,821 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:43:26,034 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-01-07 01:43:26,035 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:43:26,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:43:26,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1051083389, now seen corresponding path program 1 times [2021-01-07 01:43:26,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:43:26,037 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215233208] [2021-01-07 01:43:26,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:43:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:43:27,620 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-07 01:43:27,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215233208] [2021-01-07 01:43:27,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409236559] [2021-01-07 01:43:27,621 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 01:43:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:43:38,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 2709 conjuncts, 15 conjunts are in the unsatisfiable core [2021-01-07 01:43:38,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 01:43:38,564 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-07 01:43:38,565 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 01:43:38,565 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-01-07 01:43:38,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236713304] [2021-01-07 01:43:38,566 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 01:43:38,566 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 01:43:38,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 01:43:38,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-07 01:43:38,567 INFO L87 Difference]: Start difference. First operand 1492 states and 1860 transitions. Second operand 6 states. [2021-01-07 01:43:38,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 01:43:38,854 INFO L93 Difference]: Finished difference Result 2945 states and 3682 transitions. [2021-01-07 01:43:38,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 01:43:38,854 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 165 [2021-01-07 01:43:38,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 01:43:38,858 INFO L225 Difference]: With dead ends: 2945 [2021-01-07 01:43:38,858 INFO L226 Difference]: Without dead ends: 1494 [2021-01-07 01:43:38,862 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-07 01:43:38,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2021-01-07 01:43:39,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1494. [2021-01-07 01:43:39,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1494 states. [2021-01-07 01:43:39,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 1862 transitions. [2021-01-07 01:43:39,173 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 1862 transitions. Word has length 165 [2021-01-07 01:43:39,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 01:43:39,173 INFO L481 AbstractCegarLoop]: Abstraction has 1494 states and 1862 transitions. [2021-01-07 01:43:39,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 01:43:39,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 1862 transitions. [2021-01-07 01:43:39,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-01-07 01:43:39,176 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 01:43:39,176 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 01:43:39,387 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 01:43:39,388 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-07 01:43:39,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 01:43:39,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1407706271, now seen corresponding path program 2 times [2021-01-07 01:43:39,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 01:43:39,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636898397] [2021-01-07 01:43:39,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 01:43:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 01:43:40,962 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-07 01:43:40,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636898397] [2021-01-07 01:43:40,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785358693] [2021-01-07 01:43:40,962 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true