./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-acceleration/phases_1-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 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/loop-acceleration/phases_1-1.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 bc900b1bfcaecf91bc89637deaef4e1ddf2476faf43fa7e6f1e197c315ae3982 --- Real Ultimate output --- This is Ultimate 0.2.2-?-2329fc7 [2023-02-13 23:52:12,256 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-13 23:52:12,257 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-13 23:52:12,287 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-13 23:52:12,288 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-13 23:52:12,291 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-13 23:52:12,292 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-13 23:52:12,295 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-13 23:52:12,297 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-13 23:52:12,300 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-13 23:52:12,302 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-13 23:52:12,303 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-13 23:52:12,304 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-13 23:52:12,305 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-13 23:52:12,307 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-13 23:52:12,309 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-13 23:52:12,309 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-13 23:52:12,310 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-13 23:52:12,316 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-13 23:52:12,319 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-13 23:52:12,321 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-13 23:52:12,321 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-13 23:52:12,322 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-13 23:52:12,323 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-13 23:52:12,328 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-13 23:52:12,329 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-13 23:52:12,329 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-13 23:52:12,331 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-13 23:52:12,331 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-13 23:52:12,331 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-13 23:52:12,332 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-13 23:52:12,333 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-13 23:52:12,335 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-13 23:52:12,335 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-13 23:52:12,336 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-13 23:52:12,336 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-13 23:52:12,337 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-13 23:52:12,337 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-13 23:52:12,337 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-13 23:52:12,337 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-13 23:52:12,338 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-13 23:52:12,339 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-13 23:52:12,363 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-13 23:52:12,365 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-13 23:52:12,366 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-13 23:52:12,366 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-13 23:52:12,367 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-13 23:52:12,367 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-13 23:52:12,368 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-13 23:52:12,368 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-13 23:52:12,368 INFO L138 SettingsManager]: * Use SBE=true [2023-02-13 23:52:12,368 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-13 23:52:12,369 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-13 23:52:12,369 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-13 23:52:12,369 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-13 23:52:12,369 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-13 23:52:12,369 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-13 23:52:12,369 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-13 23:52:12,370 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-13 23:52:12,370 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-13 23:52:12,370 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-13 23:52:12,370 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-13 23:52:12,370 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-13 23:52:12,370 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-13 23:52:12,371 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-13 23:52:12,371 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-13 23:52:12,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-13 23:52:12,371 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-13 23:52:12,371 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-13 23:52:12,371 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-13 23:52:12,372 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-13 23:52:12,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-13 23:52:12,372 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-13 23:52:12,372 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-13 23:52:12,373 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-13 23:52:12,373 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-13 23:52:12,373 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-13 23:52:12,373 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 -> bc900b1bfcaecf91bc89637deaef4e1ddf2476faf43fa7e6f1e197c315ae3982 [2023-02-13 23:52:12,576 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-13 23:52:12,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-13 23:52:12,603 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-13 23:52:12,604 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-13 23:52:12,604 INFO L275 PluginConnector]: CDTParser initialized [2023-02-13 23:52:12,605 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-acceleration/phases_1-1.c [2023-02-13 23:52:13,646 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-13 23:52:13,794 INFO L351 CDTParser]: Found 1 translation units. [2023-02-13 23:52:13,794 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-acceleration/phases_1-1.c [2023-02-13 23:52:13,798 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb181c4c9/0bf829ecd54443c3803b284fe5f35dc1/FLAGf029e68b6 [2023-02-13 23:52:13,809 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb181c4c9/0bf829ecd54443c3803b284fe5f35dc1 [2023-02-13 23:52:13,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-13 23:52:13,812 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-13 23:52:13,813 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-13 23:52:13,813 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-13 23:52:13,815 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-13 23:52:13,815 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.02 11:52:13" (1/1) ... [2023-02-13 23:52:13,816 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3441956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:52:13, skipping insertion in model container [2023-02-13 23:52:13,816 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.02 11:52:13" (1/1) ... [2023-02-13 23:52:13,821 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-13 23:52:13,829 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-13 23:52:13,943 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/loop-acceleration/phases_1-1.c[322,335] [2023-02-13 23:52:13,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-13 23:52:13,964 INFO L203 MainTranslator]: Completed pre-run [2023-02-13 23:52:13,975 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/loop-acceleration/phases_1-1.c[322,335] [2023-02-13 23:52:13,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-13 23:52:13,986 INFO L208 MainTranslator]: Completed translation [2023-02-13 23:52:13,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:52:13 WrapperNode [2023-02-13 23:52:13,987 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-13 23:52:13,988 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-13 23:52:13,988 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-13 23:52:13,988 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-13 23:52:13,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:52:13" (1/1) ... [2023-02-13 23:52:13,999 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:52:13" (1/1) ... [2023-02-13 23:52:14,010 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 27 [2023-02-13 23:52:14,010 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-13 23:52:14,011 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-13 23:52:14,011 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-13 23:52:14,011 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-13 23:52:14,016 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:52:13" (1/1) ... [2023-02-13 23:52:14,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:52:13" (1/1) ... [2023-02-13 23:52:14,017 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:52:13" (1/1) ... [2023-02-13 23:52:14,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:52:13" (1/1) ... [2023-02-13 23:52:14,019 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:52:13" (1/1) ... [2023-02-13 23:52:14,022 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:52:13" (1/1) ... [2023-02-13 23:52:14,022 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:52:13" (1/1) ... [2023-02-13 23:52:14,023 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:52:13" (1/1) ... [2023-02-13 23:52:14,024 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-13 23:52:14,024 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-13 23:52:14,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-13 23:52:14,025 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-13 23:52:14,025 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:52:13" (1/1) ... [2023-02-13 23:52:14,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-13 23:52:14,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:52:14,051 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-13 23:52:14,064 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-13 23:52:14,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-13 23:52:14,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-13 23:52:14,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-13 23:52:14,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-13 23:52:14,125 INFO L235 CfgBuilder]: Building ICFG [2023-02-13 23:52:14,126 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-13 23:52:14,232 INFO L276 CfgBuilder]: Performing block encoding [2023-02-13 23:52:14,238 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-13 23:52:14,238 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-13 23:52:14,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.02 11:52:14 BoogieIcfgContainer [2023-02-13 23:52:14,240 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-13 23:52:14,242 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-13 23:52:14,242 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-13 23:52:14,244 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-13 23:52:14,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.02 11:52:13" (1/3) ... [2023-02-13 23:52:14,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d1ccb28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.02 11:52:14, skipping insertion in model container [2023-02-13 23:52:14,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.02 11:52:13" (2/3) ... [2023-02-13 23:52:14,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d1ccb28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.02 11:52:14, skipping insertion in model container [2023-02-13 23:52:14,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.02 11:52:14" (3/3) ... [2023-02-13 23:52:14,246 INFO L112 eAbstractionObserver]: Analyzing ICFG phases_1-1.c [2023-02-13 23:52:14,259 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-13 23:52:14,259 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-13 23:52:14,308 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-13 23:52:14,313 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;@45503781, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-13 23:52:14,313 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-13 23:52:14,324 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 11 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-13 23:52:14,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-13 23:52:14,341 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:52:14,342 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-13 23:52:14,342 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:52:14,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:52:14,352 INFO L85 PathProgramCache]: Analyzing trace with hash 889937703, now seen corresponding path program 1 times [2023-02-13 23:52:14,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:52:14,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963237898] [2023-02-13 23:52:14,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:52:14,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:52:14,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:52:14,449 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-13 23:52:14,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:52:14,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963237898] [2023-02-13 23:52:14,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963237898] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:52:14,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:52:14,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-13 23:52:14,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084925831] [2023-02-13 23:52:14,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:52:14,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-13 23:52:14,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:52:14,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-13 23:52:14,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-13 23:52:14,480 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.5) internal successors, (15), 11 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) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-13 23:52:14,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:52:14,491 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2023-02-13 23:52:14,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-13 23:52:14,493 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2023-02-13 23:52:14,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:52:14,497 INFO L225 Difference]: With dead ends: 20 [2023-02-13 23:52:14,498 INFO L226 Difference]: Without dead ends: 8 [2023-02-13 23:52:14,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-13 23:52:14,503 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:52:14,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:52:14,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2023-02-13 23:52:14,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2023-02-13 23:52:14,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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-13 23:52:14,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2023-02-13 23:52:14,523 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2023-02-13 23:52:14,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:52:14,524 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2023-02-13 23:52:14,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-13 23:52:14,524 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2023-02-13 23:52:14,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-13 23:52:14,524 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:52:14,525 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-13 23:52:14,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-13 23:52:14,525 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:52:14,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:52:14,526 INFO L85 PathProgramCache]: Analyzing trace with hash 889639793, now seen corresponding path program 1 times [2023-02-13 23:52:14,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:52:14,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011359014] [2023-02-13 23:52:14,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:52:14,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:52:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:52:14,646 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-13 23:52:14,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:52:14,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011359014] [2023-02-13 23:52:14,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011359014] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-13 23:52:14,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-13 23:52:14,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-13 23:52:14,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561885594] [2023-02-13 23:52:14,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-13 23:52:14,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-13 23:52:14,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:52:14,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-13 23:52:14,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-13 23:52:14,649 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-13 23:52:14,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:52:14,662 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2023-02-13 23:52:14,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-13 23:52:14,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2023-02-13 23:52:14,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:52:14,662 INFO L225 Difference]: With dead ends: 16 [2023-02-13 23:52:14,663 INFO L226 Difference]: Without dead ends: 10 [2023-02-13 23:52:14,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-13 23:52:14,664 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:52:14,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 10 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:52:14,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2023-02-13 23:52:14,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2023-02-13 23:52:14,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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-13 23:52:14,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2023-02-13 23:52:14,670 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2023-02-13 23:52:14,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:52:14,674 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2023-02-13 23:52:14,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-13 23:52:14,675 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2023-02-13 23:52:14,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-13 23:52:14,675 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:52:14,675 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:52:14,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-13 23:52:14,676 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:52:14,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:52:14,676 INFO L85 PathProgramCache]: Analyzing trace with hash 295691924, now seen corresponding path program 1 times [2023-02-13 23:52:14,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:52:14,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110207090] [2023-02-13 23:52:14,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:52:14,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:52:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:52:14,762 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-13 23:52:14,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:52:14,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110207090] [2023-02-13 23:52:14,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110207090] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 23:52:14,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397338612] [2023-02-13 23:52:14,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:52:14,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:52:14,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:52:14,789 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-13 23:52:14,790 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-13 23:52:14,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:52:14,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-13 23:52:14,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:52:14,860 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-13 23:52:14,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 23:52:14,882 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-13 23:52:14,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397338612] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 23:52:14,882 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-13 23:52:14,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-02-13 23:52:14,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956370956] [2023-02-13 23:52:14,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-13 23:52:14,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-13 23:52:14,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:52:14,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-13 23:52:14,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-02-13 23:52:14,884 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-13 23:52:14,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:52:14,929 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2023-02-13 23:52:14,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-13 23:52:14,930 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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 8 [2023-02-13 23:52:14,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:52:14,930 INFO L225 Difference]: With dead ends: 20 [2023-02-13 23:52:14,930 INFO L226 Difference]: Without dead ends: 14 [2023-02-13 23:52:14,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2023-02-13 23:52:14,932 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-13 23:52:14,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 21 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-13 23:52:14,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-02-13 23:52:14,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2023-02-13 23:52:14,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 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-13 23:52:14,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2023-02-13 23:52:14,935 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 8 [2023-02-13 23:52:14,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:52:14,936 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2023-02-13 23:52:14,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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-13 23:52:14,936 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2023-02-13 23:52:14,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-13 23:52:14,937 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:52:14,937 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-13 23:52:14,944 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-13 23:52:15,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:52:15,142 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:52:15,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:52:15,143 INFO L85 PathProgramCache]: Analyzing trace with hash 572634524, now seen corresponding path program 1 times [2023-02-13 23:52:15,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:52:15,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368883313] [2023-02-13 23:52:15,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:52:15,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:52:15,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:52:15,262 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:52:15,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:52:15,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368883313] [2023-02-13 23:52:15,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368883313] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 23:52:15,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622315217] [2023-02-13 23:52:15,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:52:15,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:52:15,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:52:15,269 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-13 23:52:15,271 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-13 23:52:15,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:52:15,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-13 23:52:15,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:52:15,369 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:52:15,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 23:52:15,443 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:52:15,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622315217] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 23:52:15,444 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-13 23:52:15,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2023-02-13 23:52:15,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797775692] [2023-02-13 23:52:15,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-13 23:52:15,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-13 23:52:15,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:52:15,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-13 23:52:15,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-02-13 23:52:15,446 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 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-13 23:52:15,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:52:15,553 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2023-02-13 23:52:15,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-13 23:52:15,553 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 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 12 [2023-02-13 23:52:15,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:52:15,555 INFO L225 Difference]: With dead ends: 26 [2023-02-13 23:52:15,555 INFO L226 Difference]: Without dead ends: 19 [2023-02-13 23:52:15,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2023-02-13 23:52:15,556 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 3 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-13 23:52:15,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 30 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-13 23:52:15,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-02-13 23:52:15,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-02-13 23:52:15,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 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-13 23:52:15,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2023-02-13 23:52:15,561 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 12 [2023-02-13 23:52:15,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:52:15,561 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2023-02-13 23:52:15,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 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-13 23:52:15,562 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2023-02-13 23:52:15,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-13 23:52:15,562 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:52:15,562 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1, 1, 1, 1] [2023-02-13 23:52:15,583 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-13 23:52:15,768 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-13 23:52:15,768 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:52:15,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:52:15,769 INFO L85 PathProgramCache]: Analyzing trace with hash -549258615, now seen corresponding path program 2 times [2023-02-13 23:52:15,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:52:15,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52991569] [2023-02-13 23:52:15,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:52:15,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:52:15,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:52:15,903 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-13 23:52:15,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:52:15,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52991569] [2023-02-13 23:52:15,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52991569] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 23:52:15,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534716532] [2023-02-13 23:52:15,907 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-13 23:52:15,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:52:15,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:52:15,923 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-13 23:52:15,924 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-13 23:52:15,954 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-13 23:52:15,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-13 23:52:15,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-13 23:52:15,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:52:16,047 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:52:16,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 23:52:16,167 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:52:16,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534716532] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 23:52:16,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-13 23:52:16,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 17 [2023-02-13 23:52:16,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069347343] [2023-02-13 23:52:16,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-13 23:52:16,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-13 23:52:16,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:52:16,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-13 23:52:16,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2023-02-13 23:52:16,171 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 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-13 23:52:16,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:52:16,790 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2023-02-13 23:52:16,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-13 23:52:16,790 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 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 18 [2023-02-13 23:52:16,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:52:16,791 INFO L225 Difference]: With dead ends: 36 [2023-02-13 23:52:16,791 INFO L226 Difference]: Without dead ends: 25 [2023-02-13 23:52:16,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=154, Invalid=266, Unknown=0, NotChecked=0, Total=420 [2023-02-13 23:52:16,792 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 5 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-13 23:52:16,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 30 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-13 23:52:16,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-02-13 23:52:16,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-02-13 23:52:16,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.25) internal successors, (30), 24 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-13 23:52:16,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2023-02-13 23:52:16,795 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 18 [2023-02-13 23:52:16,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:52:16,796 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2023-02-13 23:52:16,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 states have internal predecessors, (38), 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-13 23:52:16,796 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2023-02-13 23:52:16,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-13 23:52:16,796 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:52:16,796 INFO L195 NwaCegarLoop]: trace histogram [9, 5, 4, 1, 1, 1, 1, 1, 1] [2023-02-13 23:52:16,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-13 23:52:17,000 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-13 23:52:17,001 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:52:17,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:52:17,001 INFO L85 PathProgramCache]: Analyzing trace with hash 379103926, now seen corresponding path program 3 times [2023-02-13 23:52:17,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:52:17,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720743187] [2023-02-13 23:52:17,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:52:17,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:52:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:52:17,100 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-13 23:52:17,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:52:17,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720743187] [2023-02-13 23:52:17,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720743187] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 23:52:17,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526955112] [2023-02-13 23:52:17,101 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-13 23:52:17,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:52:17,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:52:17,115 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-13 23:52:17,122 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-13 23:52:17,163 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2023-02-13 23:52:17,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-13 23:52:17,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-13 23:52:17,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:52:17,260 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:52:17,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 23:52:17,509 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:52:17,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526955112] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 23:52:17,509 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-13 23:52:17,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 12] total 22 [2023-02-13 23:52:17,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720703855] [2023-02-13 23:52:17,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-13 23:52:17,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-13 23:52:17,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:52:17,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-13 23:52:17,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=315, Unknown=0, NotChecked=0, Total=462 [2023-02-13 23:52:17,511 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 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-13 23:52:19,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:52:19,849 INFO L93 Difference]: Finished difference Result 60 states and 80 transitions. [2023-02-13 23:52:19,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-13 23:52:19,850 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 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 24 [2023-02-13 23:52:19,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:52:19,851 INFO L225 Difference]: With dead ends: 60 [2023-02-13 23:52:19,852 INFO L226 Difference]: Without dead ends: 45 [2023-02-13 23:52:19,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=345, Invalid=585, Unknown=0, NotChecked=0, Total=930 [2023-02-13 23:52:19,854 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 27 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-13 23:52:19,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 20 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-13 23:52:19,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-02-13 23:52:19,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-02-13 23:52:19,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 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-13 23:52:19,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2023-02-13 23:52:19,864 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 24 [2023-02-13 23:52:19,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:52:19,865 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2023-02-13 23:52:19,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 22 states have internal predecessors, (48), 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-13 23:52:19,865 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2023-02-13 23:52:19,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-13 23:52:19,866 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:52:19,866 INFO L195 NwaCegarLoop]: trace histogram [19, 14, 5, 1, 1, 1, 1, 1, 1] [2023-02-13 23:52:19,870 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-13 23:52:20,070 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-13 23:52:20,071 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:52:20,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:52:20,072 INFO L85 PathProgramCache]: Analyzing trace with hash 2044022996, now seen corresponding path program 4 times [2023-02-13 23:52:20,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:52:20,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346432191] [2023-02-13 23:52:20,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:52:20,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:52:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:52:20,478 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 135 proven. 210 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-13 23:52:20,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:52:20,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346432191] [2023-02-13 23:52:20,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346432191] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 23:52:20,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011605538] [2023-02-13 23:52:20,478 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-13 23:52:20,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:52:20,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:52:20,479 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-13 23:52:20,494 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-13 23:52:20,532 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-13 23:52:20,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-13 23:52:20,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-13 23:52:20,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:52:20,779 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-13 23:52:20,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 23:52:20,934 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2023-02-13 23:52:20,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011605538] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 23:52:20,935 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-13 23:52:20,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 23, 5] total 27 [2023-02-13 23:52:20,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871958971] [2023-02-13 23:52:20,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-13 23:52:20,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-02-13 23:52:20,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:52:20,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-13 23:52:20,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=615, Unknown=0, NotChecked=0, Total=702 [2023-02-13 23:52:20,937 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 27 states, 27 states have (on average 2.259259259259259) internal successors, (61), 27 states have internal predecessors, (61), 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-13 23:52:21,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:52:21,223 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2023-02-13 23:52:21,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-13 23:52:21,224 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.259259259259259) internal successors, (61), 27 states have internal predecessors, (61), 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 44 [2023-02-13 23:52:21,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:52:21,224 INFO L225 Difference]: With dead ends: 75 [2023-02-13 23:52:21,224 INFO L226 Difference]: Without dead ends: 58 [2023-02-13 23:52:21,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2023-02-13 23:52:21,225 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 5 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-13 23:52:21,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 63 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-13 23:52:21,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-02-13 23:52:21,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2023-02-13 23:52:21,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 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-13 23:52:21,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2023-02-13 23:52:21,232 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 44 [2023-02-13 23:52:21,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:52:21,232 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2023-02-13 23:52:21,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.259259259259259) internal successors, (61), 27 states have internal predecessors, (61), 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-13 23:52:21,232 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2023-02-13 23:52:21,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-13 23:52:21,236 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:52:21,236 INFO L195 NwaCegarLoop]: trace histogram [20, 15, 5, 1, 1, 1, 1, 1, 1] [2023-02-13 23:52:21,245 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-13 23:52:21,437 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-13 23:52:21,437 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:52:21,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:52:21,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1456868937, now seen corresponding path program 5 times [2023-02-13 23:52:21,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:52:21,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071262857] [2023-02-13 23:52:21,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:52:21,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:52:21,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:52:21,813 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 144 proven. 240 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-13 23:52:21,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:52:21,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071262857] [2023-02-13 23:52:21,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071262857] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 23:52:21,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614755164] [2023-02-13 23:52:21,813 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-13 23:52:21,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:52:21,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:52:21,814 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-13 23:52:21,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-13 23:52:22,615 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2023-02-13 23:52:22,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-13 23:52:22,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-13 23:52:22,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:52:22,728 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 144 proven. 240 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-13 23:52:22,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 23:52:23,448 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 144 proven. 240 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-13 23:52:23,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614755164] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 23:52:23,449 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-13 23:52:23,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 19] total 36 [2023-02-13 23:52:23,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314521811] [2023-02-13 23:52:23,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-13 23:52:23,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-13 23:52:23,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:52:23,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-13 23:52:23,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=885, Unknown=0, NotChecked=0, Total=1260 [2023-02-13 23:52:23,453 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 36 states have internal predecessors, (76), 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-13 23:52:49,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:52:49,063 INFO L93 Difference]: Finished difference Result 100 states and 129 transitions. [2023-02-13 23:52:49,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-02-13 23:52:49,064 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 36 states have internal predecessors, (76), 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 46 [2023-02-13 23:52:49,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:52:49,065 INFO L225 Difference]: With dead ends: 100 [2023-02-13 23:52:49,065 INFO L226 Difference]: Without dead ends: 83 [2023-02-13 23:52:49,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=951, Invalid=1701, Unknown=0, NotChecked=0, Total=2652 [2023-02-13 23:52:49,066 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 48 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-13 23:52:49,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 33 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-13 23:52:49,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-13 23:52:49,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-02-13 23:52:49,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.0853658536585367) internal successors, (89), 82 states have internal predecessors, (89), 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-13 23:52:49,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2023-02-13 23:52:49,076 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 46 [2023-02-13 23:52:49,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:52:49,076 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2023-02-13 23:52:49,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 36 states have internal predecessors, (76), 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-13 23:52:49,076 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2023-02-13 23:52:49,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-02-13 23:52:49,077 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:52:49,077 INFO L195 NwaCegarLoop]: trace histogram [38, 33, 5, 1, 1, 1, 1, 1, 1] [2023-02-13 23:52:49,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-13 23:52:49,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:52:49,278 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:52:49,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:52:49,279 INFO L85 PathProgramCache]: Analyzing trace with hash 2002488685, now seen corresponding path program 6 times [2023-02-13 23:52:49,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:52:49,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585739518] [2023-02-13 23:52:49,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:52:49,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:52:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:52:50,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 306 proven. 1122 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-13 23:52:50,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:52:50,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585739518] [2023-02-13 23:52:50,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585739518] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 23:52:50,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928846270] [2023-02-13 23:52:50,173 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-13 23:52:50,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:52:50,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:52:50,174 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-13 23:52:50,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-13 23:52:51,596 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2023-02-13 23:52:51,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-13 23:52:51,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-13 23:52:51,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:52:51,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 363 proven. 25 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2023-02-13 23:52:51,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 23:52:52,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 363 proven. 25 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2023-02-13 23:52:52,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928846270] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 23:52:52,274 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-13 23:52:52,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 8, 9] total 49 [2023-02-13 23:52:52,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183350077] [2023-02-13 23:52:52,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-13 23:52:52,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-02-13 23:52:52,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:52:52,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-02-13 23:52:52,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=1853, Unknown=0, NotChecked=0, Total=2352 [2023-02-13 23:52:52,276 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 49 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 49 states have internal predecessors, (103), 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-13 23:52:56,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-13 23:52:56,621 INFO L93 Difference]: Finished difference Result 145 states and 186 transitions. [2023-02-13 23:52:56,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-02-13 23:52:56,622 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 49 states have internal predecessors, (103), 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 82 [2023-02-13 23:52:56,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-13 23:52:56,623 INFO L225 Difference]: With dead ends: 145 [2023-02-13 23:52:56,623 INFO L226 Difference]: Without dead ends: 128 [2023-02-13 23:52:56,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 160 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=954, Invalid=2706, Unknown=0, NotChecked=0, Total=3660 [2023-02-13 23:52:56,624 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 18 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 2289 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 2310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-13 23:52:56,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 40 Invalid, 2310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2289 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-13 23:52:56,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-02-13 23:52:56,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 113. [2023-02-13 23:52:56,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 112 states have (on average 1.0892857142857142) internal successors, (122), 112 states have internal predecessors, (122), 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-13 23:52:56,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2023-02-13 23:52:56,661 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 82 [2023-02-13 23:52:56,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-13 23:52:56,661 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2023-02-13 23:52:56,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 49 states have internal predecessors, (103), 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-13 23:52:56,662 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2023-02-13 23:52:56,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-02-13 23:52:56,663 INFO L187 NwaCegarLoop]: Found error trace [2023-02-13 23:52:56,663 INFO L195 NwaCegarLoop]: trace histogram [47, 35, 12, 1, 1, 1, 1, 1, 1] [2023-02-13 23:52:56,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-13 23:52:56,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:52:56,864 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-13 23:52:56,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-13 23:52:56,864 INFO L85 PathProgramCache]: Analyzing trace with hash 225002294, now seen corresponding path program 7 times [2023-02-13 23:52:56,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-13 23:52:56,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093795314] [2023-02-13 23:52:56,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-13 23:52:56,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-13 23:52:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:52:57,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 828 proven. 1260 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2023-02-13 23:52:57,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-13 23:52:57,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093795314] [2023-02-13 23:52:57,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093795314] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-13 23:52:57,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939372397] [2023-02-13 23:52:57,962 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-13 23:52:57,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-13 23:52:57,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-13 23:52:57,963 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-13 23:52:57,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-13 23:52:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-13 23:52:58,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 88 conjunts are in the unsatisfiable core [2023-02-13 23:52:58,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-13 23:52:58,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 387 proven. 1806 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-13 23:52:58,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-13 23:53:01,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 387 proven. 1806 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-13 23:53:01,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939372397] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-13 23:53:01,855 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-13 23:53:01,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 45, 46] total 90 [2023-02-13 23:53:01,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133063050] [2023-02-13 23:53:01,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-13 23:53:01,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2023-02-13 23:53:01,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-13 23:53:01,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2023-02-13 23:53:01,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2150, Invalid=5860, Unknown=0, NotChecked=0, Total=8010 [2023-02-13 23:53:01,859 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand has 90 states, 90 states have (on average 2.0444444444444443) internal successors, (184), 90 states have internal predecessors, (184), 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-13 23:53:04,834 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (< .cse0 65520) (not (< .cse0 268435455)))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< .cse1 65520) (not (< .cse1 268435455)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (not (< .cse2 268435455)) (< .cse2 65520))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296))) (or (not (< .cse3 268435455)) (< .cse3 65520))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (< .cse4 268435455)) (< .cse4 65520))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (< .cse5 268435455)) (< .cse5 65520))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< .cse6 65520) (not (< .cse6 268435455)))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296))) (or (not (< .cse7 268435455)) (< .cse7 65520))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (not (< .cse8 268435455)) (< .cse8 65520))) (let ((.cse9 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse9 65520) (not (< .cse9 268435455)))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (< .cse10 65520) (not (< .cse10 268435455)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (< .cse11 65520) (not (< .cse11 268435455)))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (< .cse12 65520) (not (< .cse12 268435455)))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (not (< .cse13 268435455)) (< .cse13 65520))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (not (< .cse14 268435455)) (< .cse14 65520))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (not (< .cse15 268435455)) (< .cse15 65520))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (< .cse16 65520) (not (< .cse16 268435455)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< .cse17 65520) (not (< .cse17 268435455)))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (not (< .cse18 268435455)) (< .cse18 65520))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< .cse19 65520) (not (< .cse19 268435455)))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296))) (or (< .cse20 65520) (not (< .cse20 268435455)))) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 65520) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (not (< .cse21 268435455)) (< .cse21 65520))) (let ((.cse22 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse22 268435455)) (< .cse22 65520))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< .cse23 65520) (not (< .cse23 268435455)))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (< .cse24 268435455)) (< .cse24 65520))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (< .cse25 65520) (not (< .cse25 268435455)))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (not (< .cse26 268435455)) (< .cse26 65520))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< .cse27 65520) (not (< .cse27 268435455)))) (let ((.cse28 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse28 268435455)) (< .cse28 65520))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse29 65520) (not (< .cse29 268435455)))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse30 65520) (not (< .cse30 268435455)))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< .cse31 65520) (not (< .cse31 268435455)))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (not (< .cse32 268435455)) (< .cse32 65520))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 47) 4294967296))) (or (not (< .cse33 268435455)) (< .cse33 65520))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse34 65520) (not (< .cse34 268435455)))) (let ((.cse35 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse35 268435455)) (< .cse35 65520))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< .cse36 65520) (not (< .cse36 268435455)))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (< .cse37 268435455)) (< .cse37 65520))) (let ((.cse38 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (< .cse38 65520) (not (< .cse38 268435455)))) (let ((.cse39 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (not (< .cse39 268435455)) (< .cse39 65520))) (let ((.cse40 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (< .cse40 268435455)) (< .cse40 65520))) (let ((.cse41 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse41 65520) (not (< .cse41 268435455))))) is different from false [2023-02-13 23:53:06,848 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (< .cse0 65520) (not (< .cse0 268435455)))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< .cse1 65520) (not (< .cse1 268435455)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296))) (or (not (< .cse2 268435455)) (< .cse2 65520))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (< .cse3 268435455)) (< .cse3 65520))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (< .cse4 268435455)) (< .cse4 65520))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< .cse5 65520) (not (< .cse5 268435455)))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296))) (or (not (< .cse6 268435455)) (< .cse6 65520))) (let ((.cse7 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse7 65520) (not (< .cse7 268435455)))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (< .cse8 65520) (not (< .cse8 268435455)))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (< .cse9 65520) (not (< .cse9 268435455)))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (< .cse10 65520) (not (< .cse10 268435455)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (not (< .cse11 268435455)) (< .cse11 65520))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (not (< .cse12 268435455)) (< .cse12 65520))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (not (< .cse13 268435455)) (< .cse13 65520))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< .cse14 65520) (not (< .cse14 268435455)))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (not (< .cse15 268435455)) (< .cse15 65520))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< .cse16 65520) (not (< .cse16 268435455)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (not (< .cse17 268435455)) (< .cse17 65520))) (let ((.cse18 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse18 268435455)) (< .cse18 65520))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< .cse19 65520) (not (< .cse19 268435455)))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (< .cse20 268435455)) (< .cse20 65520))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (< .cse21 65520) (not (< .cse21 268435455)))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< .cse22 65520) (not (< .cse22 268435455)))) (let ((.cse23 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse23 268435455)) (< .cse23 65520))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse24 65520) (not (< .cse24 268435455)))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse25 65520) (not (< .cse25 268435455)))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< .cse26 65520) (not (< .cse26 268435455)))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (not (< .cse27 268435455)) (< .cse27 65520))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 47) 4294967296))) (or (not (< .cse28 268435455)) (< .cse28 65520))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse29 65520) (not (< .cse29 268435455)))) (let ((.cse30 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse30 268435455)) (< .cse30 65520))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (< .cse31 268435455)) (< .cse31 65520))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (< .cse32 65520) (not (< .cse32 268435455)))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (not (< .cse33 268435455)) (< .cse33 65520))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse34 65520) (not (< .cse34 268435455))))) is different from false [2023-02-13 23:54:15,128 WARN L233 SmtUtils]: Spent 19.98s on a formula simplification. DAG size of input: 243 DAG size of output: 19 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-13 23:54:17,534 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (< .cse0 65520) (not (< .cse0 268435455)))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< .cse1 65520) (not (< .cse1 268435455)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296))) (or (not (< .cse2 268435455)) (< .cse2 65520))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (< .cse3 268435455)) (< .cse3 65520))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (< .cse4 268435455)) (< .cse4 65520))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< .cse5 65520) (not (< .cse5 268435455)))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296))) (or (not (< .cse6 268435455)) (< .cse6 65520))) (let ((.cse7 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse7 65520) (not (< .cse7 268435455)))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (< .cse8 65520) (not (< .cse8 268435455)))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (< .cse9 65520) (not (< .cse9 268435455)))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (< .cse10 65520) (not (< .cse10 268435455)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (not (< .cse11 268435455)) (< .cse11 65520))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (not (< .cse12 268435455)) (< .cse12 65520))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (not (< .cse13 268435455)) (< .cse13 65520))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< .cse14 65520) (not (< .cse14 268435455)))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (not (< .cse15 268435455)) (< .cse15 65520))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< .cse16 65520) (not (< .cse16 268435455)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296))) (or (< .cse17 65520) (not (< .cse17 268435455)))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (not (< .cse18 268435455)) (< .cse18 65520))) (let ((.cse19 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse19 268435455)) (< .cse19 65520))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< .cse20 65520) (not (< .cse20 268435455)))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (< .cse21 268435455)) (< .cse21 65520))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (< .cse22 65520) (not (< .cse22 268435455)))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< .cse23 65520) (not (< .cse23 268435455)))) (let ((.cse24 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse24 268435455)) (< .cse24 65520))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse25 65520) (not (< .cse25 268435455)))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse26 65520) (not (< .cse26 268435455)))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< .cse27 65520) (not (< .cse27 268435455)))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (not (< .cse28 268435455)) (< .cse28 65520))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 47) 4294967296))) (or (not (< .cse29 268435455)) (< .cse29 65520))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse30 65520) (not (< .cse30 268435455)))) (let ((.cse31 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse31 268435455)) (< .cse31 65520))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< .cse32 65520) (not (< .cse32 268435455)))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (< .cse33 268435455)) (< .cse33 65520))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (< .cse34 65520) (not (< .cse34 268435455)))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (not (< .cse35 268435455)) (< .cse35 65520))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (< .cse36 268435455)) (< .cse36 65520))) (let ((.cse37 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse37 65520) (not (< .cse37 268435455))))) is different from false [2023-02-13 23:54:20,136 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (< .cse0 65520) (not (< .cse0 268435455)))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (< .cse1 65520) (not (< .cse1 268435455)))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 48) 4294967296))) (or (not (< .cse2 268435455)) (< .cse2 65520))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (not (< .cse3 268435455)) (< .cse3 65520))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (not (< .cse4 268435455)) (< .cse4 65520))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 43) 4294967296))) (or (< .cse5 65520) (not (< .cse5 268435455)))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 46) 4294967296))) (or (not (< .cse6 268435455)) (< .cse6 65520))) (let ((.cse7 (mod (+ 19 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (< .cse7 65520) (not (< .cse7 268435455)))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (< .cse8 65520) (not (< .cse8 268435455)))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (< .cse9 65520) (not (< .cse9 268435455)))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (< .cse10 65520) (not (< .cse10 268435455)))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (not (< .cse11 268435455)) (< .cse11 65520))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (not (< .cse12 268435455)) (< .cse12 65520))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 42) 4294967296))) (or (not (< .cse13 268435455)) (< .cse13 65520))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (< .cse14 65520) (not (< .cse14 268435455)))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 44) 4294967296))) (or (not (< .cse15 268435455)) (< .cse15 65520))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 39) 4294967296))) (or (< .cse16 65520) (not (< .cse16 268435455)))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 49) 4294967296))) (or (< .cse17 65520) (not (< .cse17 268435455)))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (not (< .cse18 268435455)) (< .cse18 65520))) (let ((.cse19 (mod (+ 41 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse19 268435455)) (< .cse19 65520))) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (< .cse20 65520) (not (< .cse20 268435455)))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (not (< .cse21 268435455)) (< .cse21 65520))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (< .cse22 65520) (not (< .cse22 268435455)))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (< .cse23 65520) (not (< .cse23 268435455)))) (let ((.cse24 (mod (+ 40 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse24 268435455)) (< .cse24 65520))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (< .cse25 65520) (not (< .cse25 268435455)))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse26 65520) (not (< .cse26 268435455)))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< .cse27 65520) (not (< .cse27 268435455)))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 45) 4294967296))) (or (not (< .cse28 268435455)) (< .cse28 65520))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 47) 4294967296))) (or (not (< .cse29 268435455)) (< .cse29 65520))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (< .cse30 65520) (not (< .cse30 268435455)))) (let ((.cse31 (mod (+ 23 |c_ULTIMATE.start_main_~x~0#1|) 4294967296))) (or (not (< .cse31 268435455)) (< .cse31 65520))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 38) 4294967296))) (or (not (< .cse32 268435455)) (< .cse32 65520))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (< .cse33 65520) (not (< .cse33 268435455)))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 37) 4294967296))) (or (not (< .cse34 268435455)) (< .cse34 65520))) (let ((.cse35 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (not (< .cse35 268435455)) (< .cse35 65520))) (let ((.cse36 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse36 65520) (not (< .cse36 268435455))))) is different from false [2023-02-13 23:55:30,036 WARN L233 SmtUtils]: Spent 25.27s on a formula simplification. DAG size of input: 280 DAG size of output: 10 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-13 23:56:58,354 WARN L233 SmtUtils]: Spent 30.30s on a formula simplification. DAG size of input: 273 DAG size of output: 10 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)