/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/list-ext3-properties/dll_nullified-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 16:34:33,373 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 16:34:33,376 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 16:34:33,413 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 16:34:33,414 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 16:34:33,416 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 16:34:33,417 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 16:34:33,420 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 16:34:33,422 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 16:34:33,423 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 16:34:33,425 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 16:34:33,426 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 16:34:33,427 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 16:34:33,428 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 16:34:33,429 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 16:34:33,431 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 16:34:33,432 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 16:34:33,433 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 16:34:33,435 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 16:34:33,437 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 16:34:33,439 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 16:34:33,441 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 16:34:33,442 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 16:34:33,453 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 16:34:33,456 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 16:34:33,457 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 16:34:33,457 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 16:34:33,458 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 16:34:33,459 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 16:34:33,460 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 16:34:33,460 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 16:34:33,463 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 16:34:33,464 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 16:34:33,465 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 16:34:33,466 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 16:34:33,466 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 16:34:33,467 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 16:34:33,468 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 16:34:33,468 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 16:34:33,469 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 16:34:33,470 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 16:34:33,471 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 16:34:33,497 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 16:34:33,498 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 16:34:33,499 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 16:34:33,499 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 16:34:33,500 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 16:34:33,500 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 16:34:33,500 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 16:34:33,501 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 16:34:33,501 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 16:34:33,501 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 16:34:33,501 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 16:34:33,502 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 16:34:33,502 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 16:34:33,502 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 16:34:33,502 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 16:34:33,503 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 16:34:33,503 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 16:34:33,503 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 16:34:33,503 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 16:34:33,504 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 16:34:33,504 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 16:34:33,504 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 16:34:33,504 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 16:34:33,505 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 16:34:33,505 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 16:34:33,505 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 16:34:33,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 16:34:33,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 16:34:33,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 16:34:33,932 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 16:34:33,933 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 16:34:33,934 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i [2021-01-06 16:34:34,006 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e2692845a/e490f226d98346609e1684d93e18f070/FLAGf1859d715 [2021-01-06 16:34:34,638 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 16:34:34,638 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nullified-1.i [2021-01-06 16:34:34,658 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e2692845a/e490f226d98346609e1684d93e18f070/FLAGf1859d715 [2021-01-06 16:34:34,932 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e2692845a/e490f226d98346609e1684d93e18f070 [2021-01-06 16:34:34,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 16:34:34,937 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 16:34:34,939 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 16:34:34,939 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 16:34:34,943 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 16:34:34,944 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 04:34:34" (1/1) ... [2021-01-06 16:34:34,946 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41218a8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:34:34, skipping insertion in model container [2021-01-06 16:34:34,946 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 04:34:34" (1/1) ... [2021-01-06 16:34:34,963 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 16:34:35,027 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~0,],base],StructAccessExpression[IdentifierExpression[~new_head~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~new_head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~new_head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~new_head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~new_head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~head~0,] left hand side expression in assignment: lhs: VariableLHS[~head~1,] left hand side expression in assignment: lhs: VariableLHS[~head~1,] [2021-01-06 16:34:35,375 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/list-ext3-properties/dll_nullified-1.i[24046,24059] [2021-01-06 16:34:35,384 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 16:34:35,400 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~0,],base],StructAccessExpression[IdentifierExpression[~new_head~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[12],StructAccessExpression[IdentifierExpression[~new_head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[24],StructAccessExpression[IdentifierExpression[~new_head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~new_head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~new_head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~new_head~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~head~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[16],StructAccessExpression[IdentifierExpression[~head~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~head~0,] left hand side expression in assignment: lhs: VariableLHS[~head~1,] left hand side expression in assignment: lhs: VariableLHS[~head~1,] [2021-01-06 16:34:35,496 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/list-ext3-properties/dll_nullified-1.i[24046,24059] [2021-01-06 16:34:35,500 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 16:34:35,566 INFO L208 MainTranslator]: Completed translation [2021-01-06 16:34:35,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:34:35 WrapperNode [2021-01-06 16:34:35,567 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 16:34:35,573 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 16:34:35,573 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 16:34:35,573 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 16:34:35,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:34:35" (1/1) ... [2021-01-06 16:34:35,629 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:34:35" (1/1) ... [2021-01-06 16:34:35,676 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 16:34:35,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 16:34:35,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 16:34:35,680 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 16:34:35,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:34:35" (1/1) ... [2021-01-06 16:34:35,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:34:35" (1/1) ... [2021-01-06 16:34:35,703 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:34:35" (1/1) ... [2021-01-06 16:34:35,703 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:34:35" (1/1) ... [2021-01-06 16:34:35,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:34:35" (1/1) ... [2021-01-06 16:34:35,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:34:35" (1/1) ... [2021-01-06 16:34:35,744 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:34:35" (1/1) ... [2021-01-06 16:34:35,752 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 16:34:35,753 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 16:34:35,753 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 16:34:35,753 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 16:34:35,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:34:35" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 16:34:35,875 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-06 16:34:35,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 16:34:35,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-06 16:34:35,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-06 16:34:35,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 16:34:35,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-06 16:34:35,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-06 16:34:35,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 16:34:35,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 16:34:35,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 16:34:36,435 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 16:34:36,436 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2021-01-06 16:34:36,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:34:36 BoogieIcfgContainer [2021-01-06 16:34:36,438 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 16:34:36,439 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 16:34:36,439 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 16:34:36,443 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 16:34:36,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 04:34:34" (1/3) ... [2021-01-06 16:34:36,444 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58808143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 04:34:36, skipping insertion in model container [2021-01-06 16:34:36,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 04:34:35" (2/3) ... [2021-01-06 16:34:36,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58808143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 04:34:36, skipping insertion in model container [2021-01-06 16:34:36,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:34:36" (3/3) ... [2021-01-06 16:34:36,447 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_nullified-1.i [2021-01-06 16:34:36,454 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 16:34:36,459 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 16:34:36,478 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 16:34:36,506 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 16:34:36,506 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 16:34:36,506 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 16:34:36,507 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 16:34:36,507 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 16:34:36,507 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 16:34:36,507 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 16:34:36,507 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 16:34:36,522 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2021-01-06 16:34:36,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-01-06 16:34:36,529 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:34:36,529 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:34:36,530 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:34:36,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:34:36,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1957812527, now seen corresponding path program 1 times [2021-01-06 16:34:36,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:34:36,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984987407] [2021-01-06 16:34:36,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:34:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:34:36,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:34:36,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984987407] [2021-01-06 16:34:36,706 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:34:36,706 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 16:34:36,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542024261] [2021-01-06 16:34:36,712 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-06 16:34:36,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:34:36,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-06 16:34:36,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 16:34:36,730 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2021-01-06 16:34:36,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:34:36,751 INFO L93 Difference]: Finished difference Result 48 states and 71 transitions. [2021-01-06 16:34:36,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-06 16:34:36,752 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2021-01-06 16:34:36,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:34:36,762 INFO L225 Difference]: With dead ends: 48 [2021-01-06 16:34:36,762 INFO L226 Difference]: Without dead ends: 24 [2021-01-06 16:34:36,766 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 16:34:36,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-01-06 16:34:36,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-01-06 16:34:36,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2021-01-06 16:34:36,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2021-01-06 16:34:36,809 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 12 [2021-01-06 16:34:36,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:34:36,810 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2021-01-06 16:34:36,810 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-06 16:34:36,810 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2021-01-06 16:34:36,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-01-06 16:34:36,811 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:34:36,811 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:34:36,811 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 16:34:36,812 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:34:36,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:34:36,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1580862863, now seen corresponding path program 1 times [2021-01-06 16:34:36,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:34:36,813 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429694282] [2021-01-06 16:34:36,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:34:36,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:34:36,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:34:36,911 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429694282] [2021-01-06 16:34:36,911 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:34:36,912 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 16:34:36,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325831204] [2021-01-06 16:34:36,915 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 16:34:36,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:34:36,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 16:34:36,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 16:34:36,917 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand 3 states. [2021-01-06 16:34:36,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:34:36,983 INFO L93 Difference]: Finished difference Result 46 states and 64 transitions. [2021-01-06 16:34:36,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 16:34:36,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2021-01-06 16:34:36,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:34:36,987 INFO L225 Difference]: With dead ends: 46 [2021-01-06 16:34:36,987 INFO L226 Difference]: Without dead ends: 31 [2021-01-06 16:34:36,990 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 16:34:36,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-01-06 16:34:37,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2021-01-06 16:34:37,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2021-01-06 16:34:37,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2021-01-06 16:34:37,005 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 12 [2021-01-06 16:34:37,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:34:37,005 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2021-01-06 16:34:37,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 16:34:37,006 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2021-01-06 16:34:37,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-01-06 16:34:37,008 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:34:37,009 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:34:37,010 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 16:34:37,010 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:34:37,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:34:37,013 INFO L82 PathProgramCache]: Analyzing trace with hash -2031015874, now seen corresponding path program 1 times [2021-01-06 16:34:37,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:34:37,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641206342] [2021-01-06 16:34:37,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:34:37,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:34:37,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:34:37,203 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641206342] [2021-01-06 16:34:37,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 16:34:37,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 16:34:37,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582782065] [2021-01-06 16:34:37,206 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 16:34:37,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:34:37,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 16:34:37,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 16:34:37,210 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand 3 states. [2021-01-06 16:34:37,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:34:37,262 INFO L93 Difference]: Finished difference Result 53 states and 73 transitions. [2021-01-06 16:34:37,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 16:34:37,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2021-01-06 16:34:37,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:34:37,268 INFO L225 Difference]: With dead ends: 53 [2021-01-06 16:34:37,268 INFO L226 Difference]: Without dead ends: 31 [2021-01-06 16:34:37,270 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 16:34:37,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-01-06 16:34:37,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2021-01-06 16:34:37,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2021-01-06 16:34:37,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2021-01-06 16:34:37,281 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 19 [2021-01-06 16:34:37,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:34:37,282 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2021-01-06 16:34:37,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 16:34:37,282 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2021-01-06 16:34:37,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-01-06 16:34:37,283 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:34:37,284 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:34:37,284 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 16:34:37,284 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:34:37,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:34:37,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1772850436, now seen corresponding path program 1 times [2021-01-06 16:34:37,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:34:37,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209024127] [2021-01-06 16:34:37,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:34:37,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:34:37,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:34:37,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209024127] [2021-01-06 16:34:37,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003448255] [2021-01-06 16:34:37,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:34:37,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:34:37,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-06 16:34:37,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:34:37,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:34:37,633 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:34:37,633 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-01-06 16:34:37,634 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221727352] [2021-01-06 16:34:37,636 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 16:34:37,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:34:37,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 16:34:37,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 16:34:37,638 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand 5 states. [2021-01-06 16:34:37,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:34:37,702 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2021-01-06 16:34:37,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 16:34:37,703 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2021-01-06 16:34:37,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:34:37,705 INFO L225 Difference]: With dead ends: 53 [2021-01-06 16:34:37,705 INFO L226 Difference]: Without dead ends: 38 [2021-01-06 16:34:37,706 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-06 16:34:37,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-01-06 16:34:37,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2021-01-06 16:34:37,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2021-01-06 16:34:37,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2021-01-06 16:34:37,719 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 19 [2021-01-06 16:34:37,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:34:37,719 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2021-01-06 16:34:37,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 16:34:37,720 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2021-01-06 16:34:37,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-06 16:34:37,721 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:34:37,721 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:34:37,936 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:34:37,937 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:34:37,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:34:37,938 INFO L82 PathProgramCache]: Analyzing trace with hash -282378703, now seen corresponding path program 1 times [2021-01-06 16:34:37,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:34:37,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066261569] [2021-01-06 16:34:37,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:34:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:34:38,110 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:34:38,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066261569] [2021-01-06 16:34:38,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834402009] [2021-01-06 16:34:38,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:34:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:34:38,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-06 16:34:38,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:34:38,359 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:34:38,360 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:34:38,360 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-01-06 16:34:38,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662652049] [2021-01-06 16:34:38,361 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 16:34:38,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:34:38,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 16:34:38,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-01-06 16:34:38,362 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand 6 states. [2021-01-06 16:34:38,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:34:38,418 INFO L93 Difference]: Finished difference Result 60 states and 81 transitions. [2021-01-06 16:34:38,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 16:34:38,419 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2021-01-06 16:34:38,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:34:38,422 INFO L225 Difference]: With dead ends: 60 [2021-01-06 16:34:38,422 INFO L226 Difference]: Without dead ends: 45 [2021-01-06 16:34:38,424 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-01-06 16:34:38,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-01-06 16:34:38,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2021-01-06 16:34:38,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2021-01-06 16:34:38,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2021-01-06 16:34:38,439 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 26 [2021-01-06 16:34:38,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:34:38,439 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2021-01-06 16:34:38,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 16:34:38,440 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2021-01-06 16:34:38,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-01-06 16:34:38,441 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:34:38,442 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:34:38,646 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:34:38,647 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:34:38,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:34:38,649 INFO L82 PathProgramCache]: Analyzing trace with hash 700996956, now seen corresponding path program 2 times [2021-01-06 16:34:38,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:34:38,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639468736] [2021-01-06 16:34:38,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:34:38,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:34:38,742 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:34:38,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639468736] [2021-01-06 16:34:38,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470606624] [2021-01-06 16:34:38,743 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:34:38,856 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 16:34:38,857 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 16:34:38,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 7 conjunts are in the unsatisfiable core [2021-01-06 16:34:38,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:34:38,915 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:34:38,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:34:38,916 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-01-06 16:34:38,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714482078] [2021-01-06 16:34:38,916 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 16:34:38,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:34:38,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 16:34:38,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-06 16:34:38,918 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand 7 states. [2021-01-06 16:34:38,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:34:38,961 INFO L93 Difference]: Finished difference Result 67 states and 90 transitions. [2021-01-06 16:34:38,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 16:34:38,963 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2021-01-06 16:34:38,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:34:38,964 INFO L225 Difference]: With dead ends: 67 [2021-01-06 16:34:38,964 INFO L226 Difference]: Without dead ends: 52 [2021-01-06 16:34:38,965 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-01-06 16:34:38,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-01-06 16:34:38,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2021-01-06 16:34:38,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2021-01-06 16:34:38,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2021-01-06 16:34:38,970 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 33 [2021-01-06 16:34:38,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:34:38,970 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2021-01-06 16:34:38,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 16:34:38,971 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2021-01-06 16:34:38,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-01-06 16:34:38,972 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:34:38,972 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:34:39,185 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:34:39,186 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:34:39,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:34:39,187 INFO L82 PathProgramCache]: Analyzing trace with hash -338892847, now seen corresponding path program 3 times [2021-01-06 16:34:39,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:34:39,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143625773] [2021-01-06 16:34:39,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:34:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:34:39,283 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 16:34:39,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143625773] [2021-01-06 16:34:39,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142217423] [2021-01-06 16:34:39,284 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:34:39,898 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-01-06 16:34:39,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 16:34:39,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 28 conjunts are in the unsatisfiable core [2021-01-06 16:34:39,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:34:39,957 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-06 16:34:39,960 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:34:39,963 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:34:39,964 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:34:39,964 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-01-06 16:34:40,008 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:34:40,015 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2021-01-06 16:34:40,023 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:34:40,030 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:34:40,032 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:34:40,033 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:34:40,033 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-01-06 16:34:40,065 INFO L348 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-01-06 16:34:40,066 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2021-01-06 16:34:40,068 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:34:40,076 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:34:40,077 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:34:40,078 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:21 [2021-01-06 16:34:40,152 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_int_18|], 10=[|v_#memory_int_20|]} [2021-01-06 16:34:40,159 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:34:40,175 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:34:40,267 INFO L348 Elim1Store]: treesize reduction 288, result has 10.8 percent of original size [2021-01-06 16:34:40,268 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 46 treesize of output 41 [2021-01-06 16:34:40,275 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:34:40,288 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:34:40,290 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:34:40,291 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:21 [2021-01-06 16:34:40,328 INFO L348 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-01-06 16:34:40,328 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2021-01-06 16:34:40,334 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:34:40,346 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:34:40,350 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:34:40,351 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:17 [2021-01-06 16:34:40,494 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 30 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 16:34:40,494 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:34:40,495 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11] total 16 [2021-01-06 16:34:40,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463734515] [2021-01-06 16:34:40,497 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 16:34:40,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:34:40,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 16:34:40,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2021-01-06 16:34:40,499 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand 16 states. [2021-01-06 16:34:41,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:34:41,568 INFO L93 Difference]: Finished difference Result 88 states and 119 transitions. [2021-01-06 16:34:41,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-01-06 16:34:41,568 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2021-01-06 16:34:41,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:34:41,570 INFO L225 Difference]: With dead ends: 88 [2021-01-06 16:34:41,570 INFO L226 Difference]: Without dead ends: 73 [2021-01-06 16:34:41,571 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=259, Invalid=931, Unknown=0, NotChecked=0, Total=1190 [2021-01-06 16:34:41,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-01-06 16:34:41,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2021-01-06 16:34:41,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2021-01-06 16:34:41,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 73 transitions. [2021-01-06 16:34:41,587 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 73 transitions. Word has length 40 [2021-01-06 16:34:41,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:34:41,587 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 73 transitions. [2021-01-06 16:34:41,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 16:34:41,587 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 73 transitions. [2021-01-06 16:34:41,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-01-06 16:34:41,589 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:34:41,589 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:34:41,789 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:34:41,790 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:34:41,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:34:41,791 INFO L82 PathProgramCache]: Analyzing trace with hash 2038353598, now seen corresponding path program 1 times [2021-01-06 16:34:41,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:34:41,792 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533640413] [2021-01-06 16:34:41,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:34:41,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:34:42,115 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 38 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-06 16:34:42,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533640413] [2021-01-06 16:34:42,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029907683] [2021-01-06 16:34:42,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:34:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 16:34:42,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 29 conjunts are in the unsatisfiable core [2021-01-06 16:34:42,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 16:34:42,290 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-06 16:34:42,291 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:34:42,293 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:34:42,293 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:34:42,294 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-01-06 16:34:42,310 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:34:42,311 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2021-01-06 16:34:42,313 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 16:34:42,315 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:34:42,317 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:34:42,318 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:34:42,318 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-01-06 16:34:42,354 INFO L348 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-01-06 16:34:42,354 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2021-01-06 16:34:42,356 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:34:42,363 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:34:42,364 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:34:42,364 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:21 [2021-01-06 16:34:42,410 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_int_22|], 10=[|v_#memory_int_24|]} [2021-01-06 16:34:42,416 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-06 16:34:42,437 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:34:42,575 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 23 [2021-01-06 16:34:42,576 INFO L348 Elim1Store]: treesize reduction 288, result has 10.8 percent of original size [2021-01-06 16:34:42,577 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 46 treesize of output 41 [2021-01-06 16:34:42,583 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 16:34:42,601 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:34:42,608 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:34:42,608 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:21 [2021-01-06 16:34:42,637 INFO L348 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2021-01-06 16:34:42,638 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2021-01-06 16:34:42,640 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 16:34:42,648 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 16:34:42,649 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 16:34:42,650 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:17 [2021-01-06 16:34:42,770 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-01-06 16:34:42,771 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 16:34:42,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 19 [2021-01-06 16:34:42,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65587000] [2021-01-06 16:34:42,772 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-01-06 16:34:42,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 16:34:42,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-01-06 16:34:42,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2021-01-06 16:34:42,773 INFO L87 Difference]: Start difference. First operand 56 states and 73 transitions. Second operand 19 states. [2021-01-06 16:34:43,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 16:34:43,787 INFO L93 Difference]: Finished difference Result 86 states and 115 transitions. [2021-01-06 16:34:43,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-06 16:34:43,788 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2021-01-06 16:34:43,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 16:34:43,790 INFO L225 Difference]: With dead ends: 86 [2021-01-06 16:34:43,790 INFO L226 Difference]: Without dead ends: 73 [2021-01-06 16:34:43,791 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=177, Invalid=635, Unknown=0, NotChecked=0, Total=812 [2021-01-06 16:34:43,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-01-06 16:34:43,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 58. [2021-01-06 16:34:43,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2021-01-06 16:34:43,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 75 transitions. [2021-01-06 16:34:43,798 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 75 transitions. Word has length 47 [2021-01-06 16:34:43,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 16:34:43,799 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 75 transitions. [2021-01-06 16:34:43,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-01-06 16:34:43,799 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 75 transitions. [2021-01-06 16:34:43,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-01-06 16:34:43,800 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 16:34:43,800 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 16:34:44,014 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 16:34:44,015 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 16:34:44,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 16:34:44,016 INFO L82 PathProgramCache]: Analyzing trace with hash 2038355520, now seen corresponding path program 1 times [2021-01-06 16:34:44,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 16:34:44,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739851962] [2021-01-06 16:34:44,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 16:34:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 16:34:44,107 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 16:34:44,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 16:34:44,166 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 16:34:44,206 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 16:34:44,206 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 16:34:44,207 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 16:34:44,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 04:34:44 BoogieIcfgContainer [2021-01-06 16:34:44,295 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 16:34:44,296 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 16:34:44,296 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 16:34:44,296 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 16:34:44,297 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 04:34:36" (3/4) ... [2021-01-06 16:34:44,299 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-01-06 16:34:44,381 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/list-ext3-properties/dll_nullified-1.i-witness.graphml [2021-01-06 16:34:44,382 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 16:34:44,383 INFO L168 Benchmark]: Toolchain (without parser) took 9445.91 ms. Allocated memory was 151.0 MB in the beginning and 228.6 MB in the end (delta: 77.6 MB). Free memory was 125.3 MB in the beginning and 90.8 MB in the end (delta: 34.5 MB). Peak memory consumption was 112.9 MB. Max. memory is 8.0 GB. [2021-01-06 16:34:44,383 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 151.0 MB. Free memory is still 123.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 16:34:44,384 INFO L168 Benchmark]: CACSL2BoogieTranslator took 628.18 ms. Allocated memory is still 151.0 MB. Free memory was 125.3 MB in the beginning and 103.0 MB in the end (delta: 22.3 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. [2021-01-06 16:34:44,384 INFO L168 Benchmark]: Boogie Procedure Inliner took 105.36 ms. Allocated memory is still 151.0 MB. Free memory was 103.0 MB in the beginning and 101.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 16:34:44,385 INFO L168 Benchmark]: Boogie Preprocessor took 72.53 ms. Allocated memory is still 151.0 MB. Free memory was 101.0 MB in the beginning and 99.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-01-06 16:34:44,385 INFO L168 Benchmark]: RCFGBuilder took 685.03 ms. Allocated memory is still 151.0 MB. Free memory was 99.4 MB in the beginning and 129.5 MB in the end (delta: -30.1 MB). Peak memory consumption was 21.3 MB. Max. memory is 8.0 GB. [2021-01-06 16:34:44,386 INFO L168 Benchmark]: TraceAbstraction took 7856.37 ms. Allocated memory was 151.0 MB in the beginning and 228.6 MB in the end (delta: 77.6 MB). Free memory was 128.9 MB in the beginning and 95.5 MB in the end (delta: 33.4 MB). Peak memory consumption was 112.6 MB. Max. memory is 8.0 GB. [2021-01-06 16:34:44,386 INFO L168 Benchmark]: Witness Printer took 85.69 ms. Allocated memory is still 228.6 MB. Free memory was 95.0 MB in the beginning and 90.8 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2021-01-06 16:34:44,390 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 151.0 MB. Free memory is still 123.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 628.18 ms. Allocated memory is still 151.0 MB. Free memory was 125.3 MB in the beginning and 103.0 MB in the end (delta: 22.3 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 105.36 ms. Allocated memory is still 151.0 MB. Free memory was 103.0 MB in the beginning and 101.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 72.53 ms. Allocated memory is still 151.0 MB. Free memory was 101.0 MB in the beginning and 99.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 685.03 ms. Allocated memory is still 151.0 MB. Free memory was 99.4 MB in the beginning and 129.5 MB in the end (delta: -30.1 MB). Peak memory consumption was 21.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 7856.37 ms. Allocated memory was 151.0 MB in the beginning and 228.6 MB in the end (delta: 77.6 MB). Free memory was 128.9 MB in the beginning and 95.5 MB in the end (delta: 33.4 MB). Peak memory consumption was 112.6 MB. Max. memory is 8.0 GB. * Witness Printer took 85.69 ms. Allocated memory is still 228.6 MB. Free memory was 95.0 MB in the beginning and 90.8 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 616]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L599] const int len = 5; [L579] DLL head = ((void *)0); [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] new_head->next = head [L589] new_head->prev = ((void *)0) [L590] COND FALSE !(\read(head)) [L593] head = new_head [L594] len-- [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] new_head->next = head [L589] new_head->prev = ((void *)0) [L590] COND TRUE \read(head) [L591] head->prev = new_head [L593] head = new_head [L594] len-- [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] new_head->next = head [L589] new_head->prev = ((void *)0) [L590] COND TRUE \read(head) [L591] head->prev = new_head [L593] head = new_head [L594] len-- [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] new_head->next = head [L589] new_head->prev = ((void *)0) [L590] COND TRUE \read(head) [L591] head->prev = new_head [L593] head = new_head [L594] len-- [L580] COND TRUE len > 0 [L581] DLL new_head = (DLL) malloc(sizeof(struct node)); [L582] COND FALSE !(((void *)0) == new_head) [L585] new_head->data_0 = 0 [L586] new_head->data_1 = 0 [L587] EXPR __VERIFIER_nondet_int() == len? 1 : 0 [L587] new_head->data_2 = __VERIFIER_nondet_int() == len? 1 : 0 [L588] new_head->next = head [L589] new_head->prev = ((void *)0) [L590] COND TRUE \read(head) [L591] head->prev = new_head [L593] head = new_head [L594] len-- [L580] COND FALSE !(len > 0) [L596] return head; [L600] DLL head = dll_create(len); [L601] head->next [L601] COND TRUE head->next [L602] EXPR head->data_0 [L602] EXPR 0 != head->data_0 || 0 != head->data_1 [L602] EXPR head->data_1 [L602] EXPR 0 != head->data_0 || 0 != head->data_1 [L602] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L602] EXPR head->data_2 [L602] 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L602] COND TRUE 0 != head->data_0 || 0 != head->data_1 || 0 != head->data_2 [L616] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.7s, OverallIterations: 9, TraceHistogramMax: 5, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 217 SDtfs, 710 SDslu, 537 SDs, 0 SdLazy, 586 SolverSat, 165 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 244 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 57 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 420 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 360 ConstructedInterpolants, 0 QuantifiedInterpolants, 44999 SizeOfPredicates, 37 NumberOfNonLiveVariables, 862 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 158/311 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...