./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/Mono1_1-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3a877d22 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/loops-crafted-1/Mono1_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 73587fb730a0fae8f0f61c4bce66b3ef3eca8012a1c96e30e457f1e4f757a73f --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 10:53:53,354 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 10:53:53,355 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 10:53:53,375 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 10:53:53,378 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 10:53:53,381 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 10:53:53,382 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 10:53:53,385 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 10:53:53,386 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 10:53:53,390 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 10:53:53,391 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 10:53:53,392 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 10:53:53,392 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 10:53:53,394 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 10:53:53,395 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 10:53:53,397 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 10:53:53,398 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 10:53:53,399 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 10:53:53,402 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 10:53:53,404 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 10:53:53,407 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 10:53:53,407 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 10:53:53,408 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 10:53:53,409 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 10:53:53,412 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 10:53:53,412 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 10:53:53,412 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 10:53:53,413 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 10:53:53,414 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 10:53:53,414 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 10:53:53,415 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 10:53:53,415 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 10:53:53,416 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 10:53:53,417 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 10:53:53,418 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 10:53:53,418 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 10:53:53,418 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 10:53:53,418 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 10:53:53,419 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 10:53:53,419 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 10:53:53,419 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 10:53:53,420 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-15 10:53:53,443 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 10:53:53,443 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 10:53:53,443 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 10:53:53,443 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 10:53:53,444 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-15 10:53:53,444 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-15 10:53:53,444 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 10:53:53,445 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 10:53:53,445 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 10:53:53,445 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 10:53:53,445 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 10:53:53,445 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 10:53:53,445 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 10:53:53,445 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 10:53:53,446 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-15 10:53:53,446 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-15 10:53:53,446 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-15 10:53:53,446 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 10:53:53,446 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 10:53:53,446 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 10:53:53,446 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-15 10:53:53,447 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 10:53:53,447 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 10:53:53,447 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-15 10:53:53,447 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 10:53:53,447 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 10:53:53,447 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-15 10:53:53,448 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-15 10:53:53,448 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 10:53:53,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-15 10:53:53,448 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-15 10:53:53,448 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-15 10:53:53,448 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-15 10:53:53,448 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 10:53:53,449 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/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 -> 73587fb730a0fae8f0f61c4bce66b3ef3eca8012a1c96e30e457f1e4f757a73f [2021-12-15 10:53:53,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 10:53:53,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 10:53:53,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 10:53:53,659 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 10:53:53,660 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 10:53:53,660 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/Mono1_1-1.c [2021-12-15 10:53:53,705 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5f6e6c27/d904b59daa5043bcbf4b711dd5963f70/FLAG71e9efa23 [2021-12-15 10:53:54,042 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 10:53:54,043 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/Mono1_1-1.c [2021-12-15 10:53:54,048 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5f6e6c27/d904b59daa5043bcbf4b711dd5963f70/FLAG71e9efa23 [2021-12-15 10:53:54,057 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5f6e6c27/d904b59daa5043bcbf4b711dd5963f70 [2021-12-15 10:53:54,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 10:53:54,059 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 10:53:54,061 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 10:53:54,061 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 10:53:54,063 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 10:53:54,064 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:53:54" (1/1) ... [2021-12-15 10:53:54,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c8262ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:53:54, skipping insertion in model container [2021-12-15 10:53:54,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:53:54" (1/1) ... [2021-12-15 10:53:54,069 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 10:53:54,081 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 10:53:54,153 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/Mono1_1-1.c[313,326] [2021-12-15 10:53:54,159 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 10:53:54,163 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 10:53:54,173 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/Mono1_1-1.c[313,326] [2021-12-15 10:53:54,175 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 10:53:54,183 INFO L208 MainTranslator]: Completed translation [2021-12-15 10:53:54,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:53:54 WrapperNode [2021-12-15 10:53:54,183 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 10:53:54,184 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 10:53:54,184 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 10:53:54,184 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 10:53:54,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:53:54" (1/1) ... [2021-12-15 10:53:54,198 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:53:54" (1/1) ... [2021-12-15 10:53:54,225 INFO L137 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 26 [2021-12-15 10:53:54,226 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 10:53:54,226 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 10:53:54,226 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 10:53:54,226 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 10:53:54,231 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:53:54" (1/1) ... [2021-12-15 10:53:54,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:53:54" (1/1) ... [2021-12-15 10:53:54,232 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:53:54" (1/1) ... [2021-12-15 10:53:54,232 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:53:54" (1/1) ... [2021-12-15 10:53:54,233 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:53:54" (1/1) ... [2021-12-15 10:53:54,235 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:53:54" (1/1) ... [2021-12-15 10:53:54,236 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:53:54" (1/1) ... [2021-12-15 10:53:54,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 10:53:54,237 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 10:53:54,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 10:53:54,237 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 10:53:54,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:53:54" (1/1) ... [2021-12-15 10:53:54,242 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-15 10:53:54,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:53:54,257 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) [2021-12-15 10:53:54,259 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 [2021-12-15 10:53:54,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 10:53:54,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 10:53:54,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 10:53:54,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 10:53:54,319 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 10:53:54,321 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 10:53:54,373 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 10:53:54,377 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 10:53:54,377 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-15 10:53:54,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:53:54 BoogieIcfgContainer [2021-12-15 10:53:54,378 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 10:53:54,379 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-15 10:53:54,379 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-15 10:53:54,381 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-15 10:53:54,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 10:53:54" (1/3) ... [2021-12-15 10:53:54,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b928d3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:53:54, skipping insertion in model container [2021-12-15 10:53:54,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:53:54" (2/3) ... [2021-12-15 10:53:54,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b928d3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:53:54, skipping insertion in model container [2021-12-15 10:53:54,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:53:54" (3/3) ... [2021-12-15 10:53:54,383 INFO L111 eAbstractionObserver]: Analyzing ICFG Mono1_1-1.c [2021-12-15 10:53:54,387 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-15 10:53:54,387 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-15 10:53:54,412 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-15 10:53:54,417 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-15 10:53:54,417 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-15 10:53:54,424 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) [2021-12-15 10:53:54,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-15 10:53:54,427 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:53:54,428 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-15 10:53:54,428 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:53:54,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:53:54,431 INFO L85 PathProgramCache]: Analyzing trace with hash 889937703, now seen corresponding path program 1 times [2021-12-15 10:53:54,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:53:54,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062725765] [2021-12-15 10:53:54,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:53:54,438 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:53:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:53:54,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:53:54,521 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:53:54,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062725765] [2021-12-15 10:53:54,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062725765] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:53:54,522 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:53:54,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 10:53:54,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028283206] [2021-12-15 10:53:54,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:53:54,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-15 10:53:54,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:53:54,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-15 10:53:54,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 10:53:54,544 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) [2021-12-15 10:53:54,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:53:54,551 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2021-12-15 10:53:54,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 10:53:54,552 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 [2021-12-15 10:53:54,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:53:54,556 INFO L225 Difference]: With dead ends: 20 [2021-12-15 10:53:54,557 INFO L226 Difference]: Without dead ends: 8 [2021-12-15 10:53:54,559 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 10:53:54,561 INFO L933 BasicCegarLoop]: 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 [2021-12-15 10:53:54,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 10:53:54,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2021-12-15 10:53:54,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-12-15 10:53:54,578 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) [2021-12-15 10:53:54,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2021-12-15 10:53:54,579 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2021-12-15 10:53:54,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:53:54,580 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2021-12-15 10:53:54,580 INFO L471 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) [2021-12-15 10:53:54,580 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2021-12-15 10:53:54,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-15 10:53:54,580 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:53:54,580 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-15 10:53:54,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-15 10:53:54,581 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:53:54,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:53:54,582 INFO L85 PathProgramCache]: Analyzing trace with hash 889639793, now seen corresponding path program 1 times [2021-12-15 10:53:54,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:53:54,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222992017] [2021-12-15 10:53:54,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:53:54,582 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:53:54,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:53:54,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:53:54,645 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:53:54,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222992017] [2021-12-15 10:53:54,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222992017] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 10:53:54,646 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 10:53:54,646 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 10:53:54,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044657321] [2021-12-15 10:53:54,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 10:53:54,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-15 10:53:54,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:53:54,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 10:53:54,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 10:53:54,648 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) [2021-12-15 10:53:54,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:53:54,660 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2021-12-15 10:53:54,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 10:53:54,660 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 [2021-12-15 10:53:54,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:53:54,661 INFO L225 Difference]: With dead ends: 16 [2021-12-15 10:53:54,661 INFO L226 Difference]: Without dead ends: 10 [2021-12-15 10:53:54,661 INFO L932 BasicCegarLoop]: 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 [2021-12-15 10:53:54,668 INFO L933 BasicCegarLoop]: 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 [2021-12-15 10:53:54,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 10 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 10:53:54,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2021-12-15 10:53:54,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2021-12-15 10:53:54,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) [2021-12-15 10:53:54,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2021-12-15 10:53:54,670 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2021-12-15 10:53:54,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:53:54,670 INFO L470 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2021-12-15 10:53:54,671 INFO L471 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) [2021-12-15 10:53:54,671 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2021-12-15 10:53:54,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-15 10:53:54,671 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:53:54,671 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:53:54,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-15 10:53:54,671 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:53:54,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:53:54,672 INFO L85 PathProgramCache]: Analyzing trace with hash 295691924, now seen corresponding path program 1 times [2021-12-15 10:53:54,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:53:54,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168147019] [2021-12-15 10:53:54,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:53:54,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:53:54,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:53:54,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:53:54,738 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:53:54,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168147019] [2021-12-15 10:53:54,738 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168147019] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:53:54,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436806393] [2021-12-15 10:53:54,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:53:54,739 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:53:54,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:53:54,740 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) [2021-12-15 10:53:54,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-15 10:53:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:53:54,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-15 10:53:54,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:53:54,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:53:54,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:53:54,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:53:54,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436806393] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:53:54,863 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:53:54,863 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-12-15 10:53:54,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229155548] [2021-12-15 10:53:54,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:53:54,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-15 10:53:54,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:53:54,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-15 10:53:54,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-12-15 10:53:54,865 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) [2021-12-15 10:53:54,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:53:54,914 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2021-12-15 10:53:54,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 10:53:54,915 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 [2021-12-15 10:53:54,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:53:54,916 INFO L225 Difference]: With dead ends: 20 [2021-12-15 10:53:54,916 INFO L226 Difference]: Without dead ends: 14 [2021-12-15 10:53:54,917 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2021-12-15 10:53:54,920 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 10:53:54,921 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 15 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 10:53:54,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-12-15 10:53:54,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2021-12-15 10:53:54,928 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) [2021-12-15 10:53:54,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2021-12-15 10:53:54,928 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 8 [2021-12-15 10:53:54,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:53:54,929 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2021-12-15 10:53:54,929 INFO L471 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) [2021-12-15 10:53:54,929 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2021-12-15 10:53:54,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-15 10:53:54,930 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:53:54,930 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:53:54,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-15 10:53:55,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:53:55,140 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:53:55,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:53:55,140 INFO L85 PathProgramCache]: Analyzing trace with hash 572634524, now seen corresponding path program 1 times [2021-12-15 10:53:55,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:53:55,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303192993] [2021-12-15 10:53:55,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:53:55,141 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:53:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:53:55,215 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:53:55,215 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:53:55,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303192993] [2021-12-15 10:53:55,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303192993] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:53:55,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628836566] [2021-12-15 10:53:55,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:53:55,216 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:53:55,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:53:55,218 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) [2021-12-15 10:53:55,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-15 10:53:55,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:53:55,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-15 10:53:55,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:53:55,348 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:53:55,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:53:55,454 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:53:55,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [628836566] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:53:55,454 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:53:55,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 10 [2021-12-15 10:53:55,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832805678] [2021-12-15 10:53:55,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:53:55,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-15 10:53:55,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:53:55,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-15 10:53:55,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2021-12-15 10:53:55,459 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 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) [2021-12-15 10:53:55,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:53:55,601 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2021-12-15 10:53:55,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-15 10:53:55,602 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-15 10:53:55,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:53:55,602 INFO L225 Difference]: With dead ends: 28 [2021-12-15 10:53:55,602 INFO L226 Difference]: Without dead ends: 21 [2021-12-15 10:53:55,603 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2021-12-15 10:53:55,603 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 15 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-15 10:53:55,604 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 17 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-15 10:53:55,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-12-15 10:53:55,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-12-15 10:53:55,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.1) internal successors, (22), 20 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) [2021-12-15 10:53:55,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2021-12-15 10:53:55,606 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 12 [2021-12-15 10:53:55,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:53:55,606 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2021-12-15 10:53:55,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 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) [2021-12-15 10:53:55,607 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2021-12-15 10:53:55,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-15 10:53:55,607 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:53:55,607 INFO L514 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:53:55,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-15 10:53:55,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-15 10:53:55,811 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:53:55,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:53:55,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1634475176, now seen corresponding path program 2 times [2021-12-15 10:53:55,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:53:55,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479760131] [2021-12-15 10:53:55,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:53:55,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:53:55,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:53:55,912 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:53:55,913 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:53:55,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479760131] [2021-12-15 10:53:55,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479760131] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:53:55,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585750203] [2021-12-15 10:53:55,916 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-15 10:53:55,917 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:53:55,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:53:55,917 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) [2021-12-15 10:53:55,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-15 10:53:55,943 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-15 10:53:55,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 10:53:55,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-15 10:53:55,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:53:56,079 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:53:56,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:53:56,294 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:53:56,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585750203] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:53:56,295 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:53:56,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 18 [2021-12-15 10:53:56,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441420375] [2021-12-15 10:53:56,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:53:56,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-15 10:53:56,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:53:56,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-15 10:53:56,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2021-12-15 10:53:56,296 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 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) [2021-12-15 10:53:58,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:53:58,001 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2021-12-15 10:53:58,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-15 10:53:58,002 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 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 20 [2021-12-15 10:53:58,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:53:58,003 INFO L225 Difference]: With dead ends: 44 [2021-12-15 10:53:58,003 INFO L226 Difference]: Without dead ends: 37 [2021-12-15 10:53:58,003 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=231, Invalid=369, Unknown=0, NotChecked=0, Total=600 [2021-12-15 10:53:58,004 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 35 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-15 10:53:58,004 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 19 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-15 10:53:58,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-12-15 10:53:58,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2021-12-15 10:53:58,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 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) [2021-12-15 10:53:58,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2021-12-15 10:53:58,009 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 20 [2021-12-15 10:53:58,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:53:58,009 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2021-12-15 10:53:58,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 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) [2021-12-15 10:53:58,009 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2021-12-15 10:53:58,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-15 10:53:58,010 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:53:58,010 INFO L514 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 10:53:58,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-15 10:53:58,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:53:58,226 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:53:58,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:53:58,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1104705856, now seen corresponding path program 3 times [2021-12-15 10:53:58,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:53:58,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621837858] [2021-12-15 10:53:58,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:53:58,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:53:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:53:58,434 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 15 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 10:53:58,434 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:53:58,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621837858] [2021-12-15 10:53:58,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621837858] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:53:58,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900793852] [2021-12-15 10:53:58,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-15 10:53:58,435 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:53:58,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:53:58,439 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) [2021-12-15 10:53:58,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-15 10:53:58,466 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-15 10:53:58,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 10:53:58,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-15 10:53:58,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:53:58,569 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 42 proven. 1 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2021-12-15 10:53:58,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:53:58,826 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 42 proven. 1 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2021-12-15 10:53:58,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900793852] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:53:58,827 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:53:58,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 4, 7] total 24 [2021-12-15 10:53:58,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329166681] [2021-12-15 10:53:58,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:53:58,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-15 10:53:58,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:53:58,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-15 10:53:58,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2021-12-15 10:53:58,830 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 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) [2021-12-15 10:53:59,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:53:59,189 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2021-12-15 10:53:59,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-15 10:53:59,190 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 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 36 [2021-12-15 10:53:59,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:53:59,192 INFO L225 Difference]: With dead ends: 54 [2021-12-15 10:53:59,192 INFO L226 Difference]: Without dead ends: 45 [2021-12-15 10:53:59,192 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=527, Unknown=0, NotChecked=0, Total=702 [2021-12-15 10:53:59,193 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 43 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-15 10:53:59,193 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 17 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-15 10:53:59,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-12-15 10:53:59,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2021-12-15 10:53:59,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 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) [2021-12-15 10:53:59,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2021-12-15 10:53:59,200 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 36 [2021-12-15 10:53:59,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:53:59,201 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2021-12-15 10:53:59,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 24 states have internal predecessors, (49), 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) [2021-12-15 10:53:59,202 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2021-12-15 10:53:59,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-15 10:53:59,203 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:53:59,203 INFO L514 BasicCegarLoop]: trace histogram [19, 15, 4, 1, 1, 1, 1, 1, 1] [2021-12-15 10:53:59,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-15 10:53:59,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:53:59,420 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:53:59,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:53:59,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1664138286, now seen corresponding path program 4 times [2021-12-15 10:53:59,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:53:59,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951868325] [2021-12-15 10:53:59,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:53:59,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:53:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:53:59,633 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 112 proven. 240 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-15 10:53:59,634 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:53:59,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951868325] [2021-12-15 10:53:59,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951868325] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:53:59,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609122603] [2021-12-15 10:53:59,634 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-15 10:53:59,634 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:53:59,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:53:59,635 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) [2021-12-15 10:53:59,678 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-15 10:53:59,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 10:53:59,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-15 10:53:59,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-15 10:53:59,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:53:59,866 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 54 proven. 306 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 10:53:59,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:54:00,666 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 54 proven. 306 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-15 10:54:00,667 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609122603] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:54:00,667 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:54:00,667 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 21] total 40 [2021-12-15 10:54:00,667 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017612848] [2021-12-15 10:54:00,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:54:00,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2021-12-15 10:54:00,668 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:54:00,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2021-12-15 10:54:00,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=455, Invalid=1105, Unknown=0, NotChecked=0, Total=1560 [2021-12-15 10:54:00,669 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 40 states, 40 states have (on average 2.1) internal successors, (84), 40 states have internal predecessors, (84), 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) [2021-12-15 10:54:10,982 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (< .cse0 10000000) (<= 100000000 .cse0))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (<= 100000000 .cse1) (< .cse1 10000000))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (< .cse2 10000000) (<= 100000000 .cse2))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (<= 100000000 .cse3) (< .cse3 10000000))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (< .cse4 10000000) (<= 100000000 .cse4))) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 10000000) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (<= 100000000 .cse5) (< .cse5 10000000))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (<= 100000000 .cse6) (< .cse6 10000000))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (<= 100000000 .cse7) (< .cse7 10000000))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (<= 100000000 .cse8) (< .cse8 10000000))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (<= 100000000 .cse9) (< .cse9 10000000))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< .cse10 10000000) (<= 100000000 .cse10))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 7) 4294967296))) (or (< .cse11 10000000) (<= 100000000 .cse11))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (<= 100000000 .cse12) (< .cse12 10000000))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (< .cse13 10000000) (<= 100000000 .cse13))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (<= 100000000 .cse14) (< .cse14 10000000)))) is different from false [2021-12-15 10:54:47,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 10:54:47,098 INFO L93 Difference]: Finished difference Result 100 states and 126 transitions. [2021-12-15 10:54:47,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-12-15 10:54:47,099 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.1) internal successors, (84), 40 states have internal predecessors, (84), 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 [2021-12-15 10:54:47,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-15 10:54:47,100 INFO L225 Difference]: With dead ends: 100 [2021-12-15 10:54:47,100 INFO L226 Difference]: Without dead ends: 87 [2021-12-15 10:54:47,101 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 46.5s TimeCoverageRelationStatistics Valid=1149, Invalid=2160, Unknown=1, NotChecked=112, Total=3422 [2021-12-15 10:54:47,101 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 87 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-15 10:54:47,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 35 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 670 Invalid, 0 Unknown, 2 Unchecked, 0.7s Time] [2021-12-15 10:54:47,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-12-15 10:54:47,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2021-12-15 10:54:47,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.0595238095238095) internal successors, (89), 84 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) [2021-12-15 10:54:47,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2021-12-15 10:54:47,108 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 44 [2021-12-15 10:54:47,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-15 10:54:47,108 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2021-12-15 10:54:47,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.1) internal successors, (84), 40 states have internal predecessors, (84), 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) [2021-12-15 10:54:47,108 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2021-12-15 10:54:47,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-12-15 10:54:47,110 INFO L506 BasicCegarLoop]: Found error trace [2021-12-15 10:54:47,110 INFO L514 BasicCegarLoop]: trace histogram [38, 34, 4, 1, 1, 1, 1, 1, 1] [2021-12-15 10:54:47,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-15 10:54:47,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:54:47,311 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-15 10:54:47,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 10:54:47,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1705672597, now seen corresponding path program 5 times [2021-12-15 10:54:47,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 10:54:47,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116087114] [2021-12-15 10:54:47,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 10:54:47,312 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 10:54:47,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 10:54:47,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 245 proven. 1190 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-15 10:54:47,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 10:54:47,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116087114] [2021-12-15 10:54:47,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116087114] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-15 10:54:47,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020031231] [2021-12-15 10:54:47,966 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-15 10:54:47,966 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-15 10:54:47,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 10:54:47,967 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) [2021-12-15 10:54:47,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-15 10:55:03,057 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 39 check-sat command(s) [2021-12-15 10:55:03,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-15 10:55:03,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 74 conjunts are in the unsatisfiable core [2021-12-15 10:55:03,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-15 10:55:03,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 180 proven. 1260 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-15 10:55:03,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-15 10:55:06,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 180 proven. 1260 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-15 10:55:06,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020031231] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-15 10:55:06,222 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-15 10:55:06,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38, 39] total 76 [2021-12-15 10:55:06,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145563970] [2021-12-15 10:55:06,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-15 10:55:06,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2021-12-15 10:55:06,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 10:55:06,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2021-12-15 10:55:06,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1554, Invalid=4146, Unknown=0, NotChecked=0, Total=5700 [2021-12-15 10:55:06,229 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand has 76 states, 76 states have (on average 2.0526315789473686) internal successors, (156), 76 states have internal predecessors, (156), 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) [2021-12-15 10:55:09,102 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse0 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 6) 4294967296))) (or (<= 100000000 .cse0) (< .cse0 10000000))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 24) 4294967296))) (or (<= 100000000 .cse1) (< .cse1 10000000))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 20) 4294967296))) (or (< .cse2 10000000) (<= 100000000 .cse2))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 17) 4294967296))) (or (< .cse3 10000000) (<= 100000000 .cse3))) (let ((.cse4 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 21) 4294967296))) (or (<= 100000000 .cse4) (< .cse4 10000000))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 9) 4294967296))) (or (<= 100000000 .cse5) (< .cse5 10000000))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 36) 4294967296))) (or (<= 100000000 .cse6) (< .cse6 10000000))) (let ((.cse7 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 28) 4294967296))) (or (< .cse7 10000000) (<= 100000000 .cse7))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 30) 4294967296))) (or (<= 100000000 .cse8) (< .cse8 10000000))) (let ((.cse9 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 7) 4294967296))) (or (< .cse9 10000000) (<= 100000000 .cse9))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 32) 4294967296))) (or (< .cse10 10000000) (<= 100000000 .cse10))) (let ((.cse11 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 3) 4294967296))) (or (<= 100000000 .cse11) (< .cse11 10000000))) (let ((.cse12 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 35) 4294967296))) (or (<= 100000000 .cse12) (< .cse12 10000000))) (let ((.cse13 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 5) 4294967296))) (or (<= 100000000 .cse13) (< .cse13 10000000))) (let ((.cse14 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 23) 4294967296))) (or (< .cse14 10000000) (<= 100000000 .cse14))) (let ((.cse15 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 8) 4294967296))) (or (< .cse15 10000000) (<= 100000000 .cse15))) (let ((.cse16 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 13) 4294967296))) (or (< .cse16 10000000) (<= 100000000 .cse16))) (let ((.cse17 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 26) 4294967296))) (or (< .cse17 10000000) (<= 100000000 .cse17))) (let ((.cse18 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 4) 4294967296))) (or (<= 100000000 .cse18) (< .cse18 10000000))) (let ((.cse19 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 25) 4294967296))) (or (<= 100000000 .cse19) (< .cse19 10000000))) (< (mod |c_ULTIMATE.start_main_~x~0#1| 4294967296) 10000000) (let ((.cse20 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 31) 4294967296))) (or (<= 100000000 .cse20) (< .cse20 10000000))) (let ((.cse21 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 12) 4294967296))) (or (<= 100000000 .cse21) (< .cse21 10000000))) (let ((.cse22 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 15) 4294967296))) (or (<= 100000000 .cse22) (< .cse22 10000000))) (let ((.cse23 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 2) 4294967296))) (or (<= 100000000 .cse23) (< .cse23 10000000))) (let ((.cse24 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 16) 4294967296))) (or (<= 100000000 .cse24) (< .cse24 10000000))) (let ((.cse25 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 34) 4294967296))) (or (< .cse25 10000000) (<= 100000000 .cse25))) (let ((.cse26 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 27) 4294967296))) (or (< .cse26 10000000) (<= 100000000 .cse26))) (let ((.cse27 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 10) 4294967296))) (or (< .cse27 10000000) (<= 100000000 .cse27))) (let ((.cse28 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 19) 4294967296))) (or (<= 100000000 .cse28) (< .cse28 10000000))) (let ((.cse29 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 33) 4294967296))) (or (< .cse29 10000000) (<= 100000000 .cse29))) (let ((.cse30 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 22) 4294967296))) (or (< .cse30 10000000) (<= 100000000 .cse30))) (let ((.cse31 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 29) 4294967296))) (or (< .cse31 10000000) (<= 100000000 .cse31))) (let ((.cse32 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 11) 4294967296))) (or (< .cse32 10000000) (<= 100000000 .cse32))) (let ((.cse33 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 14) 4294967296))) (or (<= 100000000 .cse33) (< .cse33 10000000))) (let ((.cse34 (mod (+ |c_ULTIMATE.start_main_~x~0#1| 18) 4294967296))) (or (<= 100000000 .cse34) (< .cse34 10000000)))) is different from false