./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5317dae Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bec73cbd355af8995620266d1bb50e13212a1740ed8bd583620b6985b8fd569c --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 00:44:11,122 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 00:44:11,124 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 00:44:11,153 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 00:44:11,153 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 00:44:11,155 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 00:44:11,157 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 00:44:11,158 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 00:44:11,160 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 00:44:11,163 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 00:44:11,164 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 00:44:11,165 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 00:44:11,165 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 00:44:11,166 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 00:44:11,167 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 00:44:11,168 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 00:44:11,169 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 00:44:11,170 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 00:44:11,171 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 00:44:11,174 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 00:44:11,175 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 00:44:11,176 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 00:44:11,177 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 00:44:11,177 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 00:44:11,183 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 00:44:11,184 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 00:44:11,184 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 00:44:11,184 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 00:44:11,185 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 00:44:11,186 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 00:44:11,186 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 00:44:11,186 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 00:44:11,187 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 00:44:11,189 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 00:44:11,189 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 00:44:11,190 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 00:44:11,190 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 00:44:11,190 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 00:44:11,190 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 00:44:11,191 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 00:44:11,192 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 00:44:11,193 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-16 00:44:11,215 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 00:44:11,215 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 00:44:11,216 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 00:44:11,216 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 00:44:11,216 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 00:44:11,217 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 00:44:11,217 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 00:44:11,217 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 00:44:11,217 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 00:44:11,218 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 00:44:11,218 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 00:44:11,218 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 00:44:11,218 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 00:44:11,219 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 00:44:11,219 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 00:44:11,219 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 00:44:11,219 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 00:44:11,219 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 00:44:11,219 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 00:44:11,219 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 00:44:11,220 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 00:44:11,220 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 00:44:11,220 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 00:44:11,220 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 00:44:11,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:44:11,220 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 00:44:11,220 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 00:44:11,221 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 00:44:11,221 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 00:44:11,221 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 00:44:11,221 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 00:44:11,221 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 00:44:11,221 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 00:44:11,222 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 00:44:11,222 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 00:44:11,222 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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/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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bec73cbd355af8995620266d1bb50e13212a1740ed8bd583620b6985b8fd569c [2023-02-16 00:44:11,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 00:44:11,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 00:44:11,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 00:44:11,467 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 00:44:11,467 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 00:44:11,468 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2023-02-16 00:44:12,375 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 00:44:12,536 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 00:44:12,536 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2023-02-16 00:44:12,540 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a326660d2/dfa16ff020b1493b951a7e9782a1d297/FLAG364d344ba [2023-02-16 00:44:12,554 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a326660d2/dfa16ff020b1493b951a7e9782a1d297 [2023-02-16 00:44:12,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 00:44:12,557 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 00:44:12,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 00:44:12,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 00:44:12,562 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 00:44:12,562 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:44:12" (1/1) ... [2023-02-16 00:44:12,563 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cdb808b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:44:12, skipping insertion in model container [2023-02-16 00:44:12,563 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:44:12" (1/1) ... [2023-02-16 00:44:12,568 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 00:44:12,578 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 00:44:12,660 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c[387,400] [2023-02-16 00:44:12,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:44:12,675 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 00:44:12,684 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c[387,400] [2023-02-16 00:44:12,697 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:44:12,705 INFO L208 MainTranslator]: Completed translation [2023-02-16 00:44:12,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:44:12 WrapperNode [2023-02-16 00:44:12,706 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 00:44:12,707 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 00:44:12,707 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 00:44:12,707 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 00:44:12,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:44:12" (1/1) ... [2023-02-16 00:44:12,716 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:44:12" (1/1) ... [2023-02-16 00:44:12,727 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 59 [2023-02-16 00:44:12,727 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 00:44:12,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 00:44:12,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 00:44:12,727 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 00:44:12,733 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:44:12" (1/1) ... [2023-02-16 00:44:12,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:44:12" (1/1) ... [2023-02-16 00:44:12,740 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:44:12" (1/1) ... [2023-02-16 00:44:12,740 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:44:12" (1/1) ... [2023-02-16 00:44:12,756 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:44:12" (1/1) ... [2023-02-16 00:44:12,764 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:44:12" (1/1) ... [2023-02-16 00:44:12,777 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:44:12" (1/1) ... [2023-02-16 00:44:12,777 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:44:12" (1/1) ... [2023-02-16 00:44:12,779 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 00:44:12,782 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 00:44:12,782 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 00:44:12,783 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 00:44:12,783 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:44:12" (1/1) ... [2023-02-16 00:44:12,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:44:12,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:44:12,814 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-16 00:44:12,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-16 00:44:12,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 00:44:12,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 00:44:12,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-16 00:44:12,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-16 00:44:12,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 00:44:12,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 00:44:12,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-16 00:44:12,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 00:44:12,892 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 00:44:12,893 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 00:44:13,008 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 00:44:13,011 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 00:44:13,011 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-16 00:44:13,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:44:13 BoogieIcfgContainer [2023-02-16 00:44:13,012 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 00:44:13,014 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 00:44:13,014 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 00:44:13,015 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 00:44:13,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 12:44:12" (1/3) ... [2023-02-16 00:44:13,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70444aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:44:13, skipping insertion in model container [2023-02-16 00:44:13,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:44:12" (2/3) ... [2023-02-16 00:44:13,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70444aa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:44:13, skipping insertion in model container [2023-02-16 00:44:13,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:44:13" (3/3) ... [2023-02-16 00:44:13,017 INFO L112 eAbstractionObserver]: Analyzing ICFG verisec_sendmail_tTflag_arr_one_loop.c [2023-02-16 00:44:13,029 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 00:44:13,029 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-16 00:44:13,071 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 00:44:13,076 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1376408b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 00:44:13,077 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-16 00:44:13,079 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:44:13,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-16 00:44:13,083 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:44:13,083 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:44:13,084 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:44:13,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:44:13,088 INFO L85 PathProgramCache]: Analyzing trace with hash 212076531, now seen corresponding path program 1 times [2023-02-16 00:44:13,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:44:13,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693033537] [2023-02-16 00:44:13,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:44:13,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:44:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:44:13,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:44:13,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:44:13,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693033537] [2023-02-16 00:44:13,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693033537] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:44:13,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:44:13,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:44:13,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261574429] [2023-02-16 00:44:13,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:44:13,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:44:13,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:44:13,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:44:13,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:44:13,336 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:44:13,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:44:13,368 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2023-02-16 00:44:13,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:44:13,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-16 00:44:13,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:44:13,381 INFO L225 Difference]: With dead ends: 35 [2023-02-16 00:44:13,381 INFO L226 Difference]: Without dead ends: 17 [2023-02-16 00:44:13,382 INFO L412 NwaCegarLoop]: 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 [2023-02-16 00:44:13,384 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:44:13,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 19 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:44:13,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-02-16 00:44:13,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 11. [2023-02-16 00:44:13,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:44:13,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2023-02-16 00:44:13,410 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2023-02-16 00:44:13,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:44:13,410 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2023-02-16 00:44:13,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:44:13,411 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2023-02-16 00:44:13,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-16 00:44:13,411 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:44:13,411 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:44:13,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 00:44:13,411 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:44:13,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:44:13,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1435974389, now seen corresponding path program 1 times [2023-02-16 00:44:13,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:44:13,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63022504] [2023-02-16 00:44:13,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:44:13,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:44:13,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:44:13,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:44:13,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:44:13,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63022504] [2023-02-16 00:44:13,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63022504] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:44:13,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190515091] [2023-02-16 00:44:13,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:44:13,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:44:13,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:44:13,493 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:44:13,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-16 00:44:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:44:13,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 00:44:13,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:44:13,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:44:13,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:44:13,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:44:13,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190515091] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:44:13,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:44:13,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-02-16 00:44:13,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506052060] [2023-02-16 00:44:13,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:44:13,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 00:44:13,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:44:13,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 00:44:13,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-02-16 00:44:13,585 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:44:13,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:44:13,630 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2023-02-16 00:44:13,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 00:44:13,630 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-16 00:44:13,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:44:13,631 INFO L225 Difference]: With dead ends: 33 [2023-02-16 00:44:13,631 INFO L226 Difference]: Without dead ends: 27 [2023-02-16 00:44:13,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-02-16 00:44:13,632 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 26 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:44:13,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 14 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:44:13,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-16 00:44:13,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2023-02-16 00:44:13,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:44:13,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2023-02-16 00:44:13,636 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 10 [2023-02-16 00:44:13,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:44:13,636 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2023-02-16 00:44:13,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:44:13,636 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2023-02-16 00:44:13,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-16 00:44:13,637 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:44:13,637 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:44:13,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-16 00:44:13,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:44:13,841 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:44:13,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:44:13,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1662320891, now seen corresponding path program 2 times [2023-02-16 00:44:13,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:44:13,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142933014] [2023-02-16 00:44:13,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:44:13,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:44:13,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:44:14,020 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-16 00:44:14,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:44:14,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142933014] [2023-02-16 00:44:14,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142933014] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:44:14,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:44:14,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 00:44:14,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069600004] [2023-02-16 00:44:14,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:44:14,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 00:44:14,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:44:14,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 00:44:14,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 00:44:14,035 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:44:14,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:44:14,053 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2023-02-16 00:44:14,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 00:44:14,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-16 00:44:14,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:44:14,054 INFO L225 Difference]: With dead ends: 22 [2023-02-16 00:44:14,054 INFO L226 Difference]: Without dead ends: 18 [2023-02-16 00:44:14,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-16 00:44:14,055 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 3 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:44:14,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 15 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:44:14,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-02-16 00:44:14,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-02-16 00:44:14,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:44:14,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2023-02-16 00:44:14,058 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2023-02-16 00:44:14,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:44:14,058 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2023-02-16 00:44:14,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:44:14,058 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2023-02-16 00:44:14,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 00:44:14,058 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:44:14,058 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:44:14,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-16 00:44:14,059 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:44:14,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:44:14,059 INFO L85 PathProgramCache]: Analyzing trace with hash -5994546, now seen corresponding path program 1 times [2023-02-16 00:44:14,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:44:14,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159212581] [2023-02-16 00:44:14,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:44:14,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:44:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:44:14,224 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:44:14,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:44:14,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159212581] [2023-02-16 00:44:14,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159212581] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:44:14,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351883338] [2023-02-16 00:44:14,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:44:14,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:44:14,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:44:14,229 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:44:14,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-16 00:44:14,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:44:14,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 00:44:14,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:44:14,321 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:44:14,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:44:14,369 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:44:14,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351883338] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:44:14,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:44:14,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-02-16 00:44:14,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109970317] [2023-02-16 00:44:14,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:44:14,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-16 00:44:14,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:44:14,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-16 00:44:14,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-02-16 00:44:14,371 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:44:14,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:44:14,403 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2023-02-16 00:44:14,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-16 00:44:14,403 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-16 00:44:14,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:44:14,404 INFO L225 Difference]: With dead ends: 42 [2023-02-16 00:44:14,404 INFO L226 Difference]: Without dead ends: 35 [2023-02-16 00:44:14,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-02-16 00:44:14,405 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 6 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:44:14,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 26 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:44:14,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-02-16 00:44:14,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2023-02-16 00:44:14,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:44:14,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2023-02-16 00:44:14,409 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 17 [2023-02-16 00:44:14,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:44:14,409 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2023-02-16 00:44:14,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:44:14,409 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2023-02-16 00:44:14,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-16 00:44:14,410 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:44:14,410 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:44:14,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-16 00:44:14,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-02-16 00:44:14,616 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:44:14,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:44:14,618 INFO L85 PathProgramCache]: Analyzing trace with hash 776585922, now seen corresponding path program 2 times [2023-02-16 00:44:14,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:44:14,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432976651] [2023-02-16 00:44:14,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:44:14,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:44:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:44:14,874 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:44:14,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:44:14,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432976651] [2023-02-16 00:44:14,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432976651] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:44:14,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611026445] [2023-02-16 00:44:14,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 00:44:14,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:44:14,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:44:14,876 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:44:14,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-16 00:44:14,930 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 00:44:14,931 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:44:14,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-16 00:44:14,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:44:14,965 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:44:14,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:44:15,040 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:44:15,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611026445] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:44:15,041 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:44:15,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 14 [2023-02-16 00:44:15,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667708185] [2023-02-16 00:44:15,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:44:15,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 00:44:15,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:44:15,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 00:44:15,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2023-02-16 00:44:15,043 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:44:15,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:44:15,072 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2023-02-16 00:44:15,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-16 00:44:15,072 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-02-16 00:44:15,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:44:15,073 INFO L225 Difference]: With dead ends: 44 [2023-02-16 00:44:15,073 INFO L226 Difference]: Without dead ends: 37 [2023-02-16 00:44:15,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 11 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2023-02-16 00:44:15,074 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 9 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:44:15,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 15 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:44:15,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-02-16 00:44:15,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2023-02-16 00:44:15,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:44:15,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2023-02-16 00:44:15,077 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 29 [2023-02-16 00:44:15,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:44:15,078 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2023-02-16 00:44:15,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:44:15,078 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2023-02-16 00:44:15,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-16 00:44:15,079 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:44:15,079 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:44:15,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-16 00:44:15,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:44:15,285 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:44:15,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:44:15,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1133517568, now seen corresponding path program 3 times [2023-02-16 00:44:15,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:44:15,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402450717] [2023-02-16 00:44:15,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:44:15,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:44:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:44:15,419 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2023-02-16 00:44:15,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:44:15,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402450717] [2023-02-16 00:44:15,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402450717] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:44:15,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317999725] [2023-02-16 00:44:15,420 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 00:44:15,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:44:15,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:44:15,433 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:44:15,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-16 00:44:15,504 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-02-16 00:44:15,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:44:15,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-16 00:44:15,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:44:15,680 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2023-02-16 00:44:15,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:44:15,779 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2023-02-16 00:44:15,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317999725] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:44:15,780 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 00:44:15,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2023-02-16 00:44:15,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145767700] [2023-02-16 00:44:15,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 00:44:15,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 00:44:15,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 00:44:15,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 00:44:15,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-16 00:44:15,782 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:44:15,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:44:15,820 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2023-02-16 00:44:15,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 00:44:15,821 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-02-16 00:44:15,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:44:15,821 INFO L225 Difference]: With dead ends: 40 [2023-02-16 00:44:15,821 INFO L226 Difference]: Without dead ends: 34 [2023-02-16 00:44:15,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-02-16 00:44:15,822 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 9 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:44:15,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 28 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:44:15,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-16 00:44:15,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-02-16 00:44:15,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:44:15,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2023-02-16 00:44:15,837 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 31 [2023-02-16 00:44:15,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:44:15,837 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2023-02-16 00:44:15,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:44:15,838 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2023-02-16 00:44:15,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-16 00:44:15,838 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:44:15,838 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:44:15,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-16 00:44:16,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:44:16,039 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:44:16,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:44:16,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1664602656, now seen corresponding path program 4 times [2023-02-16 00:44:16,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 00:44:16,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684484455] [2023-02-16 00:44:16,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:44:16,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 00:44:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:44:16,422 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2023-02-16 00:44:16,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 00:44:16,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684484455] [2023-02-16 00:44:16,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684484455] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 00:44:16,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482578024] [2023-02-16 00:44:16,422 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-16 00:44:16,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:44:16,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:44:16,426 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 00:44:16,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-16 00:44:16,796 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-16 00:44:16,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:44:16,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-16 00:44:16,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:44:17,304 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-02-16 00:44:17,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:44:39,829 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2023-02-16 00:44:39,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-16 00:44:40,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 00:44:40,034 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Possible infinite loop detected |aux_div_aux_mod_aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~c~0#1_38_49_60_129_127| already exists at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.tryToHandleDivModSubterm(SolveForSubjectUtils.java:199) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.findTreatableDivModSubterm(SolveForSubjectUtils.java:594) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.findTreatableDivModSubterm(SolveForSubjectUtils.java:582) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.findTreatableDivModSubterm(SolveForSubjectUtils.java:582) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.solveForSubject(SolveForSubjectUtils.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.PolynomialRelation.solveForSubject(PolynomialRelation.java:509) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:423) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer$IDerHelper.findBestReplacementSbr(DualJunctionDer.java:312) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer$IDerHelper.tryToEliminateSbr(DualJunctionDer.java:328) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryToEliminateOne(DualJunctionDer.java:235) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryExhaustivelyToEliminate(DualJunctionDer.java:202) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryToEliminateOne(DualJunctionDer.java:186) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryExhaustivelyToEliminate(DualJunctionDer.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDer.tryToEliminate(DualJunctionDer.java:131) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:627) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:606) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:528) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:332) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-02-16 00:44:40,039 INFO L158 Benchmark]: Toolchain (without parser) took 27481.91ms. Allocated memory was 123.7MB in the beginning and 190.8MB in the end (delta: 67.1MB). Free memory was 82.2MB in the beginning and 159.5MB in the end (delta: -77.3MB). Peak memory consumption was 95.8MB. Max. memory is 16.1GB. [2023-02-16 00:44:40,039 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 102.8MB. Free memory is still 76.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 00:44:40,040 INFO L158 Benchmark]: CACSL2BoogieTranslator took 146.82ms. Allocated memory is still 123.7MB. Free memory was 82.2MB in the beginning and 71.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-16 00:44:40,040 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.31ms. Allocated memory is still 123.7MB. Free memory was 71.8MB in the beginning and 70.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 00:44:40,040 INFO L158 Benchmark]: Boogie Preprocessor took 54.47ms. Allocated memory is still 123.7MB. Free memory was 70.5MB in the beginning and 97.2MB in the end (delta: -26.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-16 00:44:40,040 INFO L158 Benchmark]: RCFGBuilder took 230.18ms. Allocated memory is still 123.7MB. Free memory was 97.2MB in the beginning and 87.0MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-16 00:44:40,040 INFO L158 Benchmark]: TraceAbstraction took 27025.33ms. Allocated memory was 123.7MB in the beginning and 190.8MB in the end (delta: 67.1MB). Free memory was 86.4MB in the beginning and 159.5MB in the end (delta: -73.1MB). Peak memory consumption was 103.3MB. Max. memory is 16.1GB. [2023-02-16 00:44:40,041 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.13ms. Allocated memory is still 102.8MB. Free memory is still 76.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 146.82ms. Allocated memory is still 123.7MB. Free memory was 82.2MB in the beginning and 71.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.31ms. Allocated memory is still 123.7MB. Free memory was 71.8MB in the beginning and 70.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.47ms. Allocated memory is still 123.7MB. Free memory was 70.5MB in the beginning and 97.2MB in the end (delta: -26.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 230.18ms. Allocated memory is still 123.7MB. Free memory was 97.2MB in the beginning and 87.0MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 27025.33ms. Allocated memory was 123.7MB in the beginning and 190.8MB in the end (delta: 67.1MB). Free memory was 86.4MB in the beginning and 159.5MB in the end (delta: -73.1MB). Peak memory consumption was 103.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Possible infinite loop detected |aux_div_aux_mod_aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~c~0#1_38_49_60_129_127| already exists de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Possible infinite loop detected |aux_div_aux_mod_aux_mod_aux_mod_aux_mod_ULTIMATE.start_main_~c~0#1_38_49_60_129_127| already exists: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.SolveForSubjectUtils.tryToHandleDivModSubterm(SolveForSubjectUtils.java:199) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-02-16 00:44:40,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bec73cbd355af8995620266d1bb50e13212a1740ed8bd583620b6985b8fd569c --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 00:44:41,768 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 00:44:41,770 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 00:44:41,802 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 00:44:41,803 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 00:44:41,806 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 00:44:41,807 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 00:44:41,809 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 00:44:41,812 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 00:44:41,816 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 00:44:41,817 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 00:44:41,818 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 00:44:41,819 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 00:44:41,820 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 00:44:41,821 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 00:44:41,823 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 00:44:41,824 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 00:44:41,825 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 00:44:41,826 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 00:44:41,830 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 00:44:41,830 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 00:44:41,831 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 00:44:41,832 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 00:44:41,832 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 00:44:41,837 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 00:44:41,837 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 00:44:41,838 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 00:44:41,839 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 00:44:41,839 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 00:44:41,840 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 00:44:41,840 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 00:44:41,844 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 00:44:41,849 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 00:44:41,850 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 00:44:41,851 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 00:44:41,851 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 00:44:41,852 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 00:44:41,852 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 00:44:41,852 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 00:44:41,853 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 00:44:41,853 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 00:44:41,854 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-02-16 00:44:41,880 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 00:44:41,880 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 00:44:41,881 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 00:44:41,881 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 00:44:41,882 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 00:44:41,882 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 00:44:41,882 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 00:44:41,882 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 00:44:41,882 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 00:44:41,883 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 00:44:41,883 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 00:44:41,883 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 00:44:41,884 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 00:44:41,884 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 00:44:41,884 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 00:44:41,884 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 00:44:41,884 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 00:44:41,884 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-16 00:44:41,884 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-16 00:44:41,885 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 00:44:41,885 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 00:44:41,885 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 00:44:41,885 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 00:44:41,885 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 00:44:41,885 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 00:44:41,886 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 00:44:41,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:44:41,886 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 00:44:41,886 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 00:44:41,886 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 00:44:41,887 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-16 00:44:41,887 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-16 00:44:41,887 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 00:44:41,887 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 00:44:41,887 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 00:44:41,887 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 00:44:41,888 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-16 00:44:41,888 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 00:44:41,888 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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/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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bec73cbd355af8995620266d1bb50e13212a1740ed8bd583620b6985b8fd569c [2023-02-16 00:44:42,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 00:44:42,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 00:44:42,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 00:44:42,136 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 00:44:42,136 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 00:44:42,137 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2023-02-16 00:44:43,159 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 00:44:43,321 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 00:44:43,322 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2023-02-16 00:44:43,326 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ceff438c5/5eaf8dced85f4f1f8014f4d6bc25843c/FLAGe182ff313 [2023-02-16 00:44:43,335 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ceff438c5/5eaf8dced85f4f1f8014f4d6bc25843c [2023-02-16 00:44:43,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 00:44:43,337 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 00:44:43,340 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 00:44:43,340 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 00:44:43,342 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 00:44:43,343 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:44:43" (1/1) ... [2023-02-16 00:44:43,344 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2050b059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:44:43, skipping insertion in model container [2023-02-16 00:44:43,344 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 12:44:43" (1/1) ... [2023-02-16 00:44:43,348 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 00:44:43,363 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 00:44:43,447 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c[387,400] [2023-02-16 00:44:43,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:44:43,467 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 00:44:43,474 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c[387,400] [2023-02-16 00:44:43,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 00:44:43,486 INFO L208 MainTranslator]: Completed translation [2023-02-16 00:44:43,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:44:43 WrapperNode [2023-02-16 00:44:43,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 00:44:43,488 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 00:44:43,488 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 00:44:43,488 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 00:44:43,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:44:43" (1/1) ... [2023-02-16 00:44:43,497 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:44:43" (1/1) ... [2023-02-16 00:44:43,511 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2023-02-16 00:44:43,511 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 00:44:43,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 00:44:43,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 00:44:43,512 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 00:44:43,517 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:44:43" (1/1) ... [2023-02-16 00:44:43,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:44:43" (1/1) ... [2023-02-16 00:44:43,528 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:44:43" (1/1) ... [2023-02-16 00:44:43,528 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:44:43" (1/1) ... [2023-02-16 00:44:43,532 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:44:43" (1/1) ... [2023-02-16 00:44:43,538 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:44:43" (1/1) ... [2023-02-16 00:44:43,539 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:44:43" (1/1) ... [2023-02-16 00:44:43,540 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:44:43" (1/1) ... [2023-02-16 00:44:43,543 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 00:44:43,543 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 00:44:43,543 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 00:44:43,544 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 00:44:43,544 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:44:43" (1/1) ... [2023-02-16 00:44:43,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 00:44:43,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 00:44:43,562 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-16 00:44:43,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-16 00:44:43,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 00:44:43,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-02-16 00:44:43,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-16 00:44:43,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-16 00:44:43,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 00:44:43,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 00:44:43,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-02-16 00:44:43,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 00:44:43,667 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 00:44:43,668 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 00:44:43,798 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 00:44:43,802 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 00:44:43,802 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-16 00:44:43,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:44:43 BoogieIcfgContainer [2023-02-16 00:44:43,803 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 00:44:43,804 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 00:44:43,804 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 00:44:43,806 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 00:44:43,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 12:44:43" (1/3) ... [2023-02-16 00:44:43,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b6fb29d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:44:43, skipping insertion in model container [2023-02-16 00:44:43,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 12:44:43" (2/3) ... [2023-02-16 00:44:43,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b6fb29d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 12:44:43, skipping insertion in model container [2023-02-16 00:44:43,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:44:43" (3/3) ... [2023-02-16 00:44:43,808 INFO L112 eAbstractionObserver]: Analyzing ICFG verisec_sendmail_tTflag_arr_one_loop.c [2023-02-16 00:44:43,822 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 00:44:43,822 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-16 00:44:43,859 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 00:44:43,863 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@10eec988, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 00:44:43,863 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-16 00:44:43,867 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:44:43,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-16 00:44:43,873 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:44:43,874 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:44:43,874 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:44:43,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:44:43,878 INFO L85 PathProgramCache]: Analyzing trace with hash 212076531, now seen corresponding path program 1 times [2023-02-16 00:44:43,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:44:43,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1390823467] [2023-02-16 00:44:43,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:44:43,887 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 00:44:43,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:44:43,890 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 00:44:43,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-16 00:44:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:44:43,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 00:44:43,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:44:43,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:44:43,987 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 00:44:43,987 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:44:43,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1390823467] [2023-02-16 00:44:43,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1390823467] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:44:43,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:44:43,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 00:44:43,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75280952] [2023-02-16 00:44:43,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:44:43,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 00:44:43,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:44:44,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 00:44:44,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:44:44,025 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:44:44,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:44:44,049 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2023-02-16 00:44:44,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 00:44:44,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-16 00:44:44,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:44:44,055 INFO L225 Difference]: With dead ends: 35 [2023-02-16 00:44:44,055 INFO L226 Difference]: Without dead ends: 17 [2023-02-16 00:44:44,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 00:44:44,059 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:44:44,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 19 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:44:44,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-02-16 00:44:44,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 11. [2023-02-16 00:44:44,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:44:44,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2023-02-16 00:44:44,077 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2023-02-16 00:44:44,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:44:44,077 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2023-02-16 00:44:44,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:44:44,078 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2023-02-16 00:44:44,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-16 00:44:44,078 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:44:44,078 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:44:44,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-16 00:44:44,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 00:44:44,285 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:44:44,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:44:44,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1435974389, now seen corresponding path program 1 times [2023-02-16 00:44:44,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:44:44,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [168974260] [2023-02-16 00:44:44,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:44:44,287 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 00:44:44,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:44:44,288 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 00:44:44,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-16 00:44:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:44:44,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 00:44:44,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:44:44,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:44:44,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:44:44,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 00:44:44,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:44:44,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [168974260] [2023-02-16 00:44:44,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [168974260] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:44:44,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:44:44,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-02-16 00:44:44,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745345059] [2023-02-16 00:44:44,413 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:44:44,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 00:44:44,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:44:44,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 00:44:44,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-16 00:44:44,414 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:44:44,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:44:44,473 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2023-02-16 00:44:44,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 00:44:44,474 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-16 00:44:44,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:44:44,475 INFO L225 Difference]: With dead ends: 33 [2023-02-16 00:44:44,475 INFO L226 Difference]: Without dead ends: 27 [2023-02-16 00:44:44,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-02-16 00:44:44,476 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 19 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:44:44,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 22 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:44:44,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-02-16 00:44:44,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2023-02-16 00:44:44,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:44:44,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2023-02-16 00:44:44,480 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 10 [2023-02-16 00:44:44,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:44:44,480 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2023-02-16 00:44:44,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:44:44,480 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2023-02-16 00:44:44,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-16 00:44:44,481 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:44:44,481 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:44:44,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-02-16 00:44:44,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 00:44:44,688 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:44:44,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:44:44,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1662320891, now seen corresponding path program 2 times [2023-02-16 00:44:44,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:44:44,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2029098078] [2023-02-16 00:44:44,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 00:44:44,698 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 00:44:44,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:44:44,701 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 00:44:44,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-16 00:44:44,750 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-16 00:44:44,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:44:44,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 00:44:44,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:44:44,782 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-16 00:44:44,782 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 00:44:44,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:44:44,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2029098078] [2023-02-16 00:44:44,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2029098078] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 00:44:44,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 00:44:44,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 00:44:44,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671327143] [2023-02-16 00:44:44,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 00:44:44,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 00:44:44,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:44:44,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 00:44:44,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 00:44:44,785 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:44:44,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:44:44,810 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2023-02-16 00:44:44,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 00:44:44,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-16 00:44:44,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:44:44,813 INFO L225 Difference]: With dead ends: 22 [2023-02-16 00:44:44,813 INFO L226 Difference]: Without dead ends: 18 [2023-02-16 00:44:44,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-16 00:44:44,814 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:44:44,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 17 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 00:44:44,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-02-16 00:44:44,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-02-16 00:44:44,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:44:44,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2023-02-16 00:44:44,820 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2023-02-16 00:44:44,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:44:44,820 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2023-02-16 00:44:44,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:44:44,821 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2023-02-16 00:44:44,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 00:44:44,822 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:44:44,822 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:44:44,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-16 00:44:45,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 00:44:45,029 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:44:45,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:44:45,033 INFO L85 PathProgramCache]: Analyzing trace with hash -5994546, now seen corresponding path program 1 times [2023-02-16 00:44:45,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:44:45,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [793013303] [2023-02-16 00:44:45,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 00:44:45,034 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 00:44:45,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:44:45,035 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 00:44:45,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-16 00:44:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 00:44:45,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 00:44:45,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:44:45,169 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:44:45,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:44:45,243 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:44:45,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:44:45,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [793013303] [2023-02-16 00:44:45,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [793013303] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:44:45,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:44:45,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-02-16 00:44:45,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078237778] [2023-02-16 00:44:45,245 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:44:45,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 00:44:45,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:44:45,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 00:44:45,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-02-16 00:44:45,246 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:44:45,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:44:45,430 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2023-02-16 00:44:45,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-16 00:44:45,431 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-16 00:44:45,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:44:45,431 INFO L225 Difference]: With dead ends: 42 [2023-02-16 00:44:45,431 INFO L226 Difference]: Without dead ends: 35 [2023-02-16 00:44:45,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2023-02-16 00:44:45,432 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 14 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:44:45,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 31 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:44:45,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-02-16 00:44:45,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2023-02-16 00:44:45,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:44:45,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2023-02-16 00:44:45,436 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 17 [2023-02-16 00:44:45,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:44:45,436 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2023-02-16 00:44:45,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:44:45,437 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2023-02-16 00:44:45,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-16 00:44:45,437 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:44:45,437 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:44:45,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-16 00:44:45,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 00:44:45,644 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:44:45,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:44:45,644 INFO L85 PathProgramCache]: Analyzing trace with hash 776585922, now seen corresponding path program 2 times [2023-02-16 00:44:45,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:44:45,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1876606453] [2023-02-16 00:44:45,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 00:44:45,645 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 00:44:45,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:44:45,648 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 00:44:45,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-16 00:44:45,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 00:44:45,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:44:45,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-16 00:44:45,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:44:45,824 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:44:45,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:44:46,055 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 00:44:46,055 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:44:46,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1876606453] [2023-02-16 00:44:46,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1876606453] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:44:46,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:44:46,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2023-02-16 00:44:46,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269341265] [2023-02-16 00:44:46,056 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:44:46,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-16 00:44:46,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:44:46,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-16 00:44:46,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2023-02-16 00:44:46,064 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:44:46,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:44:46,296 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2023-02-16 00:44:46,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-16 00:44:46,297 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-02-16 00:44:46,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:44:46,297 INFO L225 Difference]: With dead ends: 45 [2023-02-16 00:44:46,297 INFO L226 Difference]: Without dead ends: 38 [2023-02-16 00:44:46,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2023-02-16 00:44:46,298 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 9 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 00:44:46,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 74 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 00:44:46,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-16 00:44:46,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2023-02-16 00:44:46,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:44:46,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2023-02-16 00:44:46,303 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 29 [2023-02-16 00:44:46,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:44:46,303 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2023-02-16 00:44:46,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:44:46,303 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2023-02-16 00:44:46,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-16 00:44:46,304 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:44:46,304 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:44:46,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-16 00:44:46,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 00:44:46,511 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:44:46,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:44:46,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1133517568, now seen corresponding path program 3 times [2023-02-16 00:44:46,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:44:46,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1659833710] [2023-02-16 00:44:46,512 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 00:44:46,512 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 00:44:46,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:44:46,513 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 00:44:46,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-16 00:44:46,548 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-02-16 00:44:46,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:44:46,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 00:44:46,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:44:46,589 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2023-02-16 00:44:46,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:44:46,625 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2023-02-16 00:44:46,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:44:46,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1659833710] [2023-02-16 00:44:46,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1659833710] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:44:46,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:44:46,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-02-16 00:44:46,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066281525] [2023-02-16 00:44:46,626 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:44:46,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 00:44:46,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:44:46,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 00:44:46,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-16 00:44:46,627 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:44:46,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:44:46,754 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2023-02-16 00:44:46,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 00:44:46,755 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-02-16 00:44:46,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:44:46,755 INFO L225 Difference]: With dead ends: 43 [2023-02-16 00:44:46,755 INFO L226 Difference]: Without dead ends: 35 [2023-02-16 00:44:46,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2023-02-16 00:44:46,756 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 10 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 00:44:46,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 24 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 00:44:46,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-02-16 00:44:46,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-02-16 00:44:46,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:44:46,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2023-02-16 00:44:46,762 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 31 [2023-02-16 00:44:46,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:44:46,762 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2023-02-16 00:44:46,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:44:46,762 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2023-02-16 00:44:46,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-16 00:44:46,763 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:44:46,763 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:44:46,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-16 00:44:46,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 00:44:46,970 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:44:46,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:44:46,970 INFO L85 PathProgramCache]: Analyzing trace with hash 64740169, now seen corresponding path program 4 times [2023-02-16 00:44:46,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:44:46,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1013537004] [2023-02-16 00:44:46,971 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-16 00:44:46,971 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 00:44:46,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:44:46,972 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 00:44:46,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-16 00:44:47,056 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-16 00:44:47,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 00:44:47,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-16 00:44:47,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 00:44:47,547 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2023-02-16 00:44:47,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 00:44:48,910 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2023-02-16 00:44:48,910 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 00:44:48,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1013537004] [2023-02-16 00:44:48,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1013537004] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 00:44:48,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 00:44:48,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-02-16 00:44:48,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428558106] [2023-02-16 00:44:48,911 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 00:44:48,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 00:44:48,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 00:44:48,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 00:44:48,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-02-16 00:44:48,911 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:44:54,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 00:44:54,956 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2023-02-16 00:44:54,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-16 00:44:54,961 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-02-16 00:44:54,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 00:44:54,961 INFO L225 Difference]: With dead ends: 55 [2023-02-16 00:44:54,961 INFO L226 Difference]: Without dead ends: 41 [2023-02-16 00:44:54,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=183, Invalid=369, Unknown=0, NotChecked=0, Total=552 [2023-02-16 00:44:54,962 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 36 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-16 00:44:54,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 44 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-16 00:44:54,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-02-16 00:44:54,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-02-16 00:44:54,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.05) internal successors, (42), 40 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:44:54,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2023-02-16 00:44:54,972 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 34 [2023-02-16 00:44:54,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 00:44:54,972 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2023-02-16 00:44:54,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 00:44:54,972 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2023-02-16 00:44:54,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-16 00:44:54,973 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 00:44:54,973 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 00:44:54,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-02-16 00:44:55,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 00:44:55,182 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 00:44:55,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 00:44:55,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1907904535, now seen corresponding path program 5 times [2023-02-16 00:44:55,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 00:44:55,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1976253920] [2023-02-16 00:44:55,183 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-16 00:44:55,184 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 00:44:55,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 00:44:55,185 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 00:44:55,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-16 00:44:55,370 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2023-02-16 00:44:55,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-02-16 00:44:55,370 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 00:44:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 00:44:55,528 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-02-16 00:44:55,528 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-16 00:44:55,529 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-16 00:44:55,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-16 00:44:55,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 00:44:55,733 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1] [2023-02-16 00:44:55,738 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-16 00:44:55,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.02 12:44:55 BoogieIcfgContainer [2023-02-16 00:44:55,761 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-16 00:44:55,762 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-16 00:44:55,762 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-16 00:44:55,762 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-16 00:44:55,762 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 12:44:43" (3/4) ... [2023-02-16 00:44:55,763 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-16 00:44:55,800 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-16 00:44:55,807 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-16 00:44:55,808 INFO L158 Benchmark]: Toolchain (without parser) took 12470.23ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 63.0MB in the beginning and 67.6MB in the end (delta: -4.6MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. [2023-02-16 00:44:55,808 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 60.8MB. Free memory is still 37.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 00:44:55,808 INFO L158 Benchmark]: CACSL2BoogieTranslator took 147.57ms. Allocated memory is still 86.0MB. Free memory was 62.8MB in the beginning and 52.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-16 00:44:55,808 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.26ms. Allocated memory is still 86.0MB. Free memory was 52.1MB in the beginning and 50.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 00:44:55,808 INFO L158 Benchmark]: Boogie Preprocessor took 31.05ms. Allocated memory is still 86.0MB. Free memory was 50.7MB in the beginning and 49.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 00:44:55,809 INFO L158 Benchmark]: RCFGBuilder took 259.73ms. Allocated memory is still 86.0MB. Free memory was 49.3MB in the beginning and 59.8MB in the end (delta: -10.5MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2023-02-16 00:44:55,809 INFO L158 Benchmark]: TraceAbstraction took 11957.04ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 59.0MB in the beginning and 70.9MB in the end (delta: -11.8MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2023-02-16 00:44:55,809 INFO L158 Benchmark]: Witness Printer took 45.64ms. Allocated memory is still 104.9MB. Free memory was 70.9MB in the beginning and 67.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-16 00:44:55,810 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.13ms. Allocated memory is still 60.8MB. Free memory is still 37.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 147.57ms. Allocated memory is still 86.0MB. Free memory was 62.8MB in the beginning and 52.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.26ms. Allocated memory is still 86.0MB. Free memory was 52.1MB in the beginning and 50.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.05ms. Allocated memory is still 86.0MB. Free memory was 50.7MB in the beginning and 49.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 259.73ms. Allocated memory is still 86.0MB. Free memory was 49.3MB in the beginning and 59.8MB in the end (delta: -10.5MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. * TraceAbstraction took 11957.04ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 59.0MB in the beginning and 70.9MB in the end (delta: -11.8MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * Witness Printer took 45.64ms. Allocated memory is still 104.9MB. Free memory was 70.9MB in the beginning and 67.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 9]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] char in[11]; [L17] char *s; [L18] unsigned char c; [L19] int i, j; [L20] int idx_in; [L21] i = 0 VAL [i=0, in={7:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=1, in={7:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=2, in={7:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=3, in={7:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=4, in={7:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=5, in={7:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=6, in={7:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=7, in={7:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=8, in={7:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=9, in={7:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=10, in={7:0}] [L21] COND TRUE i < 11 [L22] in[i] = __VERIFIER_nondet_char() [L21] i++ VAL [i=11, in={7:0}] [L21] COND FALSE !(i < 11) VAL [i=11, in={7:0}] [L23] in[10] = 0 [L24] idx_in = 0 [L25] s = in [L26] i = 0 [L27] EXPR in[idx_in] [L27] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND TRUE ('0' <= c) && (c <= '9') [L30] j = c - '0' [L31] i = i * 10U + j [L32] idx_in++ [L33] EXPR in[idx_in] [L33] c = in[idx_in] [L28] COND FALSE !(('0' <= c) && (c <= '9')) VAL [c=0, i=-86634792, idx_in=10, in={7:0}, j=0, s={7:0}] [L36] CALL __VERIFIER_assert (i >= 0) [L8] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L9] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.9s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 99 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 99 mSDsluCounter, 231 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 180 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 577 IncrementalHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 51 mSDtfsCounter, 577 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 276 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=7, InterpolantAutomatonStates: 67, 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, 7 MinimizatonAttempts, 27 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 185 NumberOfCodeBlocks, 157 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 254 ConstructedInterpolants, 12 QuantifiedInterpolants, 870 SizeOfPredicates, 23 NumberOfNonLiveVariables, 436 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 504/760 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! [2023-02-16 00:44:55,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE